Related papers: Generalized constructive tree weights
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…
The Loop-Tree Duality (LTD) is a novel perturbative method in QFT that establishes a relation between loop-level and tree-level amplitudes, which gives rise to the idea of treating them simultaneously in a common Monte Carlo. Initially…
We study the problem of determining the distribution of vertices of a particular given type in the set of all Feynman tree graphs in quantum field theories. We show that in almost all cases a Gaussian distribution arises asymptotically, and…
We introduce a framework for constructing fractal trees via analytic generator fields, replacing discrete affine transformations and symbolic rewriting rules by the integration of smooth vector fields in an internal state space. In this…
The Bethe approximation is a successful method for approximating partition functions of probabilistic models associated with a graph. Recently, Chertkov and Chernyak derived an interesting formula called Loop Series Expansion, which is an…
We derive two formulas for the weighted sums of rooted spanning forests of particular sequence of graphs by using the matrix tree theorem. We consider cycle graphs with edges so called the pendant edges. One of our formula can be described…
The mating of trees approach to Schramm-Loewner evolution (SLE) in the random geometry of Liouville quantum gravity (LQG) has been recently developed by Duplantier-Miller-Sheffield (2014). In this paper we consider the mating of trees…
We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give…
A {\em $3$-graph} is a connected cubic graph such that each vertex is is equipped with a cyclic order of the edges incident with it. A {\em weight system} is a function $f$ on the collection of $3$-graphs which is {\em antisymmetric}:…
Weight systems are functions on chord diagrams satisfying Vassiliev's $4$-term relations. They originate in the theory of finite type knot invariants. Recent developments in understanding weight systems arising from Lie algebras are based…
We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…
It was proposed in hep-th/0403047 that all tree amplitudes in pure Yang-Mills theory can be constructed from known MHV amplitudes. We apply this approach for calculating tree amplitudes of gauge fields and fermions and find agreement with…
We present a new formulation of the loop-tree duality theorem for higher loop diagrams valid both for massless and massive cases. $l$-loop integrals are expressed as weighted sum of trees obtained from cutting $l$ internal propagators of…
Variational inference in probabilistic graphical models aims to approximate fundamental quantities such as marginal distributions and the partition function. Popular approaches are the Bethe approximation, tree-reweighted, and other types…
We survey the theory and applications of mating-of-trees bijections for random planar maps and their continuum analog: the mating-of-trees theorem of Duplantier, Miller, and Sheffield (2014). The latter theorem gives an encoding of a…
We study double copy relations for loop integrands in gauge theories and gravity based on their constructions from single cuts, which are in turn obtained from forward limits of lower-loop cases. While such a construction from forward…
Quantum states of spin systems that can be represented with weighted graphs $G(V, E)$ are studied. The geometrical characteristics of these states are examined. We find that the velocity of quantum evolution is determined by the sum of the…
We propose a new graph metric and study its properties. In contrast to the standard distance in connected graphs, it takes into account all paths between vertices. Formally, it is defined as d(i,j)=q_{ii}+q_{jj}-q_{ij}-q_{ji}, where q_{ij}…
The Weighted Tree Augmentation Problem (WTAP) is a fundamental well-studied problem in the field of network design. Given an undirected tree $G=(V,E)$, an additional set of edges $L \subseteq V\times V$ disjoint from $E$ called…
A weight-dependent generalization of the binomial theorem for noncommuting variables is presented. This result extends the well-known binomial theorem for q-commuting variables by a generic weight function depending on two integers. For a…