On evaluating the rate function of large deviations for jump processes

1990 ◽  
Vol 6 (3) ◽  
pp. 206-219 ◽  
Author(s):  
Chen Mufa ◽  
Lu Yungang
Keyword(s):  
Large Deviations ◽  
Rate Function ◽  
Jump Processes

scholarly journals Run-and-Tumble Motion: The Role of Reversibility

2021 ◽  
Vol 183 (3) ◽  
Author(s):  
Bart van Ginkel ◽  
Bart van Gisbergen ◽  
Frank Redig
Keyword(s):  
Free Energy ◽  
Diffusion Coefficient ◽  
Large Deviations ◽  
Energy Function ◽  
Internal State ◽  
Rate Function ◽  
Free Energy Function ◽  
Large Deviations Principle ◽  
Preferred Direction ◽  
State Process

AbstractWe study a model of active particles that perform a simple random walk and on top of that have a preferred direction determined by an internal state which is modelled by a stationary Markov process. First we calculate the limiting diffusion coefficient. Then we show that the ‘active part’ of the diffusion coefficient is in some sense maximal for reversible state processes. Further, we obtain a large deviations principle for the active particle in terms of the large deviations rate function of the empirical process corresponding to the state process. Again we show that the rate function and free energy function are (pointwise) optimal for reversible state processes. Finally, we show that in the case with two states, the Fourier–Laplace transform of the distribution, the moment generating function and the free energy function can be computed explicitly. Along the way we provide several examples.

scholarly journals Fast Reaction Limits via $$\Gamma $$-Convergence of the Flux Rate Functional

2021 ◽  
Author(s):  
Mark A. Peletier ◽  
D. R. Michiel Renger
Keyword(s):  
Evolution Equations ◽  
Detailed Balance ◽  
Approximate Solutions ◽  
Reaction Rates ◽  
Convergence Result ◽  
Rate Function ◽  
Jump Processes ◽  
Kolmogorov Equations ◽  
Markov Jump ◽  
Fast Reaction

AbstractWe study the convergence of a sequence of evolution equations for measures supported on the nodes of a graph. The evolution equations themselves can be interpreted as the forward Kolmogorov equations of Markov jump processes, or equivalently as the equations for the concentrations in a network of linear reactions. The jump rates or reaction rates are divided in two classes; ‘slow’ rates are constant, and ‘fast’ rates are scaled as $$1/\epsilon $$ 1 / ϵ , and we prove the convergence in the fast-reaction limit $$\epsilon \rightarrow 0$$ ϵ → 0 . We establish a $$\Gamma $$ Γ -convergence result for the rate functional in terms of both the concentration at each node and the flux over each edge (the level-2.5 rate function). The limiting system is again described by a functional, and characterises both fast and slow fluxes in the system. This method of proof has three advantages. First, no condition of detailed balance is required. Secondly, the formulation in terms of concentration and flux leads to a short and simple proof of the $$\Gamma $$ Γ -convergence; the price to pay is a more involved compactness proof. Finally, the method of proof deals with approximate solutions, for which the functional is not zero but small, without any changes.

On Approximate Large Deviations for 1D Diffusion

2003 ◽  
Vol 10 (2) ◽  
pp. 381-399
Author(s):  
A. Yu. Veretennikov
Keyword(s):  
Differential Equation ◽  
Exact Solution ◽  
Large Deviations ◽  
Stochastic Differential Equation ◽  
Approximation Scheme ◽  
Sufficient Conditions ◽  
Rate Function ◽  
Euler Approximation ◽  
One Dimensional

Abstract We establish sufficient conditions under which the rate function for the Euler approximation scheme for a solution of a one-dimensional stochastic differential equation on the torus is close to that for an exact solution of this equation.

scholarly journals Large deviations for randomly connected neural networks: II. State-dependent interactions

2018 ◽  
Vol 50 (3) ◽  
pp. 983-1004 ◽  
Author(s):  
Tanguy Cabana ◽  
Jonathan D. Touboul
Keyword(s):  
Neural Networks ◽  
Large Deviations ◽  
Rate Function ◽  
Network Size ◽  
Kuramoto Model ◽  
Empirical Measure ◽  
Large Deviations Principle ◽  
Stochastic Version ◽  
State Dependent ◽  
Spatially Extended

Abstract We continue the analysis of large deviations for randomly connected neural networks used as models of the brain. The originality of the model relies on the fact that the directed impact of one particle onto another depends on the state of both particles, and they have random Gaussian amplitude with mean and variance scaling as the inverse of the network size. Similarly to the spatially extended case (see Cabana and Touboul (2018)), we show that under sufficient regularity assumptions, the empirical measure satisfies a large deviations principle with a good rate function achieving its minimum at a unique probability measure, implying, in particular, its convergence in both averaged and quenched cases, as well as a propagation of a chaos property (in the averaged case only). The class of model we consider notably includes a stochastic version of the Kuramoto model with random connections.

scholarly journals Large Deviations for the Single-Server Queue and the Reneging Paradox

2021 ◽  
Author(s):  
Rami Atar ◽  
Amarjit Budhiraja ◽  
Paul Dupuis ◽  
Ruoyu Wu
Keyword(s):  
Large Deviations ◽  
Decay Rate ◽  
Sample Path ◽  
Arrival Rate ◽  
Rate Function ◽  
Service Rate ◽  
Single Server ◽  
Large Deviations Principle ◽  
Long Run ◽  
The Individual

For the M/M/1+M model at the law-of-large-numbers scale, the long-run reneging count per unit time does not depend on the individual (i.e., per customer) reneging rate. This paradoxical statement has a simple proof. Less obvious is a large deviations analogue of this fact, stated as follows: the decay rate of the probability that the long-run reneging count per unit time is atypically large or atypically small does not depend on the individual reneging rate. In this paper, the sample path large deviations principle for the model is proved and the rate function is computed. Next, large time asymptotics for the reneging rate are studied for the case when the arrival rate exceeds the service rate. The key ingredient is a calculus of variations analysis of the variational problem associated with atypical reneging. A characterization of the aforementioned decay rate, given explicitly in terms of the arrival and service rate parameters of the model, is provided yielding a precise mathematical description of this paradoxical behavior.

A LARGE DEVIATION FOR OCCUPATION TIME OF SUPER α-STABLE PROCESS

2008 ◽  
Vol 11 (01) ◽  
pp. 53-71 ◽  
Author(s):  
QIU-YUE LI ◽  
YAN-XIA REN
Keyword(s):  
Brownian Motion ◽  
Large Deviations ◽  
Large Deviation Principle ◽  
Large Deviation ◽  
Stable Process ◽  
Rate Function ◽  
Occupation Time ◽  
Occupation Times ◽  
Tail Probabilities ◽  
Super Brownian Motion

We derive a large deviation principle for occupation time of super α-stable process in ℝd with d > 2α. The decay of tail probabilities is shown to be exponential and the rate function is characterized. Our result can be considered as a counterpart of Lee's work on large deviations for occupation times of super-Brownian motion in ℝd for dimension d > 4 (see Ref. 10).

A large deviations heuristic made precise

2000 ◽  
Vol 128 (3) ◽  
pp. 561-569 ◽  
Author(s):  
NEIL O'CONNELL
Keyword(s):  
Large Deviations ◽  
Bin Packing ◽  
Symmetric Functions ◽  
Large Deviation ◽  
Random Variables ◽  
Packing Problem ◽  
Rate Function ◽  
Empirical Measures ◽  
Underlying Distribution ◽  
Uniformly Lipschitz

Sanov's Theorem states that the sequence of empirical measures associated with a sequence of i.d.d. random variables satisfies the large deviation principle (LDP) in the weak topology with rate function given by a relative entropy. We present a derivative which allows one to establish LDPs for symmetric functions of many i.d.d. random variables under the condition that (i) a law of large numbers holds whatever the underlying distribution and (ii) the functions are uniformly Lipschitz. The heuristic (of the title) is that the LDP follows from (i) provided the functions are ‘sufficiently smooth’. As an application, we obtain large deviations results for the stochastic bin-packing problem.

scholarly journals Periodically driven jump processes conditioned on large deviations

2020 ◽  
Vol 2020 (3) ◽  
pp. 033208 ◽  
Author(s):  
Lydia Chabane ◽  
Raphaël Chétrite ◽  
Gatien Verley
Keyword(s):  
Large Deviations ◽  
Jump Processes ◽  
Periodically Driven

Large deviations for the time of ruin

1999 ◽  
Vol 36 (3) ◽  
pp. 733-746 ◽  
Author(s):  
Harri Nyrhinen
Keyword(s):  
Large Deviations ◽  
Positive Real Number ◽  
Rate Function ◽  
Positive Real ◽  
Large Deviations Principle ◽  
Borel Sets ◽  
Time Of Ruin ◽  
The Family ◽  
The Time Of Ruin ◽  
Simulation Problem

Let {Yn | n=1,2,…} be a stochastic process and M a positive real number. Define the time of ruin by T = inf{n | Yn > M} (T = +∞ if Yn ≤ M for n=1,2,…). We are interested in the ruin probabilities for large M. Define the family of measures {PM | M > 0} by PM(B) = P(T/M ∊ B) for B ∊ ℬ (ℬ = Borel sets of ℝ). We prove that for a wide class of processes {Yn}, the family {PM} satisfies a large deviations principle. The rate function will correspond to the approximation P(T/M ≈ x) ≈ P(Y⌈xM⌉/M ≈ 1) for x > 0. We apply the result to a simulation problem.

scholarly journals Large deviations for randomly connected neural networks: I. Spatially extended systems

2018 ◽  
Vol 50 (3) ◽  
pp. 944-982 ◽  
Author(s):  
Tanguy Cabana ◽  
Jonathan D. Touboul
Keyword(s):  
Neural Networks ◽  
Large Deviations ◽  
Rate Function ◽  
Network Size ◽  
Empirical Measure ◽  
Interaction Coefficients ◽  
Large Deviations Principle ◽  
Implicit Equation ◽  
Random Interaction ◽  
Spatially Extended

Abstract In a series of two papers, we investigate the large deviations and asymptotic behavior of stochastic models of brain neural networks with random interaction coefficients. In this first paper, we take into account the spatial structure of the brain and consider first the presence of interaction delays that depend on the distance between cells and then the Gaussian random interaction amplitude with a mean and variance that depend on the position of the neurons and scale as the inverse of the network size. We show that the empirical measure satisfies a large deviations principle with a good rate function reaching its minimum at a unique spatially extended probability measure. This result implies an averaged convergence of the empirical measure and a propagation of chaos. The limit is characterized through a complex non-Markovian implicit equation in which the network interaction term is replaced by a nonlocal Gaussian process with a mean and covariance that depend on the statistics of the solution over the whole neural field.

Sign in / Sign up

Export Citation Format

Share Document