Related papers: Determinant Calculations Using Random Walk Worldli…
Representations based on random walks can exploit discrete data distributions for clustering and classification. We extend such representations from discrete to continuous distributions. Transition probabilities are now calculated using a…
We use the Yang-Mills gradient flow on the space of connections over a closed Riemann surface to construct a Morse-Bott chain complex. The chain groups are generated by Yang-Mills connections. The boundary operator is defined by counting…
Euclidean invariant Klein-Gordon, Dirac and massive Chern-Simons field theories are constructed in terms of a random walk with a spin factor on a three dimensional lattice. We exactly calculate the free energy and the correlation functions…
The rigorous construction of quantum Yang-Mills theories, especially in dimension four, is one of the central open problems of mathematical physics. Construction of Euclidean Yang-Mills theories is the first step towards this goal. This…
By employing the perturbiner method we study the tree- and one-loop-level amplitudes in (anti)self-dual Yang-Mills, focusing on color-kinematics duality and double copy features; they arise naturally even in the fully off-shell case. In…
Random transvections generate a walk on the space of symplectic forms on $\mathbf{F}_q^{2n}$. The main result is establishing cutoff for this Markov chain. After $n+c$ steps, the walk is close to uniform while before $n-c$, it is far from…
Using coordinate-free basic operators on toy Fock spaces \cite{AP}, quantum random walks are defined following the ideas in \cite{LP,AP}. Strong convergence of quantum random walks associated with bounded structure maps is proved under…
We construct super Yang-Mills theories with extended supersymmetry on hypercubic lattices of various dimensions keeping one or two supercharges exactly. Gauge fields are represented by ordinary unitary link variables, and the exact…
We show connection between Dyck paths with peaks of bounded height and random walks. The correspondence between a certain class of random walks and such Dyck paths allows us to develop a probabilistic perspective on Chebyshev polynomials.
Wilson lines are key objects in many QCD calculations. They are parallel transporters of the gauge field that can be used to render non-local operator products gauge invariant, which is especially useful for calculations concerning…
We introduce a continuous-time quantum walk on an ultrametric space corresponding to the set of p-adic integers and compute its time-averaged probability distribution. It is shown that localization occurs for any location of the ultrametric…
We study a large class of long-range random walks which take values on the vertices of an N dimensional hypercube. These processes are connected with multivariate Bernoulli autoregression.
We evaluate the configuration exponents of various ensembles of Hamiltonian paths drawn on random planar bicubic maps. These exponents are estimated from the extrapolations of exact enumeration results for finite sizes and compared with…
The spectrum of N=1 supersymmetric Yang-Mills theory, calculated on the lattice, is presented. The masses have been determined on three different lattice spacings and extrapolated towards vanishing gluino mass. We present the extrapolation…
Non-perturbative investigations of $\mathcal N = 4$ supersymmetric Yang--Mills theory formulated on a space-time lattice have advanced rapidly in recent years. Large-scale numerical calculations are currently being carried out based on a…
We use a one-dimensional random walk on $D$-dimensional hyper-spheres to determine the critical behavior of statistical systems in hyper-spherical geometries. First, we demonstrate the properties of such walk by studying the phase diagram…
We study the properties of discrete-time random walks on networks formed by randomly interconnected cliques, namely, random networks of cliques. Our purpose is to derive the parameters that define the network structure -- specifically, the…
Random walk is one of the most classical and well-studied model in probability theory. For two correlated random walks on lattice, every step of the random walks has only two states, moving in the same direction or moving in the opposite…
The scalable calculation of matrix determinants has been a bottleneck to the widespread application of many machine learning methods such as determinantal point processes, Gaussian processes, generalised Markov random fields, graph models…
We evaluate determinants of "spiral" matrices, which are matrices in which entries are spiralling from the centre of the matrices towards the outside, with prescribed increments from one entry to the next depending on whether one moves…