Related papers: A Flow in the Forest
In 1966, Cummins introduced the "tree graph": the tree graph $\mathbf{T}(G)$ of a graph $G$ (possibly infinite) has all its spanning trees as vertices, and distinct such trees correspond to adjacent vertices if they differ in just one edge,…
The discrete Green's functions are the pseudoinverse (or the inverse) of the Laplacian (or its variations) of a graph. In this paper, we will give combinatorial interpretations of Green's functions in terms of enumerating trees and forests…
We show that a quantum spin system has an exact description by non-interacting fermions if its frustration graph is claw-free and contains a simplicial clique. The frustration graph of a spin model captures the pairwise anticommutation…
We study possible backgrounds of 2D string theory using its equivalence with a system of fermions in upside-down harmonic potential. Each background corresponds to a certain profile of the Fermi sea, which can be considered as a deformation…
We present a neural flow wavefunction, Gauge-Fermion FlowNet, and use it to simulate 2+1D lattice compact quantum electrodynamics with finite density dynamical fermions. The gauge field is represented by a neural network which parameterizes…
We propose a random matrix model as a representation for $D=1$ open strings. We show that the model is equivalent to $N$ fermions with spin in a central potential that also includes a long-range ferromagnetic interaction between the…
We review recent progress in 2D gravity coupled to $d<1$ conformal matter, based on a representation of discrete gravity in terms of random matrices. We discuss the saddle point approximation for these models, including a class of related…
D. Wilson~\cite{[Wi]} in the 1990's described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a…
We study random two-component spanning forests ($2$SFs) of finite graphs, giving formulas for the first and second moments of the sizes of the components, vertex-inclusion probabilities for one or two vertices, and the probability that an…
We suggest an approach to perturbative calculations of large-scale clustering in the Universe that includes from the start the stream crossing (multiple velocities for mass elements at a single position) that is lost in traditional…
We analyse generating functions for trees and for connected subgraphs on the complete graph, and identify a single scaling profile which applies for both generating functions in a critical window. Our motivation comes from the analysis of…
A density functional theory (DFT) of lattice fermion models is presented, which uses the single-particle density matrix gamma_{ij} as basic variable. A simple, explicit approximation to the interaction-energy functional W[gamma] of the…
We give an algorithm for finding the arboricity of a weighted, undirected graph, defined as the minimum number of spanning forests that cover all edges of the graph, in $\sqrt{n} m^{1+o(1)}$ time. This improves on the previous best bound of…
Based on the observation that a particle motion in one dimension maps to a two-dimensional motion of a charged particle in a uniform magnetic field, constrained in the lowest Landau level, we formulate a system of one-dimen- sional…
We introduce a graph partitioning problem motivated by computational topology and propose two algorithms that produce approximate solutions. Specifically, given a weighted, undirected graph $G$ and a positive integer $k$, we desire to find…
We study tree approximations to classical two-body partition functions on sparse and loopy graphs via the Brydges-Kennedy-Abdessalam-Rivasseau forest expansion. We show that for sparse graphs (with large cycles), the partition function…
In this article we investigate the Uniform Spanning Forest ($\mathsf{USF}$) in the nearest-neighbour integer lattice $\mathbf{Z}^{d+1} = \mathbf{Z}\times \mathbf{Z}^d$ with an assignment of conductances that makes the underlying (Network)…
In this paper we propose and study a new complexity model for approximation algorithms. The main motivation are practical problems over large data sets that need to be solved many times for different scenarios, e.g., many multicast trees…
The 1D flux power spectrum ($P_{\mathrm{1D}}$) of the Ly$\alpha$ forest provides an exceptionally high-resolution probe of structure formation down to small scales ($k\approx1-10~\text{$h~$Mpc$^{-1}$}$). These scales carry the imprints of…
We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…