Related papers: Large Deviations, Sharron-McMillan-Breiman Theorem…
We consider a dynamic Erd\H{o}s-R\'enyi random graph (ERRG) on $n$ vertices in which each edge switches on at rate $\lambda$ and switches off at rate $\mu$, independently of other edges. The focus is on the analysis of the evolution of the…
In this work, we establish the Freidlin--Wentzell large deviations principle (LDP) of the stochastic Cahn--Hilliard equation with small noise, which implies the one-point LDP. Further, we give the one-point LDP of the spatial finite…
We consider the damped nonlinear wave (NLW) equation driven by a spatially regular white noise. Assuming that the noise is non-degenerate in all Fourier modes, we establish a large deviations principle (LDP) for the occupation measures of…
In this paper we prove a large deviation principle (LDP) for the empirical measure of a general system of mean-field interacting diffusions with singular drift (as the number of particles tends to infinity) and show convergence to the…
In this paper, we consider the large deviations principles (LDPs) for the stochastic linear Schr\"odinger equation and its symplectic discretizations. These numerical discretizations are the spatial semi-discretization based on spectral…
Using the weak convergence approach, we prove the large deviation principle (LDP) for solutions to quasilinear stochastic evolution equations with small Gaussian noise in the critical variational setting, a recently developed general…
In \cite{FTD1}, we proved the almost sure convergence of eigenvalues of the SYK model, which can be viewed as a type of \emph{law of large numbers} in probability theory; in \cite{FTD2}, we proved that the linear statistic of eigenvalues…
For parabolic stochastic partial differential equations (SPDEs), we show that the numerical methods, including the spatial spectral Galerkin method and further the full discretization via the temporal accelerated exponential Euler method,…
For any finite colored graph we define the empirical neighborhood measure, which counts the number of vertices of a given color connected to a given number of vertices of each color, and the empirical pair measure, which counts the number…
The isoperimetric problem is a classic topic in geometric measure theory, yet critical questions regarding the characterization of optimal solutions -- even asymptotically optimal ones -- remain largely unresolved. In this paper, we…
We consider the problem of learning the interaction strength between the nodes of a network based on dependent binary observations residing on these nodes, generated from a Markov Random Field (MRF). Since these observations can possibly be…
We analyze the macroscopic behavior of multi-populations randomly connected neural networks with interaction delays. Similar to cases occurring in spin glasses, we show that the sequences of empirical measures satisfy a large deviation…
We consider the problem of determining asymptotic bounds on the capacity of a random ad hoc network. Previous approaches assumed a link layer model in which if a transmitter-receiver pair can communicate with each other, i.e., the Signal to…
Let $\Xi$ be the adjacency matrix of an Erd\H{o}s-R\'enyi graph on $n$ vertices and with parameter $p$ and consider $A$ a $n\times n$ centered random symmetric matrix with bounded i.i.d. entries above the diagonal. When the mean degree $np$…
Consider the random graph sampled uniformly from the set of all simple graphs with a given degree sequence. Under mild conditions on the degrees, we establish a Large Deviation Principle (LDP) for these random graphs, viewed as elements of…
We establish the well-posedness of stationary solutions for a class of SPDEs with locally monotone coefficients, and prove the Freidlin--Wentzell large deviation principle (LDP) for these stationary solutions. The LDP for the associated…
In this paper we study the Large Deviation Principle (LDP in abbreviation) for a class of Stochastic Partial Differential Equations (SPDEs) in the whole space $\mathbb{R}^d$, with arbitrary dimension $d\geq 1$, under random influence which…
We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint…
We study the asymptotic law of a network of interacting neurons when the number of neurons becomes infinite. The dynamics of the neurons is described by a set of stochastic differential equations in discrete time. The neurons interact…
Consider the inhomogeneous Erd\H{o}s-R\'enyi random graph (ERRG) on $n$ vertices for which each pair $i,j\in\{1,\ldots,n\}$, $i\neq j$ is connected independently by an edge with probability $r_n(\frac{i-1}{n},\frac{j-1}{n})$, where…