Related papers: Spanning Forests on Random Planar Lattices
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative $(1+\delta)$ of uniform in expected…
We study the partition function of Potts model in an external (magnetic) field, and its connections with the zero-field Potts model partition function. Using a deletion-contraction formulation for the partition function Z for this model, we…
We propose a novel technique, termed compact shape trees, for computing correspondences of single-boundary 2-D shapes in O(n2) time. Together with zero or more features defined at each of n sample points on the shape's boundary, the compact…
The finite lattice method of series expansion is generalised to the $q$-state Potts model on the simple cubic lattice. It is found that the computational effort grows exponentially with the square of the number of series terms obtained,…
We express the partition functions of the spanning tree on finite square lattices under five different sets of boundary conditions (free, cylindrical, toroidal, M\"obius strip, and Klein bottle) in terms of a principal partition function…
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 consider a uniform spanning tree in a $\delta$-square grid approximation of a planar domain $\Omega$. For given integer $n\ge 2$, we condition the tree on the following $n$-arm event: we pick $n$ branches, emanating from $n$ points…
We study the random sequential adsorption of $k$-mers on the fully-connected lattice with $N=kn$ sites. The probability distribution $T_n(s,t)$ of the time $t$ needed to cover the lattice with $s$ $k$-mers is obtained using a generating…
We define a minimization problem for paths on planar graphs that, on the honeycomb lattice, is equivalent to the exploration path of the critical site percolation and than has the same scaling limit of SLE_6. We numerically study this model…
We design exact polynomial expansions of a class of Feynman--Kac particle distributions. These expansions are finite and are parametrized by coalescent trees and other related combinatorial quantities. The accuracy of the expansions at any…
We study the sudden expansion of strongly correlated fermions in a one-dimensional lattice, utilizing the time-dependent density-matrix renormalization group method. Our focus is on the behavior of experimental observables such as the…
We present a new algorithm for generating a uniformly random spanning tree in an undirected graph. Our algorithm samples such a tree in expected $\tilde{O}(m^{4/3})$ time. This improves over the best previously known bound of…
We consider the probability that a spanning tree chosen uniformly at random from a graph can be partitioned into a fixed number $k$ of trees of equal size by removing $k-1$ edges. In that case, the spanning tree is called {\em splittable}.…
A Slave-Boson perturbational approach to ground-state properties of the $U\to\infty$ periodic Anderson model is derived as an expansion around the Atomic Limit ($V=0$). In the case of zero temperature any constraint-integral or limiting…
We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…
We present exact calculations of the partition function $Z$ of the $q$-state Potts model and its generalization to real $q$, the random cluster model, for arbitrary temperature on $n$-vertex ladder graphs with free, cyclic, and M\"obius…
We study the Potts model on locally tree-like random graphs of arbitrary degree distribution. Using a population dynamics algorithm we numerically solve the problem exactly. We confirm our results with simulations. Comparisons with a…
We study the loop $O(n)$ model on the honeycomb lattice. By means of local non-planar deformations of the lattice, we construct a discrete stress-energy tensor. For $n\in [0,2]$, it gives a new observable satisfying a part of Cauchy-Riemann…
The statistical properties of random lattice knots, the topology of which is determined by the algebraic topological Jones-Kauffman invariants was studied by analytical and numerical methods. The Kauffman polynomial invariant of a random…
A family of models for fluctuating loops in a two dimensional random background is analyzed. The models are formulated as O(n) spin models with quenched inhomogeneous interactions. Using the replica method, the models are mapped to the…