Random graphs with a given degree sequence are often constructed using the configuration model, which yields a random multigraph. We may adjust this multigraph by a sequence of switchings, eventually yielding a
random graph with given degreesWe consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model and then, by a conditioning...
We study in particular the random graph defined as the uniform distribution on graphs with a given degree sequence. We characterise degree sequences that define contiguous random graph sequences, and in particular contiguous to an Erd艖s-R茅nyi random graph. The method allows to extend a result...
We propose a random graph model which is a special case of sparserandom graphs with given degree sequences which satisfy a power law. This model involves only a small number of paramo eters, called logsize and log-log growth rate. These parameters capture some universal characteristics of ...
1 Introduction Various papers (see e.g., [4, 7, 13, 18, 20]) study properties of random graphs with a given degree sequence. Among such properties as connectivity, cluster size and diameter, the graph distance between two uniformly chosen nodes is an important one. For two connected ...
1.3 Previous Work Strictly speaking our model is a special case of random graphs with a given degree sequence for which there is a large literature. For example, Wormald [17] studied the connectivity of graphs whose degrees are in an interval [r, R], where r ≥ 3. Luczak [13] ...
Given a sequence of positive integers (di),1⩽i⩽n, we call a graph with degree sequence (di) a (di)-graph. The random (di)-graph, which we denote by Gn,(di), is obtained by sampling uniformly at random from the set of all possible simple (di)-graphs on n vertices. Lemma...
Moshen Bayati, Jeong Han Kim, and Amin Saberi, A sequential algorithm for generating random graphs. Algorithmica, Volume 58, Number 4, 860-910, DOI: 10.1007/s00453-009-9340-1 例子: >>> sequence = [1, 2, 2, 3] >>> G = nx.random_degree_sequence_graph(sequence, seed=42) ...
Random geometric graphs in hyperbolic spaces explain many common structural and dynamical properties of real networks, yet they fail to predict the correct values of the exponents of power-law degree distributions observed in real networks. In that respect, random geometric graphs in asymptotically de...
The average distances in random graphs with given expected degrees. Proc. Natl. Acad. Sci. U.S.A. 99, 15879–15882 (2002). Article CAS ADS MathSciNet Google Scholar Zachary, W. An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452–473 (...