Transitions in loopy graphs
We analyze maximum entropy random graph ensembles with constrained degrees, drawn from arbitrary degree distributions, and a tuneable number of 3-loops (triangles). We find that such ensembles generally exhibit two transitions, a clustering and a shattering transition, separating three distinct regimes. At the clustering transition, the graphs change from typically having only isolated loops to forming loop clusters. At the shattering transition the graphs break up into extensively many small cliques to achieve the desired loop density. The locations of both transitions depend nontrivially on the system size. We derive a general formula for the loop density in the regime of isolated loops, for graphs with degree distributions that have finite and second moments. For bounded degree distributions we present further analytical results on loop densities and phase transition locations, which, while non-rigorous, are all validated via MCMC sampling simulations. We show that the shattering transition is of an entropic nature, occurring for all loop density values, provided the system is large enough.
Submitted to JPhys Complexity (2020)
More in Intelligence of graphs
A mathematical model captures the temporal and steady state behaviour of networks whose two sets of nodes either generate or destroy links.
An explicit analytical solution reproduces the main features of random graph ensembles with many short cycles under strict degree constraints.
New mathematical tools quantify the topological structure of large directed networks which describe how genes interact within a cell.
Explicit formulae for the Shannon entropies of random graph ensembles provide measures to compare and reproduce their topological features.
Unbiased randomisation processes generate sophisticated synthetic networks for modelling and testing the properties of real-world networks.
Exact equations for the thermodynamic quantities of lattices made of d-dimensional hypercubes are obtainable with the Bethe-Peierls approach.
The analysis of real networks which contain many short loops requires novel methods, because they break the assumptions of tree-like models.