A Chung–Lu random graph is an inhomogeneous Erdős–Rényi random graph in which vertices are assigned average degrees, and pairs of vertices are connected by an edge with a probability that is... Show moreA Chung–Lu random graph is an inhomogeneous Erdős–Rényi random graph in which vertices are assigned average degrees, and pairs of vertices are connected by an edge with a probability that is proportional to the product of their average degrees, independently for different edges. We derive a central limit theorem for the principal eigenvalue and the components of the principal eigenvector of the adjacency matrix of a Chung–Lu random graph. Our derivation requires certain assumptions on the average degrees that guarantee connectivity, sparsity and bounded inhomogeneity of the graph. Show less
Dionigi, P.; Garlaschelli, D.; Hollander, W.T.F. den; Mandjes, M. 2021
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... Show moreFor 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 ensembles. We investigate to what extent breaking of ensemble equivalence is manifested through the largest eigenvalue of the adjacency matrix of the graph. We consider two examples of constraints in the dense regime: (1) fix the degrees of the vertices (= the degree sequence); (2) fix the sum of the degrees of the vertices (= twice the number of edges). Example (1) imposes an extensive number of local constraints and is known to lead to breaking of ensemble equivalence. Example (2) imposes a single global constraint and is known to lead to ensemble equivalence. Our working hypothesis is that breaking of ensemble equivalence corresponds to a non-vanishing difference of the expected values of the largest eigenvalue under the two ensembles. We verify that, in the limit as the size of the graph tends to infinity, the difference between the expected values of the largest eigenvalue in the two ensembles does not vanish for (1) and vanishes for (2). A key tool in our analysis is a transfer method that uses relative entropy to determine whether probabilistic estimates can be carried over from the canonical ensemble to the microcanonical ensemble, and illustrates how breaking of ensemble equivalence may prevent this from being possible. Show less
Synchronization of neurons forming a network with a hierarchical structure is essential for the brain to be able to function optimally. In this paper we study synchronization of phase oscillators... Show moreSynchronization of neurons forming a network with a hierarchical structure is essential for the brain to be able to function optimally. In this paper we study synchronization of phase oscillators on the most basic example of such a network, namely, the hierarchical lattice. Each site of the lattice carries an oscillator that is subject to noise. Pairs of oscillators interact with each other at a strength that depends on their hierarchical distance, modulated by a sequence of interaction parameters. We look at block averages of the oscillators on successive hierarchical scales, which we think of as block communities. In the limit as the number of oscillators per community tends to infinity, referred to as the hierarchical mean-field limit, we find a separation of time scales, i.e., each block community behaves like a single oscillator evolving on its own time scale. We argue that the evolution of the block communities is given by a renormalized mean-field noisy Kuramoto equation, with a synchronization level that depends on the hierarchical scale of the block community. We find three universality classes for the synchronization levels on successive hierarchical scales, characterized in terms of the sequence of interaction parameters. What makes our model specifically challenging is the non-linearity of the interaction between the oscillators. The main results of our paper therefore come in three parts: (I) a conjecture about the nature of the renormalisation transformation connecting successive hierarchical scales; (II) a truncation approximation that leads to a simplified renormalization transformation; (III) a rigorous analysis of the simplified renormalization transformation. We provide compelling arguments in support of (I) and (II), but a full verification remains an open problem. Show less
Garlaschelli, D.; Hollander, W.T.F. den; Roccaverde, A. 2018