We establish central and local limit theorems for the number of vertices in the largest component of a random d-uniform hypergraph Hd(n,p) with edge probability p = c/, where c > (d - 1)-1 is a constant. The proof relies on a new, purely probabilistic approach
AbstractThe random graphs G(n, Pr(edge)=p), G(n, #edges=M) at the critical range p=(1+λn−1/3)/n and ...
We consider the random hyperbolic graph model introduced by [KPK + 10] and then formalized by [GPP12...
We study the 'rank 1 case' of the inhomogeneous random graph model. In the subcritical case we deriv...
We study the largest component of a random (multi)graph on n vertices with a given degree sequence. ...
AbstractLet M denote the order of the largest component in a random subgraph H of the n-cycle Cn, wh...
In 1990 Bender, Canfield, and McKay gave an asymptotic formula for the number of connected graphs on...
AbstractDefine an ℓ-component to be a connected b-uniform hypergraph with k edges and k(b−1)−ℓ verti...
Recently, we adapted random walk arguments based on work of Nachmias and Peres, Martin-Löf, Karp and...
AbstractWe show that in the evolution of the random d-uniform hypergraph Gd(n,M) the phase transitio...
Recently, in [Random Struct Algorithm 41 (2012), 441–450] we adapted exploration and martingale argu...
In 1990 Bender, Canfield and McKay gave an asymptotic formula for the number of connected graphs on ...
We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This ...
Consider random graph with $N+ 1$ vertices as follows. The degrees of vertices $1,2,\ldots, N$ are t...
Résumé étenduDenote by an $\ell$-component a connected $b$-uniform hypergraph with $k$ edges and $k(...
In this paper, we investigate the appearance of the giant component in random subgraphs G(p) of a gi...
AbstractThe random graphs G(n, Pr(edge)=p), G(n, #edges=M) at the critical range p=(1+λn−1/3)/n and ...
We consider the random hyperbolic graph model introduced by [KPK + 10] and then formalized by [GPP12...
We study the 'rank 1 case' of the inhomogeneous random graph model. In the subcritical case we deriv...
We study the largest component of a random (multi)graph on n vertices with a given degree sequence. ...
AbstractLet M denote the order of the largest component in a random subgraph H of the n-cycle Cn, wh...
In 1990 Bender, Canfield, and McKay gave an asymptotic formula for the number of connected graphs on...
AbstractDefine an ℓ-component to be a connected b-uniform hypergraph with k edges and k(b−1)−ℓ verti...
Recently, we adapted random walk arguments based on work of Nachmias and Peres, Martin-Löf, Karp and...
AbstractWe show that in the evolution of the random d-uniform hypergraph Gd(n,M) the phase transitio...
Recently, in [Random Struct Algorithm 41 (2012), 441–450] we adapted exploration and martingale argu...
In 1990 Bender, Canfield and McKay gave an asymptotic formula for the number of connected graphs on ...
We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This ...
Consider random graph with $N+ 1$ vertices as follows. The degrees of vertices $1,2,\ldots, N$ are t...
Résumé étenduDenote by an $\ell$-component a connected $b$-uniform hypergraph with $k$ edges and $k(...
In this paper, we investigate the appearance of the giant component in random subgraphs G(p) of a gi...
AbstractThe random graphs G(n, Pr(edge)=p), G(n, #edges=M) at the critical range p=(1+λn−1/3)/n and ...
We consider the random hyperbolic graph model introduced by [KPK + 10] and then formalized by [GPP12...
We study the 'rank 1 case' of the inhomogeneous random graph model. In the subcritical case we deriv...
DOI
Add to ORKG