A novel configuration model for random graphs with given degree sequence
arXiv:0708.2601 · doi:10.1088/1009-1963/16/2/002
Abstract
Recently, random graphs in which vertices are characterized by hidden variables controlling the establishment of edges between pairs of vertices have attracted much attention. Here, we present a specific realization of a class of random network models in which the connection probability between two vertices (i,j) is a specific function of degrees ki and kj. In the framework of the configuration model of random graphs, we find analytical expressions for the degree correlation and clustering as a function of the variance of the desired degree distribution. The expressions obtained are checked by means of numerical simulations. Possible applications of our model are discussed.
7 pages, 3 figures
References in corpus (15)
- Emergence of scaling in random networks
- The structure and function of complex networks
- Epidemic spreading in scale-free networks
- Assortative mixing in networks
- Random graphs with arbitrary degree distributions and their applications
- Hierarchical Organization in Complex Networks
- Pseudofractal Scale-free Web
- Class of correlated random networks with hidden variables
- Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations
- Sandpile on Scale-Free Networks
- A General Formalism for Inhomogeneous Random Graphs
- Structural transitions in scale-free networks
- Fluctuation-dissipation relations for complex networks
- Pair Correlations in Scale-Free Networks
- Mechanism for linear preferential attachment in growing networks