Related papers: Spin models on random graphs with controlled topol…
Recently, random graphs in which vertices are characterized by hidden variables controlling the establishment of edges between pairs of vertices have attracted much attention. Here, we present a specific realization of a class of random…
We derive representation theorems for exchangeable distributions on finite and infinite graphs using elementary arguments based on geometric and graph-theoretic concepts. Our results elucidate some of the key differences, and their…
A general approach for the description of spin systems on hierarchial lattices with coordination number $q$ as a dynamical variable is proposed. The ferromagnetic Ising model on the Bethe lattice was studied as a simple example…
We study the Ising spin glass model on scale-free networks generated by the static model using the replica method. Based on the replica-symmetric solution, we derive the phase diagram consisting of the paramagnetic (P), ferromagnetic (F),…
We investigate a kinetic Ising model with several single-spin flip dynamics (including Metropolis and heat-bath) on quenched and annealed random regular graphs. As expected, on the quenched structures all proposed algorithms reproduce the…
The Ising model on ``thin'' graphs (standard Feynman diagrams) displays several interesting properties. For ferromagnetic couplings there is a mean field phase transition at the corresponding Bethe lattice transition point. For…
We consider spin models on complex networks frequently used to model social and technological systems. We study the annealed ferromagnetic Ising model for random networks with either independent edges (Erd\H{o}s-R\'enyi), or with prescribed…
We consider ferromagnetic Ising models on graphs that converge locally to trees. Examples include random regular graphs with bounded degree and uniformly random graphs with bounded average degree. We prove that the "cavity" prediction for…
We consider a variant of so called power-law random graph. A sequence of expected degrees corresponds to a power-law degree distribution with finite mean and infinite variance. In previous works the asymptotic picture with number of nodes…
We revisit classical bounds of M. E. Fisher on the ferromagnetic Ising model, and show how to efficiently use them on an arbitrary given graph to rigorously upper-bound the partition function, magnetizations, and correlations. The results…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
The degrees are a classical and relevant way to study the topology of a network. They can be used to assess the goodness-of-fit for a given random graph model. In this paper we introduce goodness-of-fit tests for two classes of models.…
Motivated by the scaling limits of the connected components of the configuration model, we study uniform connected multigraphs with fixed degree sequence $\mathcal{D}$ and with surplus $k$. We call those random graphs…
We present a new method to solve the dynamics of disordered spin systems on finite time-scales. It involves a closed driven diffusion equation for the joint spin-field distribution, with time-dependent coefficients described by a dynamical…
We analyze the properties of degree-preserving Markov chains based on elementary edge switchings in undirected and directed graphs. We give exact yet simple formulas for the mobility of a graph (the number of possible moves) in terms of its…
We relate a large class of classical spin models, including the inhomogeneous Ising, Potts, and clock models of q-state spins on arbitrary graphs, to problems in quantum physics. More precisely, we show how to express partition functions as…
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…
We focus on an epidemiological model (the archetypical SIR system) defined on graphs and study the asymptotic behavior of the solutions as the number of vertices in the graph diverges. By relying on the theory of so called graphons we…
Finite-range interacting spin models are the simplest models to study the effect of beyond nearest-neighbour interactions and access new effects caused by the range of the interactions. Recent experiments have reached the regime of dominant…
We use a random pinning procedure to study amorphous order in two glassy spin models. On increasing the concentration of pinned spins at constant temperature, we find a sharp crossover (but no thermodynamic phase transition) from bulk…