Related papers: A stochastic root finding approach: The Homotopy A…
We provide a full and unbiased solution to the Dyson-Schwinger equation illustrated for $\phi^4$ theory in 2D. It is based on an exact treatment of the functional derivative $\partial \Gamma / \partial G$ of the 4-point vertex function…
The homotopy analysis method known from its successful applications to obtain quasi-analytical approximations of solutions of ordinary and partial differential equations is applied to stochastic differential equations with Gaussian…
A general class of stochastic Runge-Kutta methods for the weak approximation of It\^o and Stratonovich stochastic differential equations with a multi-dimensional Wiener process is introduced. Colored rooted trees are used to derive an…
The Dyson-Schwinger (DS) equations for a quantum field theory in $D$-dimensional space-time are an infinite sequence of coupled integro-differential equations that are satisfied exactly by the Green's functions of the field theory. This…
We associate root polytopes to directed graphs and study them by using ribbon structures. Most attention is paid to what we call the semi-balanced case, i.e., when each cycle has the same number of edges pointing in the two directions.…
Series solutions for a large family of single equation Dyson-Schwinger equations are given as expansions over decorated rooted connected chord diagrams. The analytic input to the new expansions are the expansions of the regularized…
The hierarchical and recursive expressive capability of rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. On the other hand, such hierarchical…
Motivated by the goal of improving the efficiency of small sample design, we propose a novel Bayesian stochastic approximation method to estimate the root of a regression function. The method features adaptive local modelling and…
Given a data set with many features observed in a large number of conditions, it is desirable to fuse and aggregate conditions which are similar to ease the interpretation and extract the main characteristics of the data. This paper…
We prove that finding a rooted subtree with at least $k$ leaves in a digraph is a fixed parameter tractable problem. A similar result holds for finding rooted spanning trees with many leaves in digraphs from a wide family $\cal L$ that…
We give series solutions to single insertion place propagator-type systems of Dyson--Schwinger equations using binary tubings of rooted trees. These solutions are combinatorially transparent in the sense that each tubing has a…
In this paper, an analytic approximation method for highly nonlinear equations, namely the homotopy analysis method (HAM), is employed to solve some backward stochastic differential equations (BSDEs) and forward-backward stochastic…
This paper intends to apply the sample-average-approximation (SAA) scheme to solve a system of stochastic equations (SSE), which has many applications in a variety of fields. The SAA is an effective paradigm to address risks and uncertainty…
The \emph{Steiner tree} problem is one of the fundamental and classical problems in combinatorial optimization. In this paper, we study this problem in the $\mathcal{CONGESTED}$ $\mathcal{CLIQUE}$ model of distributed computing and present…
Uncertainty quantification appears today as a crucial point in numerous branches of science and engineering. In the past two decades, a growing interest has been devoted to stochastic finite element method (SFEM) for the propagation of…
In this paper, we propose several graph-based extensions of the Douglas-Rachford splitting (DRS) method to solve monotone inclusion problems involving the sum of $N$ maximal monotone operators. Our construction is based on a two-layer…
The major obstacle preventing Feynman diagrammatic expansions from accurately solving many-fermion systems in strongly correlated regimes is the series slow convergence or divergence problem. Several techniques have been proposed to address…
In the \emph{budgeted rooted node-weighted Steiner tree} problem, we are given a graph $G$ with $n$ nodes, a predefined node $r$, two weights associated to each node modelling costs and prizes. The aim is to find a tree in $G$ rooted at $r$…
This paper examines the effectiveness of the Dyson-Schwinger (DS) equations as a calculational tool in quantum field theory. The DS equations are an infinite sequence of coupled equations that are satisfied exactly by the connected Green's…
Homotopy approaches to Bayesian inference have found widespread use especially if the Kullback-Leibler divergence between the prior and the posterior distribution is large. Here we extend one of these homotopy approach to include an…