English
Related papers

Related papers: Zero-Crossing Statistics for Non-Markovian Time Se…

200 papers

Continuous-time Markov chains are used to model stochastic systems where transitions can occur at irregular times, e.g., birth-death processes, chemical reaction networks, population dynamics, and gene regulatory networks. We develop a…

Machine Learning · Statistics 2022-12-13 Majerle Reeves , Harish S. Bhat

Many researchers have investigated first hitting times as models for survival data. First hitting times arise naturally in many types of stochastic processes, ranging from Wiener processes to Markov chains. In a survival context, the state…

Methodology · Statistics 2009-09-29 Mei-Ling Ting Lee , G. A. Whitmore

For i.i.d. random vectors $(M_{1},Q_{1}),(M_{2},Q_{2}),\ldots$ such that $M>0$ a.s., $Q\geq 0$ a.s. and $\mathbb{P}(Q=0)<1$, the random difference equation $X_{n}=M_{n}X_{n-1}+Q_{n}$, $n=1,2,\ldots$, is studied in the critical case when the…

Probability · Mathematics 2021-05-12 Gerold Alsmeyer , Alexander Iksanov

Mimicking and learning the long-term memory of efficient markets is a fundamental problem in the interaction between machine learning and financial economics to sequential data. Despite the prominence of this issue, current treatments…

Machine Learning · Statistics 2021-11-12 Shao-Qun Zhang , Zhi-Hua Zhou

We consider an empirical process based upon ratio of selected pair of the non-overlapping $m$-spacings generated by independent samples of arbitrary sizes. As a main result, we show that when both samples are uniformly distributed on…

Statistics Theory · Mathematics 2012-11-09 Moïse Jérémie

Let $X_{t}$ denote a stationary first-order autoregressive process. Consider $n$ contiguous observations (in time $t$) of the series (e.g., $X_{1}, ..., X_{n}$). Let its mean be zero and its lag-one serial correlation be $\rho$, which…

History and Overview · Mathematics 2019-09-06 Steven Finch

Transition State Theory overestimates reaction rates in solution because conventional dividing surfaces between reagents and products are crossed many times by the same reactive trajectory. We describe a recipe for constructing a…

Statistical Mechanics · Physics 2007-05-23 Thomas Bartsch , Rigoberto Hernandez , T. Uzer

It is well-known that 0 is the absorbing state for a branching system. Each particle in the system lives a random long time and gives a random number of new particles at its death time. It stops when the system has no particle. This paper…

Probability · Mathematics 2022-10-31 Yanyun Li , Junping Li

We propose a method to approximate continuous-time, continuous-state stochastic processes by a discrete-time Markov chain defined on a nonuniform grid. Our method provides exact moment matching for processes whose first and second moments…

Probability · Mathematics 2025-11-27 Do Hyun Kim , Ahmet Cetinkaya

Almost all scientific data have uncertainties originating from different sources. Gaussian process regression (GPR) models are a natural way to model data with Gaussian-distributed uncertainties. GPR also has the benefit of reducing I/O…

Machine Learning · Statistics 2025-12-16 Haoyu Li , Isaac J Michaud , Ayan Biswas , Han-Wei Shen

Markov chain Monte Carlo methods are central in computational statistics, and typically rely on detailed balance to ensure invariance with respect to a target distribution. Although straightforward to construct by Metropolization, this can…

Statistics Theory · Mathematics 2025-11-14 Erik Jansson , Moritz Schauer , Ruben Seyer , Akash Sharma

We propose an approach to compute the boundary crossing probabilities for a class of diffusion processes which can be expressed as piecewise monotone (not necessarily one-to-one) functionals of a standard Brownian motion. This class…

Probability · Mathematics 2007-05-23 Liqun Wang , Klaus Pötzelberger

Gaussian Process state-space models capture complex temporal dependencies in a principled manner by placing a Gaussian Process prior on the transition function. These models have a natural interpretation as discretized stochastic…

Machine Learning · Computer Science 2022-02-24 Krista Longi , Jakob Lindinger , Olaf Duennbier , Melih Kandemir , Arto Klami , Barbara Rakitsch

We investigate non-Markovian barrier-crossing kinetics of a massive particle in one dimension in the presence of a memory function that is the sum of two exponentials with different memory times $\tau_1$ and $\tau_2$. Our Langevin…

Chemical Physics · Physics 2020-05-22 Julian Kappler , Victor B. Hinrichsen , Roland R. Netz

Zero-range processes, in which particles hop between sites on a lattice, are closely related to equilibrium networks, in which rewiring of links take place. Both systems exhibit a condensation transition for appropriate choices of the…

Statistical Mechanics · Physics 2009-11-11 A. G. Angel , M. R. Evans , E. Levine , D. Mukamel

The performance of a number of different measures of nonlinearity in a time series is compared numerically. Their power to distinguish noisy chaotic data from linear stochastic surrogates is determined by Monte Carlo simulation for a number…

chao-dyn · Physics 2009-10-31 Thomas Schreiber , Andreas Schmitz

Many studies on biological and soft matter systems report the joint presence of a linear mean-squared displacement and a non-Gaussian probability density exhibiting, for instance, exponential or stretched-Gaussian tails. This phenomenon is…

Statistical Mechanics · Physics 2019-07-24 Jakub Ślęzak , Krzysztof Burnecki , Ralf Metzler

The present work is an endeavour to determine analytically features of the stationary measure of a non-integrable zero-range process, and to investigate the possible existence of phase transitions for such a nonequilibrium model. The rates…

Statistical Mechanics · Physics 2009-11-20 C Godreche

From numerical simulations it is known that the barrier-crossing time of a non-Markovian one-dimensional reaction coordinate with a single exponentially decaying memory function exhibits a memory-turnover: for intermediate values of the…

Statistical Mechanics · Physics 2026-01-16 Roland R. Netz

Markov chains are a convenient means of generating realizations of networks, since they require little more than a procedure for rewiring edges. If a rewiring procedure exists for generating new graphs with specified statistical properties,…

Social and Information Networks · Computer Science 2012-02-17 Jaideep Ray , Ali Pinar , C. Seshadhri