Related papers: The Second Phase Transition of the Contact Process…
The critical behavior of the contact process in disordered and periodic binary 2d-lattices is investigated numerically by means of Monte Carlo simulations as well as via an analytical approximation and standard mean field theory.…
Phase transitions generically occur in random matrix models as the parameters in the joint probability distribution of the random variables are varied. They affect all main features of the theory and the interpretation of statistical models…
We study a lattice model of interacting loops in three dimensions with a $1/r^2$ interaction. Using Monte Carlo, we find that the phase diagram contains a line of second-order phase transitions between a phase where the loops are gapped and…
Majority bootstrap percolation is a monotone cellular automata that can be thought of as a model of infection spreading in networks. Starting with an initially infected set, new vertices become infected once more than half of their…
We consider bond percolation on $n$ vertices on a circle where edges are permitted between vertices whose spacing is at most some number L=L(n). We show that the resulting random graph gets a giant component when $L\gg(\log n)^2$ (when 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 establish that the phase transition for infinite cycles in the random stirring model on an infinite regular tree of high degree is sharp. That is, we prove that there exists d_0 such that, for any d \geq d_0, the set of parameter values…
We compare phase transition and critical phenomena of bond percolation on Euclidean lattices, nonamenable graphs, and complex networks. On a Euclidean lattice, percolation shows a phase transition between the nonpercolating phase and…
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…
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…
We present an analysis of the classical contact process on scale-free networks. A mean-field study, both for finite and infinite network sizes, yields an absorbing-state phase transition at a finite critical value of the control parameter,…
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…
Fix a graph $G$ in which every edge is colored in some of $k\ge 2$ colors. Two vertices $u$ and $v$ are CA-connected if $u$ and $v$ may be connected using any subset of $k - 1$ colors. CA-connectivity is an equivalence relation dividing the…
We study a generalization of the classical contact process (SIS epidemic model) in a directed graph $G$. Our model is a continuous-time interacting particle system in which at every time, each vertex is either healthy or infected, and each…
We consider the contact process on a random graph with fixed degree distribution given by a power law. We follow the work of Chatterjee and Durrett, who showed that for arbitrarily small infection parameter $\lambda$, the survival time of…
Although it is well-known that some exponential family random graph model (ERGM) families exhibit phase transitions (in which small parameter changes lead to qualitative changes in graph structure), the behavior of other models is still…
We study once-excited random walks on general trees, modeled by placing a single "cookie" at each vertex. Each cookie acts as a metaphorical reward that is consumed upon the first visit to the vertex where the cookie is placed. On that…
Temporal graphs represent interactions between entities over the time. These interactions may be direct (a contact between two nodes at some time instant), or indirect, through sequences of contacts called temporal paths (journeys).…
On the phase diagram of a system undergoing a continuous phase transition of the second order, three lines, hyper-surfaces, convergent into the critical point feature prominently: the ordered and disordered phases in the thermodynamic…
Diluted mean-field models are graphical models in which the geometry of interactions is determined by a sparse random graph or hypergraph. Based on a nonrigorous but analytic approach called the "cavity method", physicists have predicted…