Properties of Random Graphs with Hidden Color
Bo Soderberg
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.
Create a lesson
Related papers
Partial Localization and Multifractality in Heterogeneous Population Growth with Resetting
Maximilien Bernard, Giuseppe Del Vecchio Del Vecchio, Jean-Philippe Bouchaud et al.
Sluggish random walks with resetting: nonequilibrium aspects
Theophilus Dwamena Frimpong, Léa Bresque, Edgar Roldán
Spin-1/2 Heisenberg diamond-like decorated honeycomb lattice in a magnetic field from the perspective of localized magnons and exact diagonalization
Katarina Karlova, Malo Rouxel, Jozef Strecka et al.
Twist-controlled thermodynamic anomalies in bilayer q-state clock models
Ze-Heng Yu, Liang He
Diffusion-Induced Stabilization of Nonreciprocal Wealth Dynamics
Pierre Bousseyroux, Gilles Zérah, Michael Benzaquen
Synchronization induced by stochastic subsystem resetting in complex networks
Kevin Paramero-Arias, Alejandro P. Riascos