May 10, 2017
We introduce and analyse ensembles of 2-regular random graphs with a tuneable distribution of short cycles. The phenomenology of these graphs depends critically on the scaling of the ensembles' control parameters relative to the number of nodes. A phase diagram is presented, showing a second order phase transition from a connected to a disconnected phase. We study both the canonical formulation, where the size is large but fixed, and the grand canonical formulation, where the size is sampled from a discrete distribution, and show their equivalence in the thermodynamical limit. We also compute analytically the spectral density, which consists of a discrete set of isolated eigenvalues, representing short cycles, and a continuous part, representing cycles of diverging size.
Similar papers 1
We present a general method for obtaining the spectra of large graphs with short cycles using ideas from statistical mechanics of disordered systems. This approach leads to an algorithm that determines the spectra of graphs up to a high accuracy. In particular, for (un)directed regular graphs with cycles of arbitrary length we derive exact and simple equations for the resolvent of the associated adjacency matrix. Solving these equations we obtain analytical formulas for the s...
January 9, 2023
We present analytical results for the distribution of the number of cycles in directed and undirected random 2-regular graphs (2-RRGs) consisting of $N$ nodes. In directed 2-RRGs each node has one inbound link and one outbound link, while in undirected 2-RRGs each node has two undirected links. Since all the nodes are of degree $k=2$, the resulting networks consist of cycles. These cycles exhibit a broad spectrum of lengths, where the average length of the shortest cycle in a...
October 27, 2001
The problem of defining a statistical ensemble of random graphs with an arbitrary connectivity distribution is discussed. Introducing such an ensemble is a step towards uderstanding the geometry of wide classes of graphs independently of any specific model. This research was triggered by the recent interest in the so-called scale-free networks.
December 18, 2003
We discuss various aspects of the statistical formulation of the theory of random graphs, with emphasis on results obtained in a series of our recent publications.
August 27, 2004
Structural properties of evolving random graphs are investigated. Treating linking as a dynamic aggregation process, rate equations for the distribution of node to node distances (paths) and of cycles are formulated and solved analytically. At the gelation point, the typical length of paths and cycles, l, scales with the component size k as l ~ k^{1/2}. Dynamic and finite-size scaling laws for the behavior at and near the gelation point are obtained. Finite-size scaling laws ...
The $2$-star model is the simplest exponential random graph model that displays complex behavior, such as degeneracy and phase transition. Despite its importance, this model has been solved only in the regime of dense connectivity. In this work we solve the model in the finite connectivity regime, far more prevalent in real world networks. We show that the model undergoes a condensation transition from a liquid to a condensate phase along the critical line corresponding, in t...
April 10, 2014
Networks observed in the real world often have many short loops. This violates the tree-like assumption that underpins the majority of random graph models and most of the methods used for their analysis. In this paper we sketch possible research routes to be explored in order to make progress on networks with many short loops, involving old and new random graph models and ideas for novel mathematical methods. We do not present conclusive solutions of problems, but aim to enco...
January 30, 2004
In this article we give an in depth overview of the recent advances in the field of equilibrium networks. After outlining this topic, we provide a novel way of defining equilibrium graph (network) ensembles. We illustrate this concept on the classical random graph model and then survey a large variety of recently studied network models. Next, we analyze the structural properties of the graphs in these ensembles in terms of both local and global characteristics, such as degree...
January 29, 2016
I report on the development of a novel statistical mechanical formalism for the analysis of random graphs with many short loops, and processes on such graphs. The graphs are defined via maximum entropy ensembles, in which both the degrees (via hard constraints) and the adjacency matrix spectrum (via a soft constraint) are prescribed. The sum over graphs can be done analytically, using a replica formalism with complex replica dimensions. All known results for tree-like graphs ...
September 10, 2020
For random systems subject to a constraint, the microcanonical ensemble requires the constraint to be met by every realisation ("hard constraint"), while the canonical ensemble requires the constraint to be met only on average ("soft constraint"). It is known that for random graphs subject to topological constraints breaking of ensemble equivalence may occur when the size of the graph tends to infinity, signalled by a non-vanishing specific relative entropy of the two ensembl...