Imaginary replica analysis of loopy regular random graphs

F. Lopez, T. Coolen

Submitted to Journal of Physics A (2019)

#statisticalphysics#graphfoundations#replicamethod

Download the PDF

LQ placeholderWe present analytic results for loopy random graphs, bridging the gap between theoretical random graphs and real life loopy networks.

We present analytic results for loopy random graphs, bridging the gap between theoretical random graphs and real life loopy networks.

We present an analytical approach for describing random loopy regular graphs. By controlling the distribution of eigenvalues of the graph adjacency matrices we control the loopiness of the ensemble. We do this in an effort to bridge the gap between traditional tree like random graph models and real life loopy networks. We derive an expression for the leading two orders of the expected eigenvalue spectrum, through the use of infinitely many replica indices taking imaginary values. We apply the method to models in which the spectral constraint reduces to a soft constraint on the number of triangles, to models with controlled numbers of triangles and squares, and other more complicated ones. Interestingly for practitioners of network science, these models may exhibit a shattering transition where the graphs show an extensive number of disconnected cliques, critically changing its topology.

LQ placeholder

Imaginary replica analysis of loopy regular random graphs

F. Lopez, T. Coolen

Sub. to Journal of Physics A

LQ placeholder

Taming complexity

M. Reeves, S. Levin, T. Fink, A. Levina

Harvard Business Review

LQ placeholder

Degree-correlations in a bursting dynamic network model

F. Vanni, P. Barucca

Journal of Economic Interaction and Coordination

LQ placeholder

Scale of non-locality for a system of n particles

S. Talaganis, I. Teimouri

Sub. to Physical Review D

LQ placeholder

How much can we influence the rate of innovation?

T. Fink, M. Reeves

Science Advances

123 / 123 papers