Related papers: Jaggedness of Path Integral Trajectories
The normalization in the path integral approach to quantum field theory, in contrast with statistical field theory, can contain physical information. The main claim of this paper is that the inner product on the space of field…
How do we estimate the probability of an abundant objects' formation, with minimal context or assumption about is origin? To explore this we have previously introduced the concept of pathway assembly (as pathway complexity), in a graph…
Euclidean quantum measure in Regge calculus with independent area tensors is considered using example of the Regge manifold of a simple structure. We go over to integrations along certain contours in the hyperplane of complex connection…
In this paper, we study a class of quasi-invariant measures on paths generated by discrete dynamical systems. Our main result characterizes the subfamily of these measures which admit a certain desintegration. This is a desintegration with…
We consider a real-valued path; it is possible to associate a tree to this path, and we explore the relations between the tree, the properties of $p$-variation of the path, and integration with respect to the path. In particular, the…
The celebrated invariance property states that particles entering a bounded domain, with isotropic and uniform incidence, spend on average $\langle \ell \rangle=4V/S$ length inside, no matter how they scatter. We show that this remarkable…
The calculus of variation and the construction of path integrals is revisited within the framework of non-linear generalized functions. This allows us to make a rigorous analysis of the variation of an action that takes into account the…
We describe some of the important physical characteristics of the `pathways', i.e. dynamical processes, by which molecular, nanoscale and micron-scale self-assembly occurs. We highlight the fact that there exist features of self-assembly…
Path generation, the process of converting high-level mission specifications, such as sequences of waypoints from a path planner, into smooth, executable paths, is a fundamental challenge in mobile robotics. Most path following and…
We consider a path-planning scenario for a mobile robot traveling in a configuration space with obstacles under the presence of stochastic disturbances. A novel path length metric is proposed on the uncertain configuration space and then…
The key in agglomerative clustering is to define the affinity measure between two sets. A novel agglomerative clustering method is proposed by utilizing the path integral to define the affinity measure. Firstly, the path integral descriptor…
We show how to construct path integrals for quantum mechanical systems where the space of configurations is a general non-compact symmetric space. Associated with this path integral is a perturbation theory which respects the global…
We define a deterministic integral with respect to irregular paths as a limit of standard line integrals and completely describe a class of all paths for which this integral exists for functions with H\"older exponent in the range of (0,1].…
We present the implementation of an algorithm for graph isomorphism testing, based on ideas about number of walks (of sufficiently large length) between vertices. The algorithm is expanded for strongly regular graphs (SRG-s) by testing the…
We describe some metric properties of incomparability graphs. We consider the problem of the existence of infinite paths, either induced or isometric, in the incomparability graph of a poset. Among other things, we show that if the…
Recently a path integral formalism has been proposed by the author which gives the time evolution of moments of slow variables in a Hamiltonian statistical system. This closure relies on evaluating the informational discrepancy of a time…
We study countably piecewise continuous, piecewise monotone interval maps. We establish a necessary and sufficient criterion for the existence of a nondecreasing semiconjugacy to a map of constant slope in terms of the existence of an…
Finding paths in graphs is a fundamental graph-theoretic task. In this work, we we are concerned with finding a path with some constraints on its length and the number of vertices neighboring the path, that is, being outside of and incident…
Without imposing restrictions on a weighted graph's arc lengths, symmetry structures cannot be expected. But, they exist. To find them, the graphs are decomposed into a component that dictates all closed path properties (e.g., shortest and…
I start by reviewing some basic properties of random graphs. I then consider the role of random walks in complex networks and show how they may be used to explain why so many long tailed distributions are found in real data sets. The key…