相关论文: A stochastic root finding approach: The Homotopy A…
Consider any locally checkable labeling problem $\Pi$ in rooted regular trees: there is a finite set of labels $\Sigma$, and for each label $x \in \Sigma$ we specify what are permitted label combinations of the children for an internal node…
The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…
Stochastic differential equations (SDEs) or diffusions are continuous-valued continuous-time stochastic processes widely used in the applied and mathematical sciences. Simulating paths from these processes is usually an intractable problem,…
Structural decomposition methods have been developed for identifying tractable classes of instances of fundamental problems in databases, such as conjunctive queries and query containment, of the constraint satisfaction problem in…
Many real discrete optimization problems (DOPs) are $NP$-hard and contain a huge number of variables and/or constraints that make the models intractable for currently available solvers. Large DOPs can be solved due to their special tructure…
In this paper, we construct stochastic symplectic Runge--Kutta (SSRK) methods of high strong order for Hamiltonian systems with additive noise. By means of colored rooted tree theory, we combine conditions of mean-square order 1.5 and…
In this article we present a way of treating stochastic partial differential equations with multiplicative noise by rewriting them as stochastically perturbed evolutionary equations in the sense of \cite{picardbook}, where a general…
The optimistic gradient method is useful in addressing minimax optimization problems. Motivated by the observation that the conventional stochastic version suffers from the need for a large batch size on the order of…
In this work, we translate at the level of decorated trees some of the crucial arguments which have been used in arXiv:2112.10739 for proposing a diagram-free approach for the convergence of the model in Regularity Structures. This allows…
We give a novel combinatorial interpretation to the perturbative series solutions for a class of Dyson-Schwinger equations. We show how binary tubings of rooted trees with labels from an alphabet on the tubes, and where the labels satisfy…
Finding spanning trees under various constraints is a classic problem with applications in many fields. Recently, a novel notion of "dense" ("sparse") tree, and in particular spanning tree (DST and SST respectively), is introduced as the…
In recent years dynamical systems (of deterministic and stochastic nature), describing many models in mathematics, physics, engineering and finances, become more and more complex. Numerical analysis narrowed only to deterministic algorithms…
This paper investigates the problems large-scale distributed composite convex optimization, with motivations from a broad range of applications, including multi-agent systems, federated learning, smart grids, wireless sensor networks,…
Numerical homotopy continuation methods for three classes of polynomial systems are presented. For a generic instance of the class, every path leads to a solution and the homotopy is optimal. The counting of the roots mirrors the resolution…
The graph isomorphism problem looks deceptively simple, but although polynomial-time algorithms exist for certain types of graphs such as planar graphs and graphs with bounded degree or eigenvalue multiplicity, its complexity class is still…
We present an algorithm for the derivation of Dyson-Schwinger equations of general theories that is suitable for an implementation within a symbolic programming language. Moreover, we introduce the Mathematica package DoDSE which provides…
Random tensor models for a generic complex tensor generalize matrix models in arbitrary dimensions and yield a theory of random geometries. They support a 1/N expansion dominated by graphs of spherical topology. Their Schwinger Dyson…
In the present paper, a stochastic Taylor expansion of some functional applied to the solution process of an It\^o or Stratonovich stochastic differential equation with a multi-dimensional driving Wiener process is given. Therefore, the…
Most phylogenetic analyses result in a sample of trees, but summarizing and visualizing these samples can be challenging. Consensus trees often provide limited information about a sample, and so methods such as consensus networks,…
We study two computational problems, parameterised by a fixed tree H. #HomsTo(H) is the problem of counting homomorphisms from an input graph G to H. #WHomsTo(H) is the problem of counting weighted homomorphisms to H, given an input graph G…