Related papers: A Flow in the Forest
Tree-size distribution is one of the most investigated subjects in plant population biology. The forestry literature reports that tree-size distribution trajectories vary across different stands and/or species, while the metabolic scaling…
Unlike the fundamental forces of the Standard Model the quantum effects of gravity are still experimentally inaccessible. Rather surprisingly quantum aspects of gravity, such as massive gravitons, can emerge in experiments with fractional…
The 2d gauge theory on the lattice is equivalent to the twisted Eguchi-Kawai model, which we simulated at N ranging from 25 to 515. We observe a clear large N scaling for the 1- and 2-point function of Wilson loops, as well as the 2-point…
The cosmological phenomenology of gravity is typically studied in two limits: relativistic perturbation theory (on large scales) and Newtonian gravity (required for smaller, non-linear, scales). Traditional approaches to model-independent…
Exactly solvable models are essential in physics. For many-body spin-1/2 systems, an important class of such models consists of those that can be mapped to free fermions hopping on a graph. We provide a complete characterization of models…
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given any such problem that can be approximated quickly on trees,…
Applying Feynman diagrammatics to non-fermionic strongly correlated models with local constraints might seem generically impossible for two separate reasons: (i) the necessity to have a Gaussian (non-interacting) limit on top of which the…
In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…
We study an exactly solvable quantum field theory (QFT) model describing interacting fermions in 2+1 dimensions. This model is motivated by physical arguments suggesting that it provides an effective description of spinless fermions on a…
We propose a new method for simulating lattice gauge theories in the presence of fermions. The method combines flow-based generative models for local gauge field updates and hierarchical updates of the factorized fermion determinant. The…
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…
We study the minimal spanning arborescence which is the directed analogue of the minimal spanning tree, with a particular focus on its infinite volume limit and its geometric properties. We prove that in a certain large class of transient…
We investigate perfect matchings and essential spanning forests in planar hyperbolic graphs via circle packings. We prove the existence of nonconstant harmonic Dirichlet functions that vanish in a closed set of the boundary, generalizing a…
We investigate numerically and analytically Potts models on ``thin'' random graphs -- generic Feynman diagrams, using the idea that such models may be expressed as the N --> 1 limit of a matrix model. The thin random graphs in this limit…
Study of random networks generally requires the nodes to be independently and uniformly distributed such as a Poisson point process. In this work, we venture beyond this standard paradigm and investigate a stochastic forest obtained from a…
Potential flow has many applications, including the modelling of unsteady flows in aerodynamics. For these models to work efficiently, it is best to avoid Biot-Savart interactions. This work presents a grid-based treatment of potential…
We consider a spin-s Heisenberg model coupled to two-dimensional quantum gravity. We quantize the model using the Feynman path integral, summing over all possible two-dimensional geometries and spin configurations. We regularize this path…
We consider questions related to the existence of spanning trees in graphs with the property that after the removal of any path in the tree the graph remains connected. We show that, for planar graphs, the existence of trees with this…
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…
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…