相关论文: Critical Behaviour of Spanning Forests on Random P…
The generating function for spanning forests on a lattice is related to the q-state Potts model in a certain q -> 0 limit, and extends the analogous notion for spanning trees, or dense self-avoiding branched polymers. Recent works have…
We study random two-dimensional spanning forests in the plane that can be viewed both in the discrete case and in their appropriately taken scaling limits as a uniformly chosen spanning tree with some Poissonian deletion of edges or points.…
This paper is the second in a pair treating a new lattice model for nematic media. In addition to the familiar isotropic (I) and nematically ordered (N) phases, the phase diagram established in the previous paper (Paper I) contains a new,…
Random spanning trees are among the most prominent determinantal point processes. We give four examples of random spanning trees on ladder-like graphs whose rungs form stationary renewal processes or regenerative processes of order two,…
The one-dimensional forest-fire model including lightnings is studied numerically and analytically. For the tree correlation function, a new correlation length with critical exponent \nu ~ 5/6 is found by simulations. A Hamiltonian…
We study the q-state Potts model with nearest-neighbor coupling v=e^{\beta J}-1 in the limit q,v \to 0 with the ratio w = v/q held fixed. Combinatorially, this limit gives rise to the generating polynomial of spanning forests; physically,…
This study investigates how visibility graphs constructed from Monte Carlo Markov Chain time series of spin models capture the critical behavior of the system. More precisely, we show that this approach identifies continuous phase…
Visibility graphs are spatial interpretations of time series. When derived from the time evolution of physical systems, the graphs associated with such series may exhibit properties that can reflect aspects such as ergodicity, criticality,…
We have numerically studied the trapping problem in a two-dimensional lattice where particles are continuously generated. We have introduced interaction between particles and directionality of their movement. This model presents a critical…
We develop a phenomenological theory of critical phenomena in networks with an arbitrary distribution of connections $P(k)$. The theory shows that the critical behavior depends in a crucial way on the form of $P(k)$ and differs strongly…
The random-cluster model has been widely studied as a unifying framework for random graphs, spin systems and electrical networks, but its dynamics have so far largely resisted analysis. In this paper we analyze the Glauber dynamics of the…
We consider a forest-fire model which, somewhat informally, is described as follows: Each site (vertex) of the square lattice is either vacant or occupied by a tree.Vacant sites become occupied at rate 1. Further, each site is hit by…
The critical behavior of frustrated spin systems with nonplanar orderings is analyzed by a six-loop study in fixed dimension of an effective O$(N) \times $O$(M)$ Landau-Ginzburg-Wilson Hamiltonian. For this purpose the large-order behavior…
Depending on the rule for tree growth, the forest-fire model shows either self-organized criticality with rule-dependent exponents, or synchronization, or an intermediate behavior. This is shown analytically for the one-dimensional system,…
Using the matrix-forest theorem and the Parisi-Sourlas trick we formulate and solve a one-matrix model with non-polynomial potential which provides perturbation theory for massive spinless fermions on dynamical planar graphs. This is a…
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…
The probability distribution P(k) of the sizes k of critical trees (branching ratio m=1) is well known to show a power-law behavior k^(-3/2). Such behavior corresponds to the mean-field approximation for many critical and self-organized…
We study the Glauber dynamics for the random cluster (FK) model on the torus $(\mathbb{Z}/n\mathbb{Z})^2$ with parameters $(p,q)$, for $q \in (1,4]$ and $p$ the critical point $p_c$. The dynamics is believed to undergo a critical slowdown,…
We analyze critical phenomena on networks generated as the union of hidden variables models (networks with any desired degree sequence) with arbitrary graphs. The resulting networks are general small-worlds similar to those a` la Watts and…
This paper is a variation on the uniform spanning tree theme. We use random spanning forests to solve the following problem: for a Markov process on a finite set of size $n$, find a probability law on the subsets of any given size $m \leq…