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

12.5%25.0%37.5%50.0% · Jan 199419922001200920172026
48 results for Lattice Random Walk

SGLRW improves robustness of stochastic gradient MCMC methods.

problem Sensitivity to minibatch size and gradient noise in stochastic-gradient MCMC methods.
method Proposes Stochastic Gradient Lattice Random Walk (SGLRW) with lattice-based discretization.
result SGLRW remains stable in regimes where SGLD fails, including heavy-tailed gradient noise.

A Riemannian symmetric space is a Riemannian manifold in which it is possible to reflect all geodesics through a point by an isometry of the space. On such spaces, we introduce the notion of a distributional lattice, generalizing the notion of lattice. Distributional lattices exist in any Riemannian symmetric space: th…

2017-07-02abs ↗pdf ↗

We prove a sharp estimate on the expected value of the integral of the index of a simple random walk on the square or triangular lattice. This gives new lower bounds on the averaged Dehn function, which measures the expected area needed to fill a random curve with a disc.

2008-07-14abs ↗pdf ↗

Let T(x,r) denote the first hitting time of the disc of radius r centered at x for Brownian motion on the two dimensional torus. We prove that sup_{x} T(x,r)/|log r|^2 --> 2/pi as r --> 0. The same applies to Brownian motion on any smooth, compact connected, two-dimensional, Riemannian manifold with unit area and no bo…

2001-07-26abs ↗pdf ↗

We construct a new type of quantum walks on simplicial complexes as a natural extension of the well-known Szegedy walk on graphs. One can numerically observe that our proposing quantum walks possess linear spreading and localization as in the case of the Grover walk on lattices. Moreover, our numerical simulation sugge…

2015-07-05abs ↗pdf ↗

In this paper we study the common distance between points and the behavior of a constant length step discrete random walk on finite area hyperbolic surfaces. We show that if the second smallest eigenvalue of the Laplacian is at least 1/4, then the distances on the surface are highly concentrated around the minimal poss…

2017-12-29abs ↗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 ↗

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.

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.

A formula for the Alexander polynomial of a 2-bridge knot or link given by Hartley and also by Minkus has a beautiful interpretation as a walk on the integers. We extend this to the 2-variable Alexander polynomial of a 2-bridge link, obtaining a formula that corresponds to a walk on the 2-dimensional integer lattice.

2019-07-08abs ↗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.

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.

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 ↗

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.

Analyzes biased random walks and corrupted intervals in adversarial settings.

problem Learning thresholds and intervals in adversarial conditions.
method Analyzes biased random walks and corrupted intervals under adversarial design.
result Analyzes the expected behavior of biased random walks and corrupted intervals.

Study ratio-limit boundaries for random walks on hyperbolic groups.

problem Computing ratio-limit boundaries for relatively hyperbolic groups.
method Adapting Woess's strategy to non-hyperbolic groups and analyzing degenerate cases.
result Closure of minimal points in RR-Martin boundary is the unique smallest invariant subspace in ratio-limit boundary.