2003/05/08 by Bo Söderberg, Bo Soderberg
Computer Science · Mathematics · Physics and Astronomy · #Combinatorics #Complex Network Analysis Techniques #Computer science #Data Management and Algorithms #Discrete mathematics #Graph #Mathematics #Random graph #Redundancy (engineering) #Stochastic processes and statistical mechanics #cond-mat.soft #cond-mat.stat-mech
paper · pdf · doi:10.1103/physreve.68.026107
published as Physical Review E 68, 026107 (2003) · 14 pages, LaTeX, no figures
arxiv created 2003/05/08 · openalex publication_date 2003/08/12 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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.