English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This is an extended version of the thesis presented to the Programa deP\'os-Gradua\c{c}\~ao em Matem\'atica of the Departamento de Matem\'atica,PUC-Rio, in September 2013, incorporating some suggestions from the examiningcommission.  Random graphs (and more generally hypergraphs) have been extensively studied,including their first order logic. In this work we focus on certain specificaspects of this vast theory. We consider the binomial model $G^{d+1}(n,p)$ ofthe random $(d+1)$-uniform hypergraph on $n$ vertices, where each edge ispresent, independently of one another, with probability $p=p(n)$. We areparticularly interested in the range $p(n) \sim C\log(n)/n^d$, after the doublejump and near connectivity. We prove several zero-one, and, more generally,convergence results and obtain combinatorial applications of some

Some examples of asymptotic combinatorial behavior, zero-one and convergence results on random hypergraphs