Related papers: Randomized Wilson loops, reduced models and the la…
This article considers to model large-dimensional matrix time series by introducing a regression term to the matrix factor model. This is an extension of classic matrix factor model to incorporate the information of known factors or useful…
The development of randomized algorithms for numerical linear algebra, e.g. for computing approximate QR and SVD factorizations, has recently become an intense area of research. This paper studies one of the most frequently discussed…
We describe the behaviour of the Wilson loops for wrapped $D5$ systems. We start with the simplest such system possible and then add features to it bit by bit, and show how the Wilson loop is affected by them. This analysis led to the…
We consider biased random walks in positive random conductances on the d-dimensional lattice in the zero-speed regime and study their scaling limits. We obtain a functional Law of Large Numbers for the position of the walker, properly…
Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where…
In this article, we first give a comprehensive description of random walk (RW) problem focusing on self-similarity, dynamic scaling and its connection to diffusion phenomena. One of the main goals of our work is to check how robust the RW…
Given a sequence of lattice approximations $D_N\subset\mathbb Z^2$ of a bounded continuum domain $D\subset\mathbb R^2$ with the vertices outside $D_N$ fused together into one boundary vertex $\varrho$, we consider discrete-time simple…
We give a local central limit theorem for simple random walks on Z^d, including Gaussian error estimates. The detailed proof combines standard large deviation techniques with Cramer-Edgeworth expansions for lattice distributions.
For a random walk defined for a doubly infinite sequence of times, we let the time parameter itself be an integer-valued process, and call the orginal process a random walk at random time. We find the scaling limit which generalizes the…
In this paper, we give explicit rates in the central limit theorem and in the almost sure invariance principle for general R d-valued cocycles that appear in the study of the left random walk on linear groups. Our method of proof lies on a…
We consider circular non-BPS Maldacena-Wilson loops in five-dimensional supersymmetric Yang-Mills theory (d = 5 SYM) both as macroscopic strings in the D4-brane geometry and directly in gauge theory. We find that in the Dp-brane geometries…
In this paper the multi-dimensional random walk models governed by distributed fractional order differential equations and multi-term fractional order differential equations are constructed. The scaling limits of these random walks to a…
Gauge theories with and without matter are formulated in the derivative expansion. Amplitudues are derived as a power series in the energy scales; there are simplifications as compared with the usual loop expansion. The incorporation and…
Spherically symmetric random walks in arbitrary dimension $D$ can be described in terms of Gegenbauer (ultraspherical) polynomials. For example, Legendre polynomials can be used to represent the special case of two-dimensional spherically…
The large N reduction is an equivalence between large N gauge theories and matrix models discovered by Eguchi and Kawai in the early 80s. In particular the continuum version of the quenched Eguchi-Kawai model may be useful in studying…
Biggins [Uniform convergence of martingales in the branching random walk. {\em Ann. Probab.}, 20(1):137--151, 1992] proved local uniform convergence of additive martingales in $d$-dimensional supercritical branching random walks at complex…
We show that if the non Gaussian part of the cumulants of a random matrix model obey some scaling bounds in the size of the matrix, then Wigner's semicircle law holds. This result is derived using the replica technique and an analogue of…
Colored tensor models generalize matrix models in arbitrary dimensions yielding a statistical theory of random higher dimensional topological spaces. They admit a 1/N expansion dominated by graphs of spherical topology. The simplest tensor…
Using methods of numerical Lattice Gauge Theory we show that in the limit of a large number of colors, properly regularized Wilson loops have an eigenvalue distribution which changes non-analytically as the overall size of the loop is…
A symbolic-computational algorithm, fully implemented in Maple, is described, that computes explicit expressions for generating functions that enable the efficient computations of the expectation, variance, and higher moments, of the random…