Properties of Random Graphs with Hidden Color

Abstract

We investigate in some detail a recently suggested general class of ensembles of sparse undirected random graphs based on a hidden stub-coloring, with or without the restriction to nondegenerate graphs. The calculability of local and global structural properties of graphs from the resulting ensembles is demonstrated. Cluster size statistics are derived with generating function techniques, yielding a well-defined percolation threshold. Explicit rules are derived for the enumeration of small subgraphs. Duality and redundancy is discussed, and subclasses corresponding to commonly studied models are identified.

14 pages, LaTeX, no figures

References in corpus (7)

• Mixing patterns in networks
• Specificity and stability in topology of protein networks
• Are randomly grown graphs really random?
• A General Formalism for Inhomogeneous Random Graphs
• Statistical ensemble of scale-free random graphs
• Correlated random networks
• Random Graphs with Hidden Color

Cited by in corpus (12)

• Multilayer Networks
• The structure and dynamics of multilayer networks
• The phase transition in inhomogeneous random graphs
• Spreading processes in Multilayer Networks
• Analysis of complex contagions in random multiplex networks
• Conjoining Speeds up Information Diffusion in Overlaying Social-Physical Networks
• Towards real-world complexity: an introduction to multiplex networks
• Graph Annotations in Modeling Complex Network Topologies
• Percolation on feature-enriched interconnected systems
• Networks with given two-point correlations: hidden correlations from degree correlations
• Multidimensional epidemic thresholds in diffusion processes over interdependent networks
• Strength Distribution in Derivative Networks