The “classical” random graph models, in particular G(n,p), are “homogeneous,” in the sense that the degrees (for example) tend to be concentrated around a typical value. Many graphs arising in the… Expand

We introduce a very general model of an inhomogenous random graph with independence between the edges, which scales so that the number of edges is linear in the number of vertices. This scaling… Expand

A functional limit theorem is proved for multitype continuous time Markov branching processes. As consequences, we obtain limit theorems for the branching process stopped by some stopping rule, for… Expand

A “uniform” model of random graphs, which allows self-loops and multiple edges, is shown to lead to formulas that are substanitially simpler than the analogous formulas for the classical random graphs of Erdos and Renyi.Expand

Abstract.We study a generalized Pólya urn with balls of two colours and a triangular replacement matrix; the urn is not required to be balanced. We prove limit theorems describing the asymptotic… Expand

The asymptotic distribution of the number of Hamilton cycles in a random regular graph is determined, and results imply that some different models of random regular graphs are contiguous, which means that they are qualitatively asymPTotically equivalent.Expand

We use and extend a method by Hoeffding to obtain strong large deviation bounds for sums of dependent random variables with suitable dependency structure. The method is based on breaking up the sum… Expand