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

Trend · papers per month

74148221295 · Jun 202019922001200920172026
48 results for drifted random walk

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 ↗

This paper refines bounds on random walk speed in Teichmüller space.

problem Understanding the speed of random walks on Teichmüller space.
method Analyzing Jenkins-Strebel directions and Lebesgue geodesics.
result The drift of random walks grows exponentially for typical geodesics and oscillates between linear and exponential for some geodesics.

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 ↗

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.

Graphs approximate semigroups for diffusion on Riemannian manifolds.

problem Approximating semigroups for diffusion on Riemannian manifolds.
method Discretized approximation using random walks on proximity graphs.
result Quantitative error estimates for convergence of discrete semigroups to continuous semigroups.

The Continuous-Time Random Walk (CTRW) formalism can be adapted to encompass stochastic processes with memory. In this article we will show how the random combination of two different unbiased CTRWs can give raise to a process with clear drift, if one of them is a CTRW with memory. If one identifies the other one as no…

2011-07-12abs ↗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.

Let (Bt)0tT(B_t)_{0\leq t\leq T} be either a Bernoulli random walk or a Brownian motion with drift, and let Mt:=max{Bs:0st}M_t:=\max\{B_s: 0\leq s\leq t\}, 0tT0\leq t\leq T. This paper solves the general optimal prediction problem \sup_{0\leqτ\leq T}\sE[f(M_T-B_τ)], where the supremum is over all stopping times ττ adapted to the natural…

2009-10-03abs ↗pdf ↗

We prove a generalization of the fundamental inequality of Guivarc'h relating entropy, drift and critical exponent to Gibbs measures on geometrically finite quotients of CAT(-1) metric spaces. For random walks with finite superexponential moment, we show that the equality is achieved if and only if the Gibbs density is…

2019-04-02abs ↗pdf ↗

Many problems in finance are related to first passage times. Among all of them, we chose three on which we contributed personally. Our first example relates Kolmogorov-Smirnov like goodness-of-fit tests, modified in such a way that tail events and core events contribute equally to the test (in the standard Kolmogorov-S…

2013-06-13abs ↗pdf ↗

We study the statistics of records of a one-dimensional random walk of n steps, starting from the origin, and in presence of a constant bias c. At each time-step the walker makes a random jump of length ηdrawn from a continuous distribution f(η) which is symmetric around a constant drift c. We focus in particular on th…

2012-06-29abs ↗pdf ↗

Online learners track optimal solutions with constant step-size.

problem Tracking optimal solutions in online learning settings.
method Established a link between steady-state performance and tracking performance using analogies with adaptive filters.
result Inferred tracking performance from steady-state expressions directly.
Virtual volatilityphysics.soc-ph

We introduce the concept of virtual volatility. This simple but new measure shows how to quantify the uncertainty in the forecast of the drift component of a random walk. The virtual volatility also is a useful tool in understanding the stochastic process for a given portfolio. In particular, and as an example, we were…

2006-07-11abs ↗pdf ↗

We consider a stochastic model of investment on an asset of a stock market for a prudent investor. She decides to buy permanent goods with a fraction $\a$ of the maximum amount of money owned in her life in order that her economic level never decreases. The optimal strategy is obtained by maximizing the exponential gro…

1998-04-28abs ↗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.

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 ↗