Related papers: Jaggedness of Path Integral Trajectories
We investigate quantum gravity in the path integral formulation using the Regge calculus. Restricting the quadratic link lengths of the originally triangular lattice the path integral can be transformed to the partition function of a spin…
The walk distances in graphs are defined as the result of appropriate transformations of the $\sum_{k=0}^\infty(tA)^k$ proximity measures, where $A$ is the weighted adjacency matrix of a graph and $t$ is a sufficiently small positive…
We consider the definition of quantum walks on directed graphs. Call a directed graph reversible if, for each pair of vertices (i, j), if i is connected to j then there is a path from j to i. We show that reversibility is a necessary and…
In this work we deal with the so-called path convexities, defined over special collections of paths. For example, the collection of the shortest paths in a graph is associated with the well-known geodesic convexity, while the collection of…
We show that the ``effective Lagrangian'' constructed in [1] is inconsistent with the exact result for the complete Lagrangian presented in [2]. We trace the origin of the inconsistence to the peculiar way in which the path integral methods…
In this paper, we study the problem of map matching with travel time constraints. Given a sequence of $k$ spatio-temporal measurements and an embedded path graph with travel time costs, the goal is to snap each measurement to a close-by…
We provide a theory of manifold-valued rough paths of bounded 3 > p-variation, which we do not assume to be geometric. Rough paths are defined in charts, and coordinate-free (but connection-dependent) definitions of the rough integral of…
A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…
Pairs of numerically computed trajectories of a chaotic system may coalesce because of finite arithmetic precision. We analyse an example of this phenomenon, showing that it occurs surprisingly frequently. We argue that our model belongs to…
We propose a family of lagged random walk sampling methods in simple undirected graphs, where transition to the next state (i.e. node) depends on both the current and previous states -- hence, lagged. The existing random walk sampling…
The betweenness centrality of graphs using random walk paths instead of geodesics is studied. A scaling collapse with no adjustable parameters is obtained as the graph size $N$ is varied; the scaling curve depends on the graph model. A…
In this paper we propose a new parameter-free method for trajectory classification which finds the best trajectory partition and dimension combination for robust trajectory classification. Preliminary experiments show that our approach is…
We propose a fresh take on understanding the mechanisms of neural networks by analyzing the rich directional structure of optimization trajectories, represented by their pointwise parameters. Towards this end, we introduce some natural…
For any real-valued stochastic process $X$ with c\'rdl\'rg paths we define non-empty family of processes which have locally finite total variation, have jumps of the same order as the process $X$ and uniformly approximate its paths on…
We use purely combinatorial arguments to give a formula to compute all graded Betti numbers of path ideals of line graphs and cycles. As a consequence we can give new and short proofs for the known formulas of regularity and projective…
We study the computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph $G$ with two distinct terminal vertices and two positive integers $p$ and $k$, the question is…
An appealing property of the natural gradient is that it is invariant to arbitrary differentiable reparameterizations of the model. However, this invariance property requires infinitesimal steps and is lost in practical implementations with…
A new class of exclusion type processes acting in continuum with synchronous updating is introduced and studied. Ergodic averages of particle velocities are obtained and their connections to other statistical quantities, in particular to…
The symmetries of paths in a manifold $M$ are classified with respect to a given pointwise proper action of a Lie group $G$ on $M$. Here, paths are embeddings of a compact interval into $M$. There are at least two types of symmetries:…
Random walks serve as important tools for studying complex network structures, yet their dynamics in cases where transition probabilities are not static remain under explored and poorly understood. Here we study nonlinear random walks that…