Related papers: From Cycle Rooted Spanning Forests to the Critical…
The finite size scaling behaviour for the Ising model in five dimensions, with either free or cyclic boundary, has been the subject for a long running debate. The older papers have been based on ideas from e.g. field theory or…
A lot of progress has been made recently in our understanding of the random-field Ising model thanks to large-scale numerical simulations. In particular, it has been shown that, contrary to previous statements: the critical exponents for…
We study the critical Ising model on the square lattice in bounded simply connected domains with + and free boundary conditions. We relate the energy density of the model to a fermionic observable and compute its scaling limit by discrete…
We generalize the uniform spanning tree to construct a family of determinantal measures on essential spanning forests on periodic planar graphs in which every component tree is bi-infinite. Like the uniform spanning tree, these measures…
We analyze kinetically constrained 0-1 spin models (KCSM) on rooted and unrooted trees of finite connectivity. We focus in particular on the class of Friedrickson-Andersen models FA-jf and on an oriented version of them. These tree models…
Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure on groves, we compute the probabilities of…
The random-field Ising model shows extreme critical slowdown that has been described by activated dynamic scaling: the characteristic time for the relaxation to equilibrium diverges exponentially with the correlation length, $\ln \tau\sim…
Critical models are, almost by definition, supposed to feature both slow decay of correlations for local observables while retaining some mixing even for macroscopic observables. A strong version of the latter property is that changing…
Constrained Forest Problems (CFPs) as introduced by Goemans and Williamson in 1995 capture a wide range of network design problems with edge subsets as solutions, such as Minimum Spanning Tree, Steiner Forest, and Point-to-Point Connection.…
Deep forest is a non-differentiable deep model which has achieved impressive empirical success across a wide variety of applications, especially on categorical/symbolic or mixed modeling tasks. Many of the application fields prefer…
A remarkable connection has been established for antiferromagnetic 2-spin systems, including the Ising and hard-core models, showing that the computational complexity of approximating the partition function for graphs with maximum degree D…
The relative importance of the intrinsic and extrinsic factors determining the variety of geometric shapes exhibited by dendritic trees remains unclear. This question was addressed by developing a model of the growth of dendritic trees…
We study the dimer and Ising models on a finite planar weighted graph with periodic-antiperiodic boundary conditions, i.e. a graph $\Gamma$ in the Klein bottle $K$. Let $\Gamma_{mn}$ denote the graph obtained by pasting $m$ rows and $n$…
The tricritical Ising CFT is the IR fixed-point of $\lambda\phi^6$ theory. It can be seen as a one-parameter family of CFTs connecting between an $\varepsilon$-expansion near the upper critical dimension 3 and the exactly solved minimal…
An important problem in statistical physics concerns the fascinating connections between partition functions of lattice models studied in equilibrium statistical mechanics on the one hand and graph theoretical enumeration problems on the…
We study various mathematical aspects of discrete models on graphs, specifically the Dimer and the Ising models. We focus on proving gluing formulas for individual summands of the partition function. We also obtain partial results regarding…
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…
In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…
Recent numerical studies of the susceptibility of the three-dimensional Ising model with various interaction ranges have been analyzed with a crossover model based on renormalization-group matching theory. It is shown that the model yields…
The two-dimensional (2D) random-bond Ising model has a novel multicritical point on the ferromagnetic to paramagnetic phase boundary. This random phase transition is one of the simplest examples of a 2D critical point occurring at both…