This paper is concerned with stochastic Schrödinger delay lattice systems with both locally Lipschitz drift and diffusion terms. Based on the uniform estimates and the equicontinuity of the segment of the solution in probability, we show the tightness of a family of probability distributions of the solution and its segment process, and hence the existence of invariant measures on $l^2\times L^2((-\rho,\,0);l^2)$ with $\rho >0$. We also establish a large deviation principle for the solutions with small noise by the weak convergence method.

We study the thermodynamic formalism of a $C^{\infty }$ non-uniformly hyperbolic diffeomorphism on the 2-torus, known as the Katok map. We prove for a Hölder continuous potential with one additional condition, or geometric $t$-potential $\unicode[STIX]{x1D711}_{t}$ with $t<1$, the equilibrium state exists and is unique. We derive the level-2 large deviation principle for the equilibrium state of $\unicode[STIX]{x1D711}_{t}$. We study the multifractal spectra of the Katok map for the entropy and dimension of level sets of Lyapunov exponents.

We establish an invariance principle and a large deviation principle for a biased random walk ${\text{RW}}_\lambda$ with $\lambda\in [0,1)$ on $\mathbb{Z}^d$ . The scaling limit in the invariance principle is not a d-dimensional Brownian motion. For the large deviation principle, its rate function is different from that of a drifted random walk, as may be expected, though the reflected biased random walk evolves like the drifted random walk in the interior of the first quadrant and almost surely visits coordinate planes finitely many times.

We consider a general class of epidemic models obtained by applying the random time changes of Ethier and Kurtz (2005) to a collection of Poisson processes and we show the large deviation principle for such models. We generalise the approach followed by Dolgoarshinnykh (2009) in the case of the SIR epidemic model. Thanks to an additional assumption which is satisfied in many examples, we simplify the recent work of Kratz and Pardoux (2017).

We study large deviation principles for a model of wireless networks consisting of Poisson point processes of transmitters and receivers. To each transmitter we associate a family of connectable receivers whose signal-to-interference-and-noise ratio is larger than a certain connectivity threshold. First, we show a large deviation principle for the empirical measure of connectable receivers associated with transmitters in large boxes. Second, making use of the observation that the receivers connectable to the origin form a Cox point process, we derive a large deviation principle for the rescaled process of these receivers as the connection threshold tends to 0. Finally, we show how these results can be used to develop importance sampling algorithms that substantially reduce the variance for the estimation of probabilities of certain rare events such as users being unable to connect.

The longest stretch L(n) of consecutive heads in n independent and identically distributed coin tosses is seen from the prism of large deviations. We first establish precise asymptotics for the moment generating function of L(n) and then show that there are precisely two large deviation principles, one concerning the behavior of the distribution of L(n) near its nominal value log1∕p n and one away from it. We discuss applications to inference and to logarithmic asymptotics of functionals of L(n).

Let {Zn, n = 0, 1, 2, . . .} be a supercritical branching process, {Nt, t ≥ 0} be a Poisson process independent of {Zn, n = 0, 1, 2, . . .}, then {ZNt, t ≥ 0} is a supercritical Poisson random indexed branching process. We show a law of large numbers, central limit theorem, and large and moderate deviation principles for log ZNt.

In this work, we develop a minimum action method (MAM) with optimal linear time scaling, called tMAM for short. The main idea is to relax the integration time as a functional of the transition path through optimal linear time scaling such that a direct optimization of the integration time is not required. The Feidlin-Wentzell action functional is discretized by finite elements, based on which h-type adaptivity is introduced to tMAM. The adaptive tMAM does not require reparametrization for the transition path. It can be applied to deal with quasi-potential: 1) When the minimal action path is subject to an infinite integration time due to critical points, tMAM with a uniform mesh converges algebraically at a lower rate than the optimal one. However, the adaptive tMAM can recover the optimal convergence rate. 2) When the minimal action path is subject to a finite integration time, tMAM with a uniform mesh converges at the optimal rate since the problem is not singular, and the optimal integration time can be obtained directly from the minimal action path. Numerical experiments have been implemented for both SODE and SPDE examples.

Consider a mean-reverting equation, generalized in the sense it is driven by a1-dimensional centeredGaussian process with Hölder continuous paths on [0,T] (T> 0). Taking thatequation in rough paths sense only gives local existence of the solution because thenon-explosion condition is not satisfied in general. Under natural assumptions, by usingspecific methods, we show the global existence and uniqueness of the solution, itsintegrability, the continuity and differentiability of the associated Itô map, and weprovide an Lp-convergingapproximation with a rate of convergence (p ≫ 1). The regularity of the Itô map ensures a largedeviation principle, and the existence of a density with respect to Lebesgue’s measure,for the solution of that generalized mean-reverting equation. Finally, we study ageneralized mean-reverting pharmacokinetic model.

We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large n, a networked data structure consisting of n units connected by an average number of links of order n / log n can be coded by about H × n bits, where H is an explicitly defined entropy. The main technique in our proofs are large deviation principles for suitably defined empirical measures.

In this paper we prove that the stationary distribution of populations in genetic algorithms focuses on the uniform population with the highest fitness value as the selective pressure goes to ∞ and the mutation probability goes to 0. The obtained sufficient condition is based on the work of Albuquerque and Mazza (2000), who, following Cerf (1998), applied the large deviation principle approach (Freidlin-Wentzell theory) to the Markov chain of genetic algorithms. The sufficient condition is more general than that of Albuquerque and Mazza, and covers a set of parameters which were not found by Cerf.

We derive a large deviation principle for a Brownian immigration branching particle system, where the immigration is governed by a Poisson random measure with a Lebesgue intensity measure.