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

Trend · papers per month

233467700933 · Jun 202019922001200920172026
48 results for Continuous Time Random Walk

Continuous time random walks impose a random waiting time before each particle jump. Scaling limits of heavy tailed continuous time random walks are governed by fractional evolution equations. Space-fractional derivatives describe heavy tailed jumps, and the time-fractional version codes heavy tailed waiting times. Thi…

2008-09-09abs ↗pdf ↗

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 ↗

We apply the formalism of the continuous time random walk to the study of financial data. The entire distribution of prices can be obtained once two auxiliary densities are known. These are the probability densities for the pausing time between successive jumps and the corresponding probability density for the magnitud…

2002-10-23abs ↗pdf ↗

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 ↗

Continuous time random walks (CTRWs) are used in physics to model anomalous diffusion, by incorporating a random waiting time between particle jumps. In finance, the particle jumps are log-returns and the waiting times measure delay between transactions. These two random variables (log-return and waiting time) are typi…

2006-08-29abs ↗pdf ↗

We adapt continuous time random walk (CTRW) formalism to describe asset price evolution and discuss some of the problems that can be treated using this approach. We basically focus on two aspects: (i) the derivation of the price distribution from high-frequency data, and (ii) the inverse problem, obtaining information …

2006-11-14abs ↗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 ↗

New CTRW model explains volatility clustering in stock markets.

problem Missing models for long-term memory in time intervals between observations.
method Introduced a new family of CTRWs with correlated waiting times.
result Successfully describes the decay of nonlinear autocorrelation function in stock market returns.

TG-GAN models dynamic graph evolution for continuous-time temporal graphs.

problem Challenges in modeling dynamic temporal graphs, especially in continuous time.
method Temporal Graph Generative Adversarial Network (TG-GAN) that models truncated edge sequences, time budgets, and node attributes.
result TG-GAN significantly outperforms existing methods in efficiency and effectiveness.

Representations based on random walks can exploit discrete data distributions for clustering and classification. We extend such representations from discrete to continuous distributions. Transition probabilities are now calculated using a diffusion equation with a diffusion coefficient that inversely depends on the dat…

2012-10-19abs ↗pdf ↗

We apply the theory of continuous time random walks to study some aspects of the extreme value problem applied to financial time series. We focus our attention on extreme times, specifically the mean exit time and the mean first-passage time. We set the general equations for these extremes and evaluate the mean exit ti…

2004-06-23abs ↗pdf ↗

We propose a new Directed Continuous-Time Random Walk (CTRW) model with memory. As CTRW trajectory consists of spatial jumps preceded by waiting times, in Directed CTRW, we consider the case with only positive spatial jumps. Moreover, we consider the memory in the model as each spatial jump depends on the previous one.…

2018-07-05abs ↗pdf ↗

In high-frequency financial data not only returns, but also waiting times between consecutive trades are random variables. Therefore, it is possible to apply continuous-time random walks (CTRWs) as phenomenological models of the high-frequency price dynamics. An empirical analysis performed on the 30 DJIA stocks shows …

2005-05-31abs ↗pdf ↗

In high-frequency financial data not only returns, but also waiting times between consecutive trades are random variables. Therefore, it is possible to apply continuous-time random walks (CTRWs) as phenomenological models of the high-frequency price dynamics. An empirical analysis performed on the 30 DJIA stocks shows …

2003-10-14abs ↗pdf ↗

We review statistical properties of models generated by the application of a (positive and negative order) fractional derivative operator to a standard random walk and show that the resulting stochastic walks display slowly-decaying autocorrelation functions. The relation between these correlated walks and the well-kno…

2008-06-19abs ↗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.

We apply the Continuous Time Random Walk (CTRW) framework, introduced in finance by Scalas et al., to the analysis of the probability distribution of time intervals between two consecutive trades in the case of BTP futures prices traded at LIFFE in 1997. Results corroborate the validity of the CTRW approach for the des…

2000-12-28abs ↗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.

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.

Linear time algorithm for random walk kernels on sparse graphs.

problem Efficient computation of general random walk kernels for large graphs.
method Sample dependent random walks to compute graph embeddings without direct graph product.
result Up to 27x faster and scalable to 128x larger graphs than previous methods.

Graph embedding methods represent nodes in a continuous vector space, preserving information from the graph (e.g. by sampling random walks). There are many hyper-parameters to these methods (such as random walk length) which have to be manually tuned for every graph. In this paper, we replace random walk hyper-paramete…

2017-10-26abs ↗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.

We analyze the data of the Italian and U.S. futures on the stock markets and we test the validity of the Continuous Time Random Walk assumption for the survival probability of the returns time series via a renewal aging experiment. We also study the survival probability of returns sign and apply a coarse graining proce…

2006-06-06abs ↗pdf ↗

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 investigate the statistics of records in a random sequence {xB(0)=0,xB(1),,xB(n)=xB(0)=0}\{x_B(0)=0,x_B(1),\cdots, x_B(n)=x_B(0)=0\} of nn time steps. The sequence xB(k)x_B(k)'s represents the position at step kk of a random walk `bridge' of nn steps that starts and ends at the origin. At each step, the increment of the position is a random ju…

2015-05-22abs ↗pdf ↗

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.

As a model of market price, we introduce a new type of random walk in a moving potential which is approximated by a quadratic function with its center given by the moving average of its own trace. The properties of resulting random walks are similar to those of ordinary random walks for large time scales; however, thei…

2005-09-02abs ↗pdf ↗

We study a phenomenological model for the continuous double auction, equivalent to two independent M/M/1M/M/1 queues. The continuous double auction defines a continuous-time random walk for trade prices. The conditions for ergodicity of the auction are derived and, as a consequence, three possible regimes in the behavior …

2013-05-13abs ↗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.

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 ↗

Continuous-time random walks are a well suited tool for the description of market behaviour at the smallest scale: the tick-to-tick evolution. We will apply this kind of market model to the valuation of perpetual American options: derivatives with no maturity that can be exercised at any time. Our approach leads to opt…

2007-08-03abs ↗pdf ↗