Record statistics of financial time series and geometric random walks

Continuous gated first-passage processes

Gated first-passage processes, where completion depends on both hitting a target and satisfying additional constraints, are prevalent across various fields. Despite their significance, analytical solutions to basic problems remain unknown, e.g. the detection time of a diffusing particle by a gated interval, disk, or sphere. In this paper, we elucidate the challenges posed by continuous gated first-passage processes and present a renewal framework to overcome them. This framework offers a unified approach for a wide range of problems, including those with single-point, half-line, and interval targets. The latter have so far evaded exact solutions. Our analysis reveals that solutions to gated problems can be obtained directly from the ungated dynamics. This, in turn, reveals universal properties and asymptotic behaviors, shedding light on cryptic intermediate-time regimes and refining the notion of high-crypticity for continuous-space gated processes. Moreover, we extend our formalism to higher dimensions, showcasing its versatility and applicability. Overall, this work provides valuable insights into the dynamics of continuous gated first-passage processes and offers analytical tools for studying them across diverse domains.

Universal Framework for Record Ages under Restart

We propose a universal framework to compute record age statistics of a stochastic time series that undergoes random restarts. The proposed framework makes minimal assumptions on the underlying process and is furthermore suited to treat generic restart protocols going beyond the Markovian setting. After benchmarking the framework for classical random walks on the 1D lattice, we derive a universal criterion underpinning the impact of restart on the age of the nth record for generic time series with nearest-neighbor transitions. Crucially, the criterion contains a penalty of order n that puts strong constraints on restart expediting the creation of records, as compared to the simple first-passage completion. The applicability of our approach is further demonstrated on an aggregation-shattering process where we compute the typical growth rates of aggregate sizes. This unified framework paves the way to explore record statistics of time series under restart in a wide range of complex systems.

Statistical properties of avalanches via the c-record process

We study the statistics of avalanches, as a response to an applied force, undergone by a particle hopping on a one-dimensional lattice where the pinning forces at each site are independent and identically distributed (i.i.d.), each drawn from a continuous f(x). The avalanches in this model correspond to the interrecord intervals in a modified record process of i.i.d. variables, defined by a single parameter c>0. This parameter characterizes the record formation via the recursive process R_{k}>R_{k-1}-c, where R_{k} denotes the value of the kth record. We show that for c>0, if f(x) decays slower than an exponential for large x, the record process is nonstationary as in the standard c=0 case. In contrast, if f(x) has a faster than exponential tail, the record process becomes stationary and the avalanche size distribution π(n) has a decay faster than 1/n^{2} for large n. The marginal case where f(x) decays exponentially for large x exhibits a phase transition from a nonstationary phase to a stationary phase as c increases through a critical value c_{crit}. Focusing on f(x)=e^{-x} (with x≥0), we show that c_{crit}=1 and for c<1, the record statistics is nonstationary. However, for c>1, the record statistics is stationary with avalanche size distribution π(n)∼n^{-1-λ(c)} for large n. Consequently, for c>1, the mean number of records up to N steps grows algebraically ∼N^{λ(c)} for large N. Remarkably, the exponent λ(c) depends continuously on c for c>1 and is given by the unique positive root of c=-ln(1-λ)/λ. We also unveil the presence of nontrivial correlations between avalanches in the stationary phase that resemble earthquake sequences.

Extreme event statistics in a drifting Markov chain

We analyze extreme event statistics of experimentally realized Markov chains with various drifts. Our Markov chains are individual trajectories of a single atom diffusing in a one-dimensional periodic potential. Based on more than 500 individual atomic traces we verify the applicability of the Sparre Andersen theorem to our system despite the presence of a drift. We present detailed analysis of four different rare-event statistics for our system: the distributions of extreme values, of record values, of extreme value occurrence in the chain, and of the number of records in the chain. We observe that, for our data, the shape of the extreme event distributions is dominated by the underlying exponential distance distribution extracted from the atomic traces. Furthermore, we find that even small drifts influence the statistics of extreme events and record values, which is supported by numerical simulations, and we identify cases in which the drift can be determined without information about the underlying random variable distributions. Our results facilitate the use of extreme event statistics as a signal for small drifts in correlated trajectories.