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

4939861,4791,972 · Jun 202019922001200920172026
48 results for walks with jumps

The paper introduces walks with jumps for modeling neuron activity in hyperbolic space.

problem Encoding neuron activity sequences in hyperbolic space.
method Introducing walks with jumps in hyperbolic geometry to model neuron activity.
result Endpoints of walks with jumps do not fully encode the sequence of jump times.

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 ↗

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 ↗

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 ↗

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

The continuous-time random walk (CTRW) is a pure-jump stochastic process with several applications in physics, but also in insurance, finance and economics. A definition is given for a class of stochastic integrals driven by a CTRW, that includes the Ito and Stratonovich cases. An uncoupled CTRW with zero-mean jumps is…

2008-02-26abs ↗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 ↗

The paper calculates large genus limits for quadratic differential volumes and constants.

problem Large genus asymptotics for intersection numbers and principal strata volumes of quadratic differentials.
method Combining recursive relations (Virasoro constraints) and asymmetric simple random walk jump probabilities.
result Confirm predictions about Masur-Veech volumes and area Siegel-Veech constants.

Recent deep learning approaches for representation learning on graphs follow a neighborhood aggregation procedure. We analyze some important properties of these models, and propose a strategy to overcome those. In particular, the range of "neighboring" nodes that a node's representation draws from strongly depends on t…

2018-06-09abs ↗pdf ↗

We unify kernel density estimation\textit{kernel density estimation} and empirical Bayes\textit{empirical Bayes} and address a set of problems in unsupervised learning with a geometric interpretation of those methods, rooted in the concentration of measure\textit{concentration of measure} phenomenon. Kernel density is viewed symbolically as XYX\rightharpoonup Y where the rand…

2019-03-06abs ↗pdf ↗

Generative models learn smoother densities to sample from unknown distributions.

problem Sampling from unknown distributions in high-dimensional spaces.
method Formalizes sampling problem, introduces multimeasurement noise model, derives Bayes estimator, and uses underdamped Langevin MCMC.
result Formulation leads to efficient sampling methods and theoretical connections with denoising autoencoders.

Particle MCMC is a class of algorithms that can be used to analyse state-space models. They use MCMC moves to update the parameters of the models, and particle filters to propose values for the path of the state-space model. Currently the default is to use random walk Metropolis to update the parameter values. We show …

2014-02-04abs ↗pdf ↗

We study the statistics of the number of records R_{n,N} for N identical and independent symmetric discrete-time random walks of n steps in one dimension, all starting at the origin at step 0. At each time step, each walker jumps by a random length drawn independently from a symmetric and continuous distribution. We co…

2012-04-23abs ↗pdf ↗

Estimates change point in high-dimensional dynamic graphical models.

problem Detecting change points in high-dimensional graphical models.
method Developed an estimator with Op(ψ2)O_p(ψ^{-2}) rate of convergence, established asymptotic distribution under high-dimensional scaling.
result Asymptotic distribution characterized under vanishing and non-vanishing jump size regimes.

GANs can learn stylized facts of financial time series, but performance varies by architecture.

problem Capturing stylized facts of financial time series using GANs.
method Examination of GANs' ability to learn stylized facts of financial time series, focusing on univariate and multivariate data.
result GANs can capture stylized facts of financial time series, but performance varies by architecture.

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 ↗

This paper studies optimal market making for large-tick assets in the presence of latency. We consider a random walk model for the asset price, and formulate the market maker's optimization problem using Markov Decision Processes (MDP). We characterize the value of an order and show that it plays the role of one-period…

2018-06-15abs ↗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 ↗

We propose and analyze two new MCMC sampling algorithms, the Vaidya walk and the John walk, for generating samples from the uniform distribution over a polytope. Both random walks are sampling algorithms derived from interior point methods. The former is based on volumetric-logarithmic barrier introduced by Vaidya wher…

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

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.

News might trigger jump arrivals in financial time series. The "bad" and "good" news seems to have distinct impact. In the research, a double exponential jump distribution is applied to model downward and upward jumps. Bayesian double exponential jump-diffusion model is proposed. Theorems stated in the paper enable est…

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

Estimates change point in high dimensional time series models.

problem Change point estimation in high dimensional time series.
method Plug-in least squares estimator with sufficient conditions for adaptivity.
result Optimal rate of convergence Op(ξ2)O_p(ξ^{-2}) in integer scale.

We quantify how co-jumps impact correlations in currency markets. To disentangle the continuous part of quadratic covariation from co-jumps, and study the influence of co-jumps on correlations, we propose a new wavelet-based estimator. The proposed estimation framework is able to localize the co-jumps very precisely th…

2016-02-17abs ↗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.