Related papers: Stochastic Reservoir Calculations
Consider the standard stochastic reaction network model where the dynamics is given by a continuous-time Markov chain over a discrete lattice. For such models, estimation of parameter sensitivities is an important problem, but the existing…
To describe the nonequilibrium states of a system we introduce a new thermodynamic parameter - the lifetime (the first passage time) of a system. The statistical distributions that can be obtained out of the mesoscopic description…
A new explanation of geometric nature of the reservoir computing phenomenon is presented. Reservoir computing is understood in the literature as the possibility of approximating input/output systems with randomly chosen recurrent neural…
For a Markov semigroup $P_t$ with invariant probability measure $\mu$, a constant $\ll>0$ is called a lower bound of the ultra-exponential convergence rate of $P_t$ to $\mu$, if there exists a constant $C\in (0,\infty)$ such that $$…
A Lyapunov design method is used to analyze the nonlinear stability of a generic reservoir computer for both the cases of continuous-time and discrete-time dynamics. Using this method, for a given nonlinear reservoir computer, a radial…
Let $T\$ be a stopping time associated with a sequence of independent random variables $Z_{1},Z_{2},...$ . By applying a suitable change in the probability measure we present relations between the moment or probability generating functions…
Let $\{X_n\}$ be a stationary and ergodic time series taking values from a finite or countably infinite set ${\cal X}$. Assume that the distribution of the process is otherwise unknown. We propose a sequence of stopping times $\lambda_n$…
A new approach of obtaining stratified random samples from statistically dependent random variables is described. The proposed method can be used to obtain samples from the input space of a computer forward model in estimating expectations…
Reservoir computing systems, a class of recurrent neural networks, have recently been exploited for model-free, data-based prediction of the state evolution of a variety of chaotic dynamical systems. The prediction horizon demonstrated has…
We develop a class of non-life reserving models using a stable-1/2 random bridge to simulate the accumulation of paid claims, allowing for an essentially arbitrary choice of a priori distribution for the ultimate loss. Taking an…
Reservoir computing typically relies on large, randomly generated reservoirs, enabling simple, often linear readouts. Over the past two decades, most constructions have exploited the freedom to select the reservoir, constrained primarily by…
We propose the entropy of random Markov trajectories originating and terminating at a state as a measure of the stability of a state of a Markov process. These entropies can be computed in terms of the entropy rates and stationary…
We compute the stationary distribution of a continuous-time Markov chain which is constructed by gluing together two finite, irreducible Markov chains by identifying a pair of states of one chain with a pair of states of the other and…
In this paper we consider the simulation-based Bayesian analysis of stochastic volatility in mean (SVM) models. Extending the highly efficient Markov chain Monte Carlo mixture sampler for the SV model proposed in Kim et al. (1998) and Omori…
We investigate the effects of application of random time-shifts to the readouts of a reservoir computer in terms of both accuracy (training error) and performance (testing error.) For different choices of the reservoir parameters and…
In nonlinear dynamical systems, tipping refers to a critical transition from one steady state to another, typically catastrophic, steady state, often resulting from a saddle-node bifurcation. Recently, the machine-learning framework of…
In this paper we study a general optimal liquidation problem with a control-dependent stopping time which is the first time the stock holding becomes zero or a fixed terminal time, whichever comes first. We prove a stochastic maximum…
This work contains two single-letter upper bounds on the entropy rate of a discrete-valued stationary stochastic process, which only depend on second-order statistics, and are primarily suitable for models which consist of relatively large…
We consider a class of discrete time Markov chains with state space [0,1] and the following dynamics. At each time step, first the direction of the next transition is chosen at random with probability depending on the current location. Then…
For over a century, raindrop size distributions have been a subject of extensive scientific study, typically described by models including the Marshall-Palmer exponential equation, gamma, Weibull, lognormal, and other mathematical…