AbstractWe show that in the evolution of the random d-uniform hypergraph Gd(n,M) the phase transition occurs when M=n/d(d−1)+O(n2/3). We also prove local limit theorems for the distribution of the size of the largest component of Gd(n,M) in the subcritical and in the early supercritical phase
Let H m(n) be a random graph on n vertices, grown by adding vertices one at a time, joining each new...
Let H m(n) be a random graph on n vertices, grown by adding vertices one at a time, joining each new...
Let P (n,M) be a graph chosen uniformly at random from the family of all labeled planar graphs with ...
AbstractWe show that in the evolution of the random d-uniform hypergraph Gd(n,M) the phase transitio...
Recently, we adapted random walk arguments based on work of Nachmias and Peres, Martin-Löf, Karp and...
Recently, we adapted random walk arguments based on work of Nachmias and Peres, Martin-Löf, Karp and...
We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This ...
We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This ...
Non-uniform hypergraphs appear in various domains of computer sci-ence as in the satisfiability prob...
We study a large-time limit of a Markov process whose states are finite graphs. The number of the ve...
This PhD thesis deals with two different types of questions on random graph and random hypergraph st...
We introduce a very general model of an inhomogenous random graph with independence between the edge...
Abstract. We describe recent results, obtained in collaborations with C. Borgs, J.T. Chayes, R. van ...
Let H m(n) be a random graph on n vertices, grown by adding vertices one at a time, joining each new...
In this paper we consider random distance graphs motivated by applications in neurobiology. These mo...
Let H m(n) be a random graph on n vertices, grown by adding vertices one at a time, joining each new...
Let H m(n) be a random graph on n vertices, grown by adding vertices one at a time, joining each new...
Let P (n,M) be a graph chosen uniformly at random from the family of all labeled planar graphs with ...
AbstractWe show that in the evolution of the random d-uniform hypergraph Gd(n,M) the phase transitio...
Recently, we adapted random walk arguments based on work of Nachmias and Peres, Martin-Löf, Karp and...
Recently, we adapted random walk arguments based on work of Nachmias and Peres, Martin-Löf, Karp and...
We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This ...
We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This ...
Non-uniform hypergraphs appear in various domains of computer sci-ence as in the satisfiability prob...
We study a large-time limit of a Markov process whose states are finite graphs. The number of the ve...
This PhD thesis deals with two different types of questions on random graph and random hypergraph st...
We introduce a very general model of an inhomogenous random graph with independence between the edge...
Abstract. We describe recent results, obtained in collaborations with C. Borgs, J.T. Chayes, R. van ...
Let H m(n) be a random graph on n vertices, grown by adding vertices one at a time, joining each new...
In this paper we consider random distance graphs motivated by applications in neurobiology. These mo...
Let H m(n) be a random graph on n vertices, grown by adding vertices one at a time, joining each new...
Let H m(n) be a random graph on n vertices, grown by adding vertices one at a time, joining each new...
Let P (n,M) be a graph chosen uniformly at random from the family of all labeled planar graphs with ...
DOI
Add to ORKG