Related papers: Phase transitions in exponential random graphs
We consider a large class of exponential random graph models and prove the existence of a region of parameter space corresponding to multipartite structure, separated by a phase transition from a region of disordered graphs.
We introduce two simple two-dimensional lattice models to study traffic flow in cities. We have found that a few basic elements give rise to the characteristic phase diagram of a first-order phase transition from a freely moving phase to a…
In this paper, we explore the two-star Exponential Random Graph Model, which is a two parameter exponential family on the space of simple labeled graphs. We introduce auxiliary variables to express the two-star model as a mixture of the…
We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…
We introduce two simple two-dimensional lattice models to study traffic flow in cities. We have found that a few basic elements give rise to the characteristic phase diagram of a first-order phase transition from a freely moving phase to a…
We determine the asymptotic size of the largest component in the $2$-type binomial random graph $G(\mathbf{n},P)$ near criticality using a refined branching process approach. In $G(\mathbf{n},P)$ every vertex has one of two types, the…
Within the framework of an exactly solvable model, which takes into account the interaction of fluctuating modes with equal and opposite momenta, we consider phase diagrams in systems with coupled scalar order parameters. We show that, in…
In this paper, we study exponential random graph models subject to certain constraints. We obtain some general results about the asymptotic structure of the model. We show that there exists non-trivial regions in the phase plane where the…
We study a mean field model of a complex network, focusing on edge and triangle densities. Our first result is the derivation of a variational characterization of the entropy density, compatible with the infinite node limit. We then…
Consider the complete graph on \(n\) vertices where each edge is independently open with probability \(p,\) or closed otherwise. Phase transitions for such graphs for \(p = \frac{C}{n}\) have previously been studied using techniques like…
We study a random matrix model for the statistical properties of the purity of a bipartite quantum system at a finite (fictitious) temperature. This enables us to write the generating function for the cumulants, for both balanced and…
We study circle maps with a flat interval where the critical exponents at the two boundary points of the flat spot might be different. The space of such systems is partitioned in two connected parts whose common boundary only depends on the…
We survey known results about phase transitions in various models of statistical physics when the underlying space is a nonamenable graph. Most attention is devoted to transitive graphs and trees.
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…
We find a series of topological phase transitions of increasing order, beyond the more standard second-order phase transition in a one-dimensional topological superconductor. The jumps in the order of the transitions depend on the range of…
For a finite graph $G=(V,E)$ let $G^*$ be obtained by considering a random perfect matching of $V$ and adding the corresponding edges to $G$ with weight $\varepsilon$, while assigning weight 1 to the original edges of $G$. We consider…
Conventionally used exponential random graphs cannot directly model weighted networks as the underlying probability space consists of simple graphs only. Since many substantively important networks are weighted, this limitation is…
The classical result of Erdos and Renyi shows that the random graph G(n,p) experiences sharp phase transition around p=1/n - for any \epsilon>0 and p=(1-\epsilon)/n, all connected components of G(n,p) are typically of size O(log n), while…
We study a random graph model which combines properties of the edge percolation model on Z^d and a classical random graph G(n,c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called "rank 1…