Related papers: Additive N-Step Markov Chains as Prototype Model o…
Random walks are a fundamental model in applied mathematics and are a common example of a Markov chain. The limiting stationary distribution of the Markov chain represents the fraction of the time spent in each state during the stochastic…
A statistical language model assigns probability to strings of arbitrary length. Unfortunately, it is not possible to gather reliable statistics on strings of arbitrary length from a finite corpus. Therefore, a statistical language model…
Predictive constructions are a powerful way of characterizing the probability law of stochastic processes with certain forms of invariance, such as exchangeability or Markov exchangeability. When de Finetti-like representation theorems are…
We present a Markov-chain analysis of blockwise-stochastic algorithms for solving partially block-separable optimization problems. Our main contributions to the extensive literature on these methods are statements about the Markov operators…
We formulate some simple conditions under which a Markov chain may be approximated by the solution to a differential equation, with quantifiable error probabilities. The role of a choice of coordinate functions for the Markov chain is…
Order-preserving couplings are elegant tools for obtaining robust estimates of the time-dependent and stationary distributions of Markov processes that are too complex to be analyzed exactly. The starting point of this paper is to study…
Dynamical processes can be transformed into graphs through a family of mappings called visibility algorithms, enabling the possibility of (i) making empirical data analysis and signal processing and (ii) characterising classes of dynamical…
Dynamical systems are often subject to forcing or changes in their governing parameters and it is of interest to study how this affects their statistical properties. A prominent real-life example of this class of problems is the…
Focusing on stochastic systems arising in mean-field models, the systems under consideration belong to the class of switching diffusions, in which continuous dynamics and discrete events coexist and interact. The discrete events are modeled…
The generalized Langevin equation is used as a model for various coarse-grained physical processes, e.g., the time evolution of the velocity of a given larger particle in an implicitly represented solvent, when the relevant time scales of…
This article considers a model for alternative processes for securities prices and compares this model with actual return data of several securities. The distributions of returns that appear in the model can be Gaussian as well as…
We introduce a new class of stochastic processes which are stationary, Markovian and characterized by an infinite range of time-scales. By transforming the Fokker-Planck equation of the process into a Schrodinger equation with an…
The generalized Langevin equation is a model for the motion of coarse-grained particles where dissipative forces are represented by a memory term. The numerical realization of such a model requires the implementation of a stochastic…
This is a significantly expanded version of the survey paper "Mixing and decay of correlations in non-uniformly expanding maps: a survey of recent results" math/0301319. We discuss recent results on decay of correlations for non-uniformly…
Many complex systems exhibit interactions that depend not only on pairwise connections, but also group structures and memory effects. To capture such effects, we develop a unified tensor framework for modeling higher-order Markov chains…
We introduce a model of long-range interacting particles evolving under a stochastic Monte Carlo dynamics, in which possible increase or decrease in the values of the dynamical variables is accepted with preassigned probabilities. For…
Motivated by novel results in the theory of correlated sequences, we analyze the dynamics of random walks with long-term memory (binary chains with long-range correlations). In our model, the probability for a unit bit in a binary string…
We study the rate of convergence of the Markov chain on $S_n$ which starts with a random $(n-k)$-cycle for a fixed $k \geq 1$, followed by random transpositions. The convergence to the stationary distribution turns out to be of order $n$.…
The upper extremes of a Markov chain with regulary varying stationary marginal distribution are known to exhibit under general conditions a multiplicative random walk structure called the tail chain. More generally, if the Markov chain is…
Continuous-time Markov chains are frequently used as stochastic models for chemical reaction networks, especially in the growing field of systems biology. A fundamental problem for these Stochastic Chemical Reaction Networks (SCRNs) is to…