Related papers: A Flow in the Forest
I derive a loop representation for the canonical and grand-canonical partition functions for an interacting four-component Fermi gas in one spatial dimension and an arbitrary external potential. The representation is free of the "sign…
In this paper we describe a randomized algorithm which returns a maximal spanning forest of an unknown {\em weighted} undirected graph making $O(n)$ $\mathsf{CUT}$ queries in expectation. For weighted graphs, this is optimal due to a result…
We analyze the one-loop effects of massive fields on 2-to-2 scattering processes involving gravitons. It has been suggested that in the presence of gravity, any local effective field theory description must break down at the "species…
We define and study a model of winding for non-colliding particles in finite trees. We prove that the asymptotic behavior of this statistic satisfies a central limiting theorem, analogous to similar results on winding of bounded particles…
Kemeny constant, defined as the expected hitting time of random walks from a source node to a randomly chosen target node, is a fundamental metric in graph data management with many real-world applications. However, computing it exactly on…
Zimmermann's forest formula is the corner stone of perturbative renormalization in QFT. By renormalizing individual Feynman graphs, it generates the UV finite S-matrix. This approach to renormalization makes the graph and all its forests…
In N=1 supersymmetric SO(N)/USp(2N) gauge theories with the tree-level superpotential W(\Phi) that is an arbitrary polynomial of the adjoint matter \Phi, the massless fluctuations about each quantum vacuum are described by U(1)^n gauge…
Pure 3d gravity in AdS is believed to admit a holographic description in terms of 2d CFT. We introduce a theory of fermionic 3d gravity where we sum over geometries equipped with spin structure, and propose it is holographically described…
String theory is the most promising candidate for the theory unifying all interactions including gravity. It has an extremely difficult dynamics. Therefore, it is useful to study some its simplifications. One of them is non-critical string…
In recent years, non-parametric methods utilizing random walks on graphs have been used to solve a wide range of machine learning problems, but in their simplest form they do not scale well due to the quadratic complexity. In this paper, a…
We study a model of random $\mathcal{R}$-enriched trees that is based on weights on the $\mathcal{R}$-structures and allows for a unified treatment of a large family of random discrete structures. We establish distributional limits…
The gradient flow is a valuable tool for the lattice community, with applications from scale-setting to implementing chiral fermions. Here I focus on the gradient flow as a means to suppress power-divergent mixing. Power-divergent mixing…
Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning…
We calculate exponential growth constants $\phi$ and $\sigma$ describing the asymptotic behavior of spanning forests and connected spanning subgraphs on strip graphs, with arbitrarily great length, of several two-dimensional lattices,…
We study fermionic one-matrix, two-matrix and $D$-dimensional gauge invariant matrix models. In all cases we derive loop equations which unambiguously determine the large-$N$ solution. For the one-matrix case the solution is obtained for an…
Recent results suggest that flow-based algorithms may provide efficient sampling of field distributions for lattice field theory applications, such as studies of quantum chromodynamics and the Schwinger model. In this work, we provide a…
The paramagnetic phase of heavy fermion systems is investigated, using a non-perturbative local moment approach to the asymmetric periodic Anderson model within the framework of dynamical mean field theory. The natural focus is on the…
We consider the inference of the structure of an undirected graphical model in an exact Bayesian framework. More specifically we aim at achieving the inference with close-form posteriors, avoiding any sampling step. This task would be…
A general field-theoretical description of many-fermion systems, with or without quenched disorder, is developed. Starting from the Grassmannian action for interacting fermions, we first bosonize the theory by introducing composite matrix…
We investigate flows on graphs whose links have random capacities. For binary trees we derive the probability distribution for the maximal flow from the root to a leaf, and show that for infinite trees it vanishes beyond a certain threshold…