We provide a direct proof of Cramér's theorem for geodesic random walks in a complete Riemannian manifold (M,g). We show how to exploit the vector space structure of the tangent spaces to study large deviation properties of geodesic random walks in M. Furthermore, we reveal the geometric obstructions one runs into …
The study of record statistics of correlated series is gaining momentum. In this work, we study the records statistics of the time series of select stock market data and the geometric random walk, primarily through simulations. We show that the distribution of the age of records is a power law with the exponent α lyi…
Survey on random walks on mapping class groups and their properties.
problem Understanding random walks on mapping class groups.
method Analyzing actions on Teichmüller spaces and curve complexes.
result Laws of large numbers and central limit theorems for random walks.
Study uniform convergence of random walk Laplacians to diffusion Laplacian on smooth manifolds.
problem Uniform convergence of random walk Laplacians to diffusion Laplacian on smooth manifolds.
method Analysis of random walks on geometric and directed kNN graphs, using concentration tools and differential geometry.
result Uniform convergence of kNN Laplacians to diffusion Laplacian, without continuity of transition kernel. Invariance principle proved for lifted geodesic walks on Riemannian submersions.
problem Proving convergence to horizontal Brownian motion for lifted geodesic walks.
method Appropriate conditions on geodesic random walks' speed; proving invariance principle.
result Convergence to horizontal Brownian motion for lifted geodesic walks.
Researchers prove hitting measure singularity for most Fuchsian and Kleinian groups.
problem Singularity of hitting measure for random walks on discrete subgroups.
method Algebraic and geometric convergence, hyperbolic Dehn filling.
result Proved singularity conjecture for certain measures on cocompact Fuchsian and Kleinian groups.
This paper studies node embeddings of networks, revealing their geometric properties.
problem Understanding the geometric properties of node embeddings in random networks.
method Characterization of ergodic limits, generalization, and convex relaxations of random walk node embedding objectives.
result The optimal node embedding Grammians have rank 1 for a nuclear norm relaxation of the non-randomized objective.
We relate some basic constructions of stochastic analysis to differential geometry, via random walk approximations. We consider walks on both Riemannian and sub-Riemannian manifolds in which the steps consist of travel along either geodesics or integral curves associated to orthonormal frames, and we give particular at…
Randomized control methods improve asset pricing and performance analysis.
problem Challenges in drawing inferences from traditional random portfolios in performance evaluation.
method Geometric random walks and Markov chain Monte Carlo methods to construct flexible control groups.
result Captured premia associated with size, value, quality, and momentum in a constrained setting.
Innovative extensions to option pricing models using asymmetric Brownian motion and random walk approaches.
problem Capturing empirical phenomena like return skewness, heavy tails, and volatility asymmetry in option pricing models.
method Developing the Geometric Asymmetric Brownian Motion (GABM) within the Bachelier--Black--Scholes--Merton framework.
result Deriving closed-form option pricing formulas and a discrete-time binomial tree algorithm that converges to the GABM limit.
A closed equilateral random walk in 3-space is a selection of unit length vectors giving the steps of the walk conditioned on the assumption that the sum of the vectors is zero. The sample space of such walks with n edges is the (2n−3)-dimensional Riemannian manifold of equilateral closed polygons in R3…
Graphs with bounded degrees and non-negative Ollivier-Ricci curvature have subexponential growth and diffusive random walk.
problem Understanding geometric properties of graphs with non-negative Ollivier-Ricci curvature.
method Analyzing the geometric properties of graphs with non-negative Ollivier-Ricci curvature, proving subexponential growth and diffusive random walk.
result For graphs with bounded degrees and non-negative Ollivier-Ricci curvature, the average log-volume growth and random walk displacement are subexponential.
Study large deviations in random walks on Lie groups.
problem Large deviations in sub-Riemannian random walks.
method Prove large deviation principle for random walks on stratified Lie groups.
result Proved a large deviation principle with a rate function adapted to sub-Riemannian geometry.
We review recent advances on the record statistics of strongly correlated time series, whose entries denote the positions of a random walk or a Lévy flight on a line. After a brief survey of the theory of records for independent and identically distributed random variables, we focus on random walks. During the last few…
This paper presents VEC-NBT, a variation on the unsupervised graph clustering technique VEC, which improves upon the performance of the original algorithm significantly for sparse graphs. VEC employs a novel application of the state-of-the-art word2vec model to embed a graph in Euclidean space via random walks on the n…
Several known results, by Rivin, Calegari-Maher and Sisto, show that an element φn∈Out(Fr), obtained after n steps of a simple random walk on Out(Fr), is fully irreducible with probability tending to 1 as n→∞. In this paper we construct a natural "train-track directed" random walk W on $…
Quantum walks blend patterns into splines when averaged.
problem Understanding the asymptotic patterns of quantum random walks.
method Averaging over quantum coins using the Haar measure.
result Patterns blend into splines, showing a unified behavior.
For finitely supported random walks on finitely generated groups G we prove that the identity map on G extends to a continuous equivariant surjection from the Martin boundary to the Floyd boundary, with preimages of conical points being singletons. This yields new results for relatively hyperbolic groups. Our key e…
Local limit theorem for random walks on hyperbolic groups with parabolic subgroups.
problem Analyzing the behavior of random walks on relatively hyperbolic groups.
method Study of convergent random walks with finite derivative of Green function at spectral radius.
result Proves a local limit theorem for the probability of returning to the origin.
Every pseudo-Anosov mapping class φ defines an associated veering triangulation τφ of a punctured mapping torus. We show that generically, τφ is not geometric. Here, the word "generic" can be taken either with respect to random walks in mapping class groups or with respect to counting geodesic…
Random walks on cell complexes link to Laplacians and Novikov-Shubin invariants.
problem Computing Novikov-Shubin invariants for complex cell structures.
method Construct random walks on cell complexes, relate to Laplacians, and use return probabilities.
result Novikov-Shubin invariants can be recovered from random walk return probabilities.
Study diffusions and random walks on hyperbolic spaces, focusing on their Martin boundaries.
problem Understanding diffusions and random walks on hyperbolic spaces.
method Analyzing specific diffusions and random walks on hyperbolic spaces, examining their Martin boundaries.
result Characterized the Martin boundaries of diffusions and random walks on hyperbolic spaces.
Random walks on metric spaces embed quasi-isometrically into the space.
problem Embedding random subgroups of metric spaces quasi-isometrically.
method Analyzing random walks and contracting elements in metric spaces.
result Random subgroups of isometry groups are quasi-isometrically embedded.
This work estimates edge weights of edge-reinforced random walks using observed data.
problem Statistical estimation of edge weights in edge-reinforced random walks.
method Proposes an estimator based on the generalized method of moments using the magic formula and hyperbolic Gaussian structure.
result Analyzes the sample complexity of the proposed estimator.
New proof shows rapid mixing for random walks on nilmanifolds.
problem Proving rapid mixing for random walks on nilmanifolds.
method Proved rapid mixing for almost all random walks generated by m translations on nilmanifolds under mild assumptions.
result For several classical classes of nilmanifolds, m=2 suffices for rapid mixing.
Random walks on hyperbolic spaces show linear growth in translation lengths.
problem Investigate the growth of translation lengths in random walks on hyperbolic spaces.
method Prove linear growth without moment conditions and apply to Teichmüller spaces.
result Linear growth of translation lengths in random walks on hyperbolic spaces.
Study random walks on groups with superlinear divergent geodesics.
problem Existence of superlinear divergent geodesics in groups.
method Developed theory of superlinear divergence and applied Gouëzel's pivoting technique.
result Established a central limit theorem for random walks on groups with superlinear divergent geodesics.
Study random walks on sub-Riemannian manifolds using retractions.
problem Modeling random walks on sub-Riemannian manifolds.
method Use retractions to approximate normal geodesics and study convergence to Brownian motion.
result Convergence of geodesic random walks defined with different connections.
Let S=Γ\H be a hyperbolic surface of finite topological type, such that the Fuchsian group Γ≤PSL2(R) is non-elementary, and consider any generating set S of Γ. When sampling by an n-step random walk in π1(S)≅Γ with each step given by an element…
The paper examines random walks on metric spaces and finds commensurable subgroups.
problem Determining commensurable subgroups via stationary measures in metric spaces.
method Analyzing random walks on isometry groups of metric spaces with non-singular stationary measures.
result Subgroups generated by random walks are commensurable under mild conditions.
Random walks on free groups reveal asymmetric expansion factors.
problem Understanding expansion factors in free groups.
method Random walks and BGIP on metric spaces.
result Generic outer automorphisms have different forward and backward expansion factors.
Deviation inequalities and limit laws for random walks on metric spaces.
problem Understanding random walks on metric spaces with contracting isometries.
method Adapting Gouëzel's pivotal time construction to establish deviation inequalities.
result Exponential bounds and limit laws for random walks on mapping class groups and CAT(0) spaces.
Random walks on Fuchsian Schottky groups have harmonic measures with lower dimension.
problem Understanding the dimensionality of harmonic measures for random walks.
method Analyzing finite range random walks on Fuchsian Schottky groups.
result Harmonic measures have dimension strictly less than the limit set's Hausdorff dimension.
UniNet efficiently learns network representations from large graphs.
problem Efficiently learning network representations from large graphs.
method Metropolis-Hastings sampling for efficient edge sampling and random walk model abstraction.
result UniNet outperforms existing NRL models on billion-edge networks.
The Cannon-Thurston map's measures become singular with respect to sphere measures.
problem Characterizing the behavior of measures under the Cannon-Thurston map.
method Analyzing the geometric properties of hyperbolic geodesics and quasi-geodesics.
result Natural measures on the circle become singular with respect to measures on the sphere.
The study of random walks on hyperbolic spaces and Teichmüller spaces, proving central limit theorems and geodesic tracking.
problem Analyzing random walks on hyperbolic and Teichmüller spaces.
method Proving central limit theorems and geodesic tracking using finite moments and logarithmic moments.
result Translation lengths of random isometries satisfy a central limit theorem if and only if the random walk has finite second moment.
Uniform drift estimates found for random walks on graph products.
problem Finding uniform lower bounds on drift for random walks on graph products.
method Extending Gouëzel's argument and introducing the combinatorial notion of piling.
result Uniform lower bounds on the drift for a family of random walks on graph products.
A random Heegaard splitting is a 3-manifold obtained by using a random walk of length n on the mapping class group as the gluing map between two handlebodies. We show that the joint distribution of random walks of length n and their inverses is asymptotically independent, and converges to the product of the harmonic an…
Unified view on random walk and Weisfeiler-Leman kernels, improving accuracy.
problem Improving graph kernel methods for better classification accuracy.
method Define and analyze walk-based node refinement methods, relate to Weisfeiler-Leman test, and introduce new walk-based kernels.
result Walk-based kernels are as expressive as Weisfeiler-Leman subtree kernel but support non-strict neighborhood comparison.
Geodesic walks converge to Brownian motion on Finsler manifolds.
problem Understanding random walks on Finsler manifolds.
method Analyzing convergence of geodesic random walks to diffusion processes.
result The Brownian motion on a Riemannian metric is a key result.
The hitting measure is singular and has dimension less than 1 for cocompact Fuchsian groups.
problem Analyzing the hitting measure and Hausdorff dimension for cocompact Fuchsian groups.
method Geometric and probabilistic analysis of random walks on cocompact Fuchsian groups.
result The hitting measure is singular with respect to Lebesgue measure and has a Hausdorff dimension strictly less than 1.
Hypergraphs are used in machine learning to model higher-order relationships in data. While spectral methods for graphs are well-established, spectral theory for hypergraphs remains an active area of research. In this paper, we use random walks to develop a spectral theory for hypergraphs with edge-dependent vertex wei…
We extend some properties of random walks on hyperbolic groups to random walks on convergence groups. In particular we prove that if a convergence group G acts on a compact metrizable space M with the convergence property then we can provide G∪M with a compact topology such that random walks on G converge a…
For any pseudo-Anosov diffeomorphism on a closed orientable surface S of genus greater than one, it is known by the work of Bers and Thurston that the topological entropy agrees with the translation distance on the Teichmüller space with respect to the Teichmüller metric. In this paper, we consider random walks on th…
Repelling random walks improve graph-based sampling efficiency.
problem Efficient graph-based sampling and statistical estimation.
method Induces correlations between trajectories of an ensemble of walkers on a graph, maintaining unbiasedness.
result Improves concentration of statistical estimators on graphs.
Higher-order proximity preserved network embedding has attracted increasing attention. In particular, due to the superior scalability, random-walk-based network embedding has also been well developed, which could efficiently explore higher-order neighborhoods via multi-hop random walks. However, despite the success of …
Abstract: Nonlinear random walk with distributionally robust transition probabilities.
problem Modeling nonlinear random walks with robust transition probabilities.
method Scaling limit and nonlinear semigroup approach.
result Explicit computation of the generator and corresponding PDE.
Study large deviations and speed of random walks in hyperbolic spaces.
problem Understanding the speed of random walks in hyperbolic spaces.
method Large deviations analysis for random walks with a non-elementary semi-group.
result Established large deviations results for random walk distances.