Related papers: Generalizing Weighted Path Orders
Wilson lines, being comparators that render non-local operator products gauge invariant, are extensively used in QCD calculations, especially in small-$x$ calculations, calculations concerning validation of factorisation schemes and in…
In the context of two illustrative examples from supersymmetric quantum mechanics we show that the semi-classical analysis of the path integral requires complexification of the configuration space and action, and the inclusion of complex…
Under ray-optical light transport, the classical ray serves as a linear and local "point query" of light's behaviour. Linearity and locality are crucial to the formulation of sophisticated path tracing and sampling techniques, that enable…
In \cite{PSMA}, Pal et al. introduced some weighted means and gave some related inequalities by using an approach for operator monotone functions. This paper discusses the construction of these weighted means in a simple and nice setting…
The new method for obtaining a variety of extensions of Hermite polynomials is given. As a first example a family of orthogonal polynomial systems which includes the generalized Hermite polynomials is considered. Apparently, either these…
In recent years, A. Grigor'yan, Y. Lin, Y. Muranov and S.T. Yau [6, 7, 8, 9] constructed a path homology theory for digraphs. Later, S. Chowdhury and F. Memoli [3] studied the persistent path homology for directed networks. In this paper,…
The theory of dependency graphs is a powerful toolbox to prove asymptotic normality of sums of random variables. In this article, we introduce a more general notion of weighted dependency graphs and give normality criteria in this context.…
We explore the limit of stochastic differential equations driven by some random processes satisfying singularly perturbed second order stochastic differential equations. The main tool we employ is the universal limit theorem in rough path…
A network's assortativity is the tendency of vertices to bond with others based on similarities, usually excess vertex degree. In this paper we consider assortativity in weighted networks, both directed and undirected. To this end, we…
Rough paths theory allows for a pathwise theory of solutions to differential equations driven by highly irregular signals. The fundamental observation of rough paths theory is that if one can define "iterated integrals" above a signal, then…
Finding diverse solutions in combinatorial problems recently has received considerable attention (Baste et al. 2020; Fomin et al. 2020; Hanaka et al. 2021). In this paper we study the following type of problems: given an integer $k$, the…
Using the notion of generalized weight we improve estimates on the parameters of quantum codes obtained by Steane's construction from binary codes. This yields several new families of quantum codes.
We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…
In this paper, we consider ordered set partitions obtained by imposing conditions on the size of the lists, and such that the first $r$ elements are in distinct blocks, respectively. We introduce a generalization of the Lah numbers. For…
This work generalizes the additively partitioned Runge-Kutta methods by allowing for different stage values as arguments of different components of the right hand side. An order conditions theory is developed for the new family of…
We show that every $0$-$1$ multiplicity matrix for a simple graph $G$ is generically realisable for $G$. In particular, every multiplicity matrix for a path is generically realisable. We use this result to provide several families of joins…
Directed paths have been used by several authors to describe concurrent executions of a program. Spaces of directed paths in an appropriate state space contain executions with all possible legal schedulings. It is interesting to investigate…
Compact representations of objects is a common concept in computer science. Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit representation of a graph and the problem is to find a path (a…
The unrivaled robustness of topologically ordered states of matter against perturbations has immediate applications in quantum computing and quantum metrology, yet their very existence poses a challenge to our understanding of phase…
Most real-world networks are weighted graphs with the weight of the edges reflecting the relative importance of the connections. In this work, we study non degree dependent correlations between edge weights, generalizing thus the…