Tailored graph ensembles as proxies or null models for real networks II: results on directed graphs
arXiv:1101.6022 · doi:10.1088/1751-8113/44/27/275002
Abstract
We generate new mathematical tools with which to quantify the macroscopic topological structure of large directed networks. This is achieved via a statistical mechanical analysis of constrained maximum entropy ensembles of directed random graphs with prescribed joint distributions for in- and outdegrees and prescribed degree-degree correlation functions. We calculate exact and explicit formulae for the leading orders in the system size of the Shannon entropies and complexities of these ensembles, and for information-theoretic distances. The results are applied to data on gene regulation networks.
arXiv comment21 pages, 1 figure, submitted to J. Phys. A
References in corpus (5)
- Statistical mechanics of complex networks
- Critical phenomena in complex networks
- Entropies of complex networks with hierarchically constrained topologies
- Constrained Markovian dynamics of random graphs
- Tailored graph ensembles as proxies or null models for real networks I: tools for quantifying structure
Cited by in corpus (9)
- The Statistical Physics of Real-World Networks
- Quantifying randomness in real networks
- Entropy rate of non-equilibrium growing networks
- Analysis of the convergence of the degree distribution of contracting random networks towards a Poisson distribution using the relative entropy
- Convergence towards an Erd{\H o}s-Rényi graph structure in network contraction processes
- The role of adjacency matrix degeneration in maximum entropy weighted network models
- The structure of networks that evolve under a combination of growth, via node addition and random attachment, and contraction, via random node deletion
- The distribution of first hitting times of random walks on directed Erdős-Rényi networks
- Generating random networks that consist of a single connected component with a given degree distribution