Related papers: Expected n-Step Product for Gaussian Tours
The Traveling Salesman Problem (TSP) in the $d$-dimensional Euclidean space is among the oldest and most famous NP-hard optimization problems. In breakthrough works, Arora [J. ACM 1998] and Mitchell [SICOMP 1999] gave the first polynomial…
Let $X=\{X(x): x\in\mathbb{S}^N\}$ be a real-valued, centered Gaussian random field indexed on the $N$-dimensional unit sphere $\mathbb{S}^N$. Approximations to the excursion probability ${\mathbb{P}}\{\sup_{x\in\mathbb{S}^N}X(x)\ge u\}$,…
The ``analyst's traveling salesman theorem'' of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. This result, proven for the plane by Jones (1990) and extended to…
In this paper we analyze some aspects of {\em exponential flights}, a stochastic process that governs the evolution of many random transport phenomena, such as neutron propagation, chemical/biological species migration, or electron motion.…
We study a self-attractive random walk such that each trajectory of length $N$ is penalised by a factor proportional to $\exp ( - |R_N|)$, where $R_N$ is the set of sites visited by the walk. We show that the range of such a walk is close…
An overview is presented of recent work on some statistical problems on multiparticle random walks. We consider a Euclidean, deterministic fractal or disordered lattice and N >> 1 independent random walkers initially (t=0) placed onto the…
For various reasons, it seems necessary to include complex saddle points in the "Euclidean" path integral of General Relativity. But some sort of restriction on the allowed complex saddle points is needed to avoid various unphysical…
A constrained diffusive random walk of n steps and a random flight in Rd, which can be expressed in the same terms, were investigated independently in recent papers. The n steps of the walk are identically and independently distributed…
We study the problem of reconstructing the latent geometry of a $d$-dimensional Riemannian manifold from a random geometric graph. While recent works have made significant progress in manifold recovery from random geometric graphs, and more…
A set in d dimensional Euclidean space with d larger than 2 having Hausdorff dimension at least d/2 must have distance set with Hausdorff dimension strictly greater than 1/2.
In this article we study existence of pathwise stochastic integrals with respect to a general class of $n$-dimensional Gaussian processes and a wide class of adapted integrands. More precisely, we study integrands which are functions that…
We consider a d-dimensional random walk in random scenery X(n), where the scenery consists of i.i.d. with exponential moments but a tail decay of the form exp(-c t^a) with a<d/2. We study the probability, when averaged over both randomness,…
I introduce a new geometrical approach to thermo--statistical mechanics. Here I highlight the main physical ideas, and how do they translate into geometrical language. I contrast the present approach with previous…
A crinkled subordinator is an $\ell^2$-valued random process which can be thought of as a version of the usual one-dimensional subordinator with each out of countably many jumps being in a direction orthogonal to the directions of all other…
We introduce a family of probabilistic {\it scale-invariant} Leibniz-like pyramids and $(d+1)$-dimensional hyperpyramids ($d=1,2,3,...$), characterized by a parameter $\nu>0$, whose value determines the degree of correlation between $N$…
The purpose of this paper is to provide an exact formula for the second moment of the empirical correlation of two independent Gaussian random walks as well as implicit formulas for higher moments. The proofs are based on a symbolically…
The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…
Dimensional regularization of Euclidean momentum space integrals is a highly successful technique in renormalization of quantum field theories. While it yields a straightforward algorithmic method, with which to evaluate diagrams beyond…
A dispersed Dyck path (DDP) of length n is a lattice path on $N\times N$ from (0,0) to (n,0) in which the following steps are allowed: "up" (x, y) $\to$ (x+1, y+1); "down" (x, y) $\to$ (x+1, y-1); and "right" (x,0) $\to$ (x+1,0). An ascent…
We consider a simple random walk on a discrete torus (Z/NZ)^d with dimension d at least 3 and large side length N. For a fixed constant u > 0, we study the percolative properties of the vacant set, consisting of the set of vertices not…