We shall review the foundation of the theory of random graphs by Paul Erdős and Alfréd Rényi, and sketch some of the later developments concerning the giant component, including some very recent results
Building on the methods developed in joint work with Béla Bollobás and Svante Janson, we study the p...
Abstract. We describe recent results, obtained in collaborations with C. Borgs, J.T. Chayes, R. van ...
We derive the full phase diagram for a large family of two-parameter exponential random graph models...
Zufallsgraphen sind Graphen, die durch einen zufälligen Prozess erzeugt werden. Ein im Zusammenhang ...
Abstract. We study the simple random walk on the giant component of a supercritical Erdős-Rényi ra...
Let H m(n) be a random graph on n vertices, grown by adding vertices one at a time, joining each new...
We introduce a very general model of an inhomogenous random graph with independence between the edge...
What is the number of vertices in the largest connected component of the Erdös-Rényi random graph ...
A randomly evolving graph, with vertices immigrating at rate n and each possible edge appearing at r...
The aim of this paper is to study the emergence of the giant component in the uniformly grown random...
Abstract. The evolution of the largest component has been studied intensely in a variety of random g...
It is well known that the branching process approach to the study of the random graph Gn,p gives a v...
We study a large-time limit of a Markov process whose states are finite graphs. The number of the ve...
ABSTRACT: We study a random graph model which is a superposition of bond percolation on Zd with para...
We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This ...
Building on the methods developed in joint work with Béla Bollobás and Svante Janson, we study the p...
Abstract. We describe recent results, obtained in collaborations with C. Borgs, J.T. Chayes, R. van ...
We derive the full phase diagram for a large family of two-parameter exponential random graph models...
Zufallsgraphen sind Graphen, die durch einen zufälligen Prozess erzeugt werden. Ein im Zusammenhang ...
Abstract. We study the simple random walk on the giant component of a supercritical Erdős-Rényi ra...
Let H m(n) be a random graph on n vertices, grown by adding vertices one at a time, joining each new...
We introduce a very general model of an inhomogenous random graph with independence between the edge...
What is the number of vertices in the largest connected component of the Erdös-Rényi random graph ...
A randomly evolving graph, with vertices immigrating at rate n and each possible edge appearing at r...
The aim of this paper is to study the emergence of the giant component in the uniformly grown random...
Abstract. The evolution of the largest component has been studied intensely in a variety of random g...
It is well known that the branching process approach to the study of the random graph Gn,p gives a v...
We study a large-time limit of a Markov process whose states are finite graphs. The number of the ve...
ABSTRACT: We study a random graph model which is a superposition of bond percolation on Zd with para...
We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This ...
Building on the methods developed in joint work with Béla Bollobás and Svante Janson, we study the p...
Abstract. We describe recent results, obtained in collaborations with C. Borgs, J.T. Chayes, R. van ...
We derive the full phase diagram for a large family of two-parameter exponential random graph models...
DOI
Add to ORKG