English
Related papers

Related papers: Large deviations for geodesic random walks

200 papers

We prove a quantitative Russo-Seymour-Welsh (RSW) type result for random walks on two natural examples of random planar graphs: the supercritical percolation cluster in the square lattice and the Poisson Voronoi triangulation in the plane.…

Probability · Mathematics 2021-06-22 Gourab Ray , Tingzhou Yu

We establish large deviation principles and phase transition results for both quenched and annealed settings of nearest-neighbor random walks with constant drift in random nonnegative potentials on $\mathbb Z^d$. We complement the analysis…

Probability · Mathematics 2007-05-23 Markus Flury

Fifty years ago, Eells and Sampson have proved a famous theorem in which they argued that any harmonic mapping $f:(M,g) \rightarrow (\bar{M},\bar{g})$ is totally geodesic if $(M, g)$ is a compact manifold with the nonnegative Ricci tensor…

Differential Geometry · Mathematics 2016-06-15 Sergey Stepanov , Irina Tsyganok

Recently, it has been shown that Absolute Parallelism (AP) geometry admits paths that are naturally quantized. These paths have been used to describe the motion of spinning particles in a background gravitational field. In case of a weak…

General Relativity and Quantum Cosmology · Physics 2016-11-09 M. I. Wanas , M. E. Kahil

We establish the quenched local limit theorem for reversible random walk on $\Z^d$ (with $d\ge 2$) among stationary ergodic random conductances that permit jumps of arbitrary length. The proof is based on the weak parabolic Harnack…

Probability · Mathematics 2024-04-11 Xin Chen , Takashi Kumagai , Jian Wang

We deal with irregular curves contained in smooth, closed, and compact surfaces. For curves with finite total intrinsic curvature, a weak notion of parallel transport of tangent vector fields is well-defined in the Sobolev setting. Also,…

Differential Geometry · Mathematics 2021-05-17 Domenico Mucci , Alberto Saracco

We consider learning on graphs, guided by kernels that encode similarity between vertices. Our focus is on random walk kernels, the analogues of squared exponential kernels in Euclidean spaces. We show that on large, locally treelike,…

Machine Learning · Statistics 2013-10-01 Matthew Urry , Peter Sollich

We consider the branching random walk on the real line where the underlying motion is of a simple random walk and branching is at least binary and at most decaying exponentially in law. It is well known that the normalized empirical measure…

Probability · Mathematics 2012-07-11 Oren Louidor , Will Perkins

We establish annealed and quenched invariance principles for random walks in random conductances lifted to the p-variation rough path topology, allowing for degenerate environments and long-range jumps. Our proof is based on a unified…

Probability · Mathematics 2026-04-17 Johannes Bäumler , Noam Berger , Tal Orenshtein , Martin Slowik

A connection is made between the random turns model of vicious walkers and random permutations indexed by their increasing subsequences. Consequently the scaled distribution of the maximum displacements in a particular asymmeteric version…

Combinatorics · Mathematics 2007-05-23 P. J. Forrester

We give a complete expansion, at any accuracy order, for the iterated convolution of a complex valued integrable sequence in one space dimension. The remainders are estimated sharply with generalized Gaussian bounds. The result applies in…

Numerical Analysis · Mathematics 2024-11-14 Jean-François Coulombel , Grégory Faye

We prove large-time $L^2$ and distributional limit theorems for perimeter and diameter of the convex hull of $N$ trajectories of planar random walks whose increments have finite second moments. Earlier work considered $N \in \{1,2\}$ and…

Probability · Mathematics 2025-09-23 Wojciech Cygan , Tomislav Kralj , Nikola Sandrić , Stjepan Šebek , Andrew Wade , Mo Dick Wong

We consider the invariant measure of homogeneous random walks in the quarter-plane. In particular, we consider measures that can be expressed as an infinite sum of geometric terms. We present necessary conditions for the invariant measure…

Probability · Mathematics 2014-07-03 Yanting Chen , Richard J. Boucherie , Jasper Goseling

We consider the precise upper large deviations estimates for the maximal displacement of a branching random walk. In addition, we obtain a description of the extremal process of the branching random walk conditioned on this large deviations…

Probability · Mathematics 2025-02-04 Lianghui Luo

Differential geometry may be generalized to allow infinitesimals to any order. The purpose of the present contribution is to show that the theory so developed expands received geometrical ideas in an interesting way, rich in potential for…

Differential Geometry · Mathematics 2024-06-07 William Bies

We consider a linearly edge-reinforced random walk on a class of two-dimensional graphs with constant initial weights. The graphs are obtained from $\mathbb{Z}^2$ by replacing every edge by a sufficiently large, but fixed number of edges in…

Probability · Mathematics 2009-10-13 Franz Merkl , Silke W. W. Rolles

Exploiting the coherent medium approximation, random walk among sites distributed randomly in space is investigated when the jump rate depends on the distance between two adjacent sites. In one dimension, it is shown that when the jump rate…

Statistical Mechanics · Physics 2021-09-27 Takashi Odagaki

In this paper we study the divisibility and primality properties of the Bernoulli random walk. We improve or extend some of our divisibility results to wide classes of iid or independent non iid random walks. We also obtain new primality…

Probability · Mathematics 2026-05-22 Michel J. G. Weber

We consider the general branching random walk under minimal assumptions, which in particular guarantee that the empirical particle distribution admits an almost sure central limit theorem. For such a process, we study the large time decay…

Probability · Mathematics 2017-12-07 Oren Louidor , Eliad Tsairi

We give a deterministic, nearly logarithmic-space algorithm that given an undirected graph $G$, a positive integer $r$, and a set $S$ of vertices, approximates the conductance of $S$ in the $r$-step random walk on $G$ to within a factor of…

Computational Complexity · Computer Science 2019-11-26 Jack Murtagh , Omer Reingold , Aaron Sidford , Salil Vadhan