Related papers: Tree based functional expansions for Feynman--Kac …
We investigate the statistics of trees grown from some initial tree by attaching links to preexisting vertices, with attachment probabilities depending only on the valence of these vertices. We consider the asymptotic mass distribution that…
Stochastic processes play a key role for modeling a huge variety of transport problems out of equilibrium, with manifold applications throughout the natural and social sciences. To formulate models of stochastic dynamics the conventional…
Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…
We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…
This paper derives a unifying theorem establishing consistency results for a broad class of tree-based algorithms. It improves current results in two aspects. First of all, it can be applied to algorithms that vary from traditional Random…
We prove complex contraction for zero-free regions of counting weighted set cover problem in which an element can appear in an unbounded number of sets, thus obtaining fully polynomial-time approximation schemes(FPTAS) via Barvinok's…
Tree-level Feynman diagrams in a cubic scalar theory can be given a metric such that each edge has a length. The space of metric trees is made out of orthants joined where a tree degenerates. Here we restrict to planar trees since each…
An algorithm for obtaining the Taylor coefficients of an expansion of Feynman diagrams is proposed. It is based on recurrence relations which can be applied to the propagator as well as to the vertex diagrams. As an application, several…
Sequential and quantum Monte Carlo methods, as well as genetic type search algorithms can be interpreted as a mean field and interacting particle approximations of Feynman-Kac models in distribution spaces. The performance of these…
This paper derives the Feynman rules for the diagrammatic perturbation expansion of the effective action around an arbitrary solvable problem. The perturbation expansion around a Gaussian theory is well known and composed of one-line…
Take a continuous-time Galton-Watson tree. If the system survives until a large time $T$, then choose $k$ particles uniformly from those alive. What does the ancestral tree drawn out by these $k$ particles look like? Some special cases are…
We study 1-Wasserstein propagation of chaos for "McKean-type" nonlinear Markov chains and their associated interacting particle systems. This paper is organized into two parts: the first part combines arguments from various areas of…
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…
The problem of asymptotic expansions of Green functions in perturbative QFT is studied for the class of Euclidean asymptotic regimes. Phenomenological applications are analyzed to obtain a meaningful mathematical formulation of the problem.…
Branching random flights are key to describing the evolution of many physical and biological systems, ranging from neutron multiplication to gene mutations. When their paths evolve in bounded regions, we establish a relation between the…
We consider exact enumerations and probabilistic properties of ranked trees when generated under the random coalescent process. Using a new approach, based on generating functions, we derive several statistics such as the exact probability…
We discuss the enumeration of Feynman diagrams at tree order for processes with external lines of different types. We show how this can be done by iterating algebraic Schwinger-Dyson equations. Asymptotic estimates for very many external…
The varying-coefficient model is a strong tool for the modelling of interactions in generalized regression. It is easy to apply if both the variables that are modified as well as the effect modifiers are known. However, in general one has a…
We study the Fleming-Viot particle process formed by N interacting continuous-time asymmetric random walks on the cycle graph, with uniform killing. We show that this model has a remarkable exact solvability, despite the fact that it is…
By considering the parity of the degrees and levels of nodes in increasing trees, a new combinatorial interpretation for the coefficients of the Taylor expansions of the Jacobi elliptic functions is found. As one application of this new…