August 12, 2009
Similar papers 2
March 17, 2003
It has been argued that the observed anticorrelation between the degrees of adjacent vertices in the network representation of the Internet has its origin in the restriction that no two vertices have more than one edge connecting them. Here we introduce a formalism for modeling ensembles of graphs with single edges only and derive values for the exponents and correlation coefficients characterizing them. Our results confirm that the conjectured mechanism does indeed give rise...
May 25, 2004
We study the family of network models derived by requiring the expected properties of a graph ensemble to match a given set of measurements of a real-world network, while maximizing the entropy of the ensemble. Models of this type play the same role in the study of networks as is played by the Boltzmann distribution in classical statistical mechanics; they offer the best prediction of network properties subject to the constraints imposed by a given set of observations. We giv...
February 24, 2021
In the analysis of large-scale network data, a fundamental operation is the comparison of observed phenomena to the predictions provided by null models: when we find an interesting structure in a family of real networks, it is important to ask whether this structure is also likely to arise in random networks with similar characteristics to the real ones. A long-standing challenge in network analysis has been the relative scarcity of reasonable null models for networks; arguab...
May 27, 2015
Represented as graphs, real networks are intricate combinations of order and disorder. Fixing some of the structural properties of network models to their values observed in real networks, many other properties appear as statistical consequences of these fixed observables, plus randomness in other respects. Here we employ the $dk$-series, a complete set of basic characteristics of the network structure, to study the statistical dependencies between different network propertie...
March 7, 2007
We present a statistical mechanics approach for the description of complex networks. We first define an energy and an entropy associated to a degree distribution which have a geometrical interpretation. Next we evaluate the distribution which extremize the free energy of the network. We find two important limiting cases: a scale-free degree distribution and a finite-scale degree distribution. The size of the space of allowed simple networks given these distribution is evaluat...
May 2, 2006
We present a new, systematic approach for analyzing network topologies. We first introduce the dK-series of probability distributions specifying all degree correlations within d-sized subgraphs of a given graph G. Increasing values of d capture progressively more properties of G at the cost of more complex representation of the probability distribution. Using this series, we can quantitatively measure the distance between two graphs and construct random graphs that accurately...
December 1, 2010
Dynamical processes on complex networks such as information propagation, innovation diffusion, cascading failures or epidemic spreading are highly affected by their underlying topologies as characterized by, for instance, degree-degree correlations. Here, we introduce the concept of copulas in order to artificially generate random networks with an arbitrary degree distribution and a rich a priori degree-degree correlation (or `association') structure. The accuracy of the prop...
July 4, 2008
For many complex networks present in nature only a single instance, usually of large size, is available. Any measurement made on this single instance cannot be repeated on different realizations. In order to detect significant patterns in a real--world network it is therefore crucial to compare the measured results with a null model counterpart. Here we focus on dense and weighted networks, proposing a suitable null model and studying the behaviour of the degree correlations ...
February 12, 2007
We present a link rewiring mechanism to produce surrogates of a network where both the degree distribution and the rich--club connectivity are preserved. We consider three real networks, the AS--Internet, the protein interaction and the scientific collaboration. We show that for a given degree distribution, the rich--club connectivity is sensitive to the degree--degree correlation, and on the other hand the degree--degree correlation is constrained by the rich--club connectiv...
January 30, 2004
In this article we give an in depth overview of the recent advances in the field of equilibrium networks. After outlining this topic, we provide a novel way of defining equilibrium graph (network) ensembles. We illustrate this concept on the classical random graph model and then survey a large variety of recently studied network models. Next, we analyze the structural properties of the graphs in these ensembles in terms of both local and global characteristics, such as degree...