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,695 papers · 148 categories

Trend · papers per month

130261391521 · Jun 202019922001200920172026
48 results for convergent random walks

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 ↗

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.

The study analyzes convergence of random-walk embeddings in graph theory.

problem Understanding the convergence behavior of random-walk based vertex embeddings.
method Theoretical analysis of convergence in single and double limits of NN and LL.
result Proved convergence of vertex embeddings under weak assumptions and derived concentration bounds.

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.

Let G be a countable group which acts by isometries on a separable, but not necessarily proper, Gromov hyperbolic space X. We say the action of G is weakly hyperbolic if G contains two independent hyperbolic isometries. We show that a random walk on such G converges to the Gromov boundary almost surely. We apply the co…

2014-10-15abs ↗pdf ↗

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 ↗

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.

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.

This paper considers a classical question of approximation of Brownian motion by a random walk in the setting of a sub-Riemannian manifold MM. To construct such a random walk we first address several issues related to the degeneracy of such a manifold. In particular, we define a family of sub-Laplacian operators natur…

2014-03-02abs ↗pdf ↗

A random walk on a countable group GG acting on a metric space XX gives a characteristic called the drift which depends only on the transition probability measure μμ of the random walk. The drift is the `translation distance' of the random walk. In this paper, we prove that the drift varies continuously with the tra…

2018-12-17abs ↗pdf ↗

Data-driven methods link graphon limits to random walks and spectral clustering.

problem Clustering signals evolving over time with graphon limits.
method Transfer operators, Koopman and Perron-Frobenius, for estimating graphon from signal data.
result Spectral clustering can be extended to graphons, reconstructing transition densities and graphons.

This paper considers a sequence of discrete-time random walk markets with a safe and a single risky investment opportunity, and gives conditions for the existence of arbitrages or free lunches with vanishing risk, of the form of waiting to buy and selling the next period, with no shorting, and furthermore for weak conv…

2012-06-25abs ↗pdf ↗

Study on a pinning model with random walk increments, showing convergence to a critical disordered pinning measure.

problem Understanding the critical behavior of a disordered pinning model.
method Analyzing a disordered pinning model induced by a random walk with specific moment conditions, showing convergence to a limiting measure.
result Convergence of point-to-point partition functions to the critical disordered pinning measure in the critical window.

A random walk wnw_n on a separable, geodesic hyperbolic metric space XX converges to the boundary X\partial X with probability one when the step distribution supports two independent loxodromics. In particular, the random walk makes positive linear progress. Progress is known to be linear with exponential decay when …

2017-10-14abs ↗pdf ↗

The contact graph of a CAT(0) cubical complex has unbounded structure and a Gaussian CLT for random walks.

problem Understanding the structure and behavior of random walks on CAT(0) cubical complexes.
method Proved the contact graph is unbounded and homeomorphic to the boundary. Reformulated Caprace-Sageev's theorem. Proved a Central Limit Theorem for random walks.
result A Central Limit Theorem for random walks on CAT(0) cubical complexes, with a non-degenerate Gaussian distribution.

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.

TSAW improves MCMC integral estimation with faster convergence.

problem Estimating integrals using MCMC with standard random walks is slow.
method Introduces TSAW to penalize overuse in finite-state adaptive sampling.
result TSAW-based estimators converge faster, achieving O(logt/t)O(\sqrt{\log t}/t) error.

We describe random walk boundaries (in particular, the Poisson--Furstenberg, or PF-boundary) for a vast family of groups in terms of the hyperbolic boundary of a special free subgroup. We prove that almost all trajectories of the random walk (with respect to an arbitrary nondegenerate measure on the group) converge to …

2007-07-07abs ↗pdf ↗

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 ↗

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 ↗

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.

We study random walks on groups of isometries of non-proper delta-hyperbolic spaces under the assumption that at least one element in the group satisfies Bestvina-Fujiwara's WPD condition. We show that in this case typical elements are WPD, and the Poisson boundary coincides with the Gromov boundary. Moreover, we show …

2018-07-26abs ↗pdf ↗

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.

We study the problem of finding the maximum of a function defined on the nodes of a connected graph. The goal is to identify a node where the function obtains its maximum. We focus on local iterative algorithms, which traverse the nodes of the graph along a path, and the next iterate is chosen from the neighbors of the…

2018-02-13abs ↗pdf ↗

New tuning rules for Metropolis algorithms derived from Bayesian large-sample asymptotics.

problem Optimal scaling in random-walk Metropolis algorithms under realistic assumptions.
method Large-sample asymptotics to derive weak convergence results and tuning guidelines.
result Tuning guidelines consistent with previous ones when target density is product form, accounting for correlation structure.

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.

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.