Related papers: A Flow in the Forest
The computational complexity of time-dependent perturbation theory is well-known to be largely combinatorial whatever the chosen expansion method and family of parameters (combinatorial sequences, Goldstone and other Feynman-type…
We present faster algorithms for approximate maximum flow in undirected graphs with good separator structures, such as bounded genus, minor free, and geometric graphs. Given such a graph with $n$ vertices, $m$ edges along with a recursive…
We construct a well-defined lattice-regularized quantum theory formulated in terms of fundamental fermion and gauge fields, the same type of degrees of freedom as in the Standard Model. The theory is explicitly invariant under local Lorentz…
We present an analytical and numerical study of a nonlinear diffusion model which describes density relaxation of loosely packed particles under gravity and weak random (thermal) vibration, and compare the results with Monte Carlo…
The meander problem is a combinatorial problem which provides a toy model of the compact folding of polymer chains. In this paper we study various questions relating to the enumeration of meander diagrams, using diagrammatical methods. By…
A class of parabolic cross-diffusion systems modeling the interaction of an arbitrary number of population species is analyzed in a bounded domain with no-flux boundary conditions. The equations are formally derived from a random-walk…
The effective action includes all quantum corrections arising in a given quantum field theory. Thus it serves as a powerful generating functional from which quantum-corrected scattering amplitudes can be constructed via tree-level…
A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…
Another facet of the elegant link between random processes on graphs and Laplacian-based numerical linear algebra is uncovered: based on random spanning forests, novel Monte-Carlo estimators for graph signal smoothing are proposed. These…
This note relates topics in statistical mechanics, graph theory and combinatorics, lattice quantum field theory, super quantum mechanics and string theory. We give a precise relation between the dimer model on a graph embedded on a torus…
A connection between non-perturbative formulations of quantum gravity and perturbative string theory is exhibited, based on a formulation of the non-perturbative dynamics due to Markopoulou. In this formulation the dynamics of spin network…
Using the example of a two dimensional four-fermion lattice field theory we demonstrate that Feynman diagrams can generate a mass gap when massless fermions interact via a marginally relevant coupling. We introduce an infrared cutoff…
We prove that the wired uniform spanning forest exhibits mean-field behaviour on a very large class of graphs, including every transitive graph of at least quintic volume growth and every bounded degree nonamenable graph. Several of our…
The statistical mechanics of spin models, such as the Ising or Potts models, on generic random graphs can be formulated economically by considering the N --> 1 limit of Hermitian matrix models. In this paper we consider the N --> 1 limit in…
We use matrix model results to investigate the Sine-Gordon model coupled to two dimensional gravity. For relevant (in the RG sense) potentials, we show that the $c=1$ string, which appears in the ultraviolet limit of this model, flows to a…
We consider the monomer-dimer model on sequences of random graphs locally convergent to trees. We prove that the monomer density converges almost surely, in the thermodynamic limit, to an analytic function of the monomer activity. We…
Kirchhoff's matrix tree theorem is a well-known result that gives a formula for the number of spanning trees in a finite, connected graph in terms of the graph Laplacian matrix. A closely related result is Wilson's algorithm for putting the…
A polymer folding model on the square lattice is constructed with attractive contact interactions of strength 1/c^2, 0<c<1. The corresponding model on a dynamical random lattice, with freely fluctuating co-ordination number at each vertex,…
In a recent work, a dual formulation of group field theories as non-commutative quantum field theories has been proposed, providing an exact duality between spin foam models and non-commutative simplicial path integrals for constrained BF…
We express connected Fermionic Green's functions in terms of completely explicit tree formulas. In contrast with the ordinary formulation in terms of Feynman graphs these formulas allow a completely transparent proof of convergence of the…