Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

90180270360 · Jun 202019922001200920172026
48 results for geometric random walks

We provide a direct proof of Cramér's theorem for geodesic random walks in a complete Riemannian manifold (M,g)(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 MM. Furthermore, we reveal the geometric obstructions one runs into …

2018-11-23abs ↗pdf ↗

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…

2014-06-24abs ↗pdf ↗

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 kkNN 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.

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.

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 nn edges is the (2n3)(2n-3)-dimensional Riemannian manifold of equilateral closed polygons in R3\mathbb{R}^3

2013-10-22abs ↗pdf ↗

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.

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…

2017-08-26abs ↗pdf ↗

Several known results, by Rivin, Calegari-Maher and Sisto, show that an element φnOut(Fr)φ_n\in Out(F_r), obtained after nn steps of a simple random walk on Out(Fr)Out(F_r), is fully irreducible with probability tending to 1 as nn\to\infty. In this paper we construct a natural "train-track directed" random walk W\mathcal W on $…

2014-09-29abs ↗pdf ↗

For finitely supported random walks on finitely generated groups GG we prove that the identity map on GG 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…

2017-08-07abs ↗pdf ↗

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 φ\varphi defines an associated veering triangulation τφτ_\varphi of a punctured mapping torus. We show that generically, τφτ_\varphi 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…

2018-08-16abs ↗pdf ↗

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.

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.

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.

Let S=Γ\HS=Γ\backslash \mathbb{H} be a hyperbolic surface of finite topological type, such that the Fuchsian group ΓPSL2(R)Γ\le \operatorname{PSL}_2(\mathbb{R}) is non-elementary, and consider any generating set S\mathfrak S of ΓΓ. When sampling by an nn-step random walk in π1(S)Γπ_1(S) \cong Γ with each step given by an element…

2018-07-10abs ↗pdf ↗

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.

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 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.

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…

2008-09-29abs ↗pdf ↗

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.

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…

2019-05-20abs ↗pdf ↗

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 GG acts on a compact metrizable space MM with the convergence property then we can provide GMG\cup M with a compact topology such that random walks on GG converge a…

2018-10-22abs ↗pdf ↗

For any pseudo-Anosov diffeomorphism on a closed orientable surface SS 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…

2016-04-04abs ↗pdf ↗