Random Graphs with Hidden Color
arXiv:cond-mat/0303466 · doi:10.1103/PhysRevE.68.015102
Abstract
We propose and investigate a unifying class of sparse random graph models, based on a hidden coloring of edge-vertex incidences, extending an existing approach, Random graphs with a given degree distribution, in a way that admits a nontrivial correlation structure in the resulting graphs. The approach unifies a number of existing random graph ensembles within a common general formalism, and allows for the analytic calculation of observable graph characteristics. In particular, generating function techniques are used to derive the size distribution of connected components (clusters) as well as the location of the percolation threshold where a giant component appears.
4 pages, no figures, RevTeX
References in corpus (4)
Cited by in corpus (19)
- Multilayer Networks
- The structure and dynamics of multilayer networks
- The phase transition in inhomogeneous random graphs
- Analysis of complex contagions in random multiplex networks
- Conjoining Speeds up Information Diffusion in Overlaying Social-Physical Networks
- Correlated multiplexity and connectivity of multiplex random networks
- Towards real-world complexity: an introduction to multiplex networks
- Properties of Random Graphs with Hidden Color
- Graph Annotations in Modeling Complex Network Topologies
- Clustering determines the dynamics of complex contagions in multiplex networks
- Networks with given two-point correlations: hidden correlations from degree correlations
- Minimal models of weighted scale-free networks
- Dynamic Hidden-Variable Network Models
- Entropy of labeled versus unlabeled networks
- Multidimensional epidemic thresholds in diffusion processes over interdependent networks
- Diffusion of Real-Time Information in Social-Physical Networks
- Blind Extraction of Equitable Partitions from Graph Signals
- Neighborhood Structure Configuration Models
- Multi-Stage Complex Contagions in Random Multiplex Networks