Related papers: Local Large deviation: A McMillian Theorem for Col…

In this paper we introduce a new notion of convergence of sparse graphs which we call Large Deviations or LD-convergence and which is based on the theory of large deviations. The notion is introduced by "decorating" the nodes of the graph…

For a finite random graph, we defined a simple model of statistical mechanics. We obtain an annealed asymptotic result for the random partition function for this model on finite random graphs as n; the size of the graph is very large. To…

We consider a continuous time Markov chain on a countable state space. We prove a joint large deviation principle (LDP) of the empirical measure and current in the limit of large time interval. The proof is based on results on the joint…

We prove quenched versions of (i) a large deviations principle (LDP), (ii) a central limit theorem (CLT), and (iii) a local central limit theorem (LCLT) for non-autonomous dynamical systems. A key advance is the extension of the spectral…

For any fixed simple graph $H=(V,E)$ and any fixed $u>0$, we establish the leading order of the exponential rate function for the probability that the number of copies of $H$ in the Erd\H{o}s--R\'enyi graph $G(n,p)$ exceeds its expectation…

We establish the large deviations principle (LDP) and the moderate deviations principle (MDP) and an almost sure version of the central limit theorem (CLT) for the stochastic 3D viscous primitive equations driven by a multiplicative white…

The aim of this note is to announce some results about the probabilistic and deterministic asymptotic properties of linear groups. The first one is the analogue, for norms of random matrix products, of the classical theorem of Cramer on…

For any hyperbolic rational map and any net of Borel probability measures on the space of Borel probability measures on the Julia set, we show that this net satisfies a strong form of the large deviation principle with a rate function given…

In this short note we consider semi-Markov processes satisfying the condition of direction-time independence (Markov renewal processes). We derive large deviation principles and fluctuation theorems for the empirical current and the…

We establish the large deviation principle for a topological Markov shift over infinite alphabet which satisfies strong combinatorial assumptions called ``finite irreducibility'' or ``finite primitiveness''. More precisely, we assume the…

The event of large losses plays an important role in credit risk. As these large losses are typically rare, and portfolios usually consist of a large number of positions, large deviation theory is the natural tool to analyze the tail…

We develop a theory of ultrametric graphons as limiting objects for random networks with nested hierarchical community structure. A graphon $W:[0,1]^2\to[0,1]$ is called ultrametric if $W(x,y)=w(d(x,y))$, where $d$ is an ultrametric on…

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…

In this work we determine a process-level Large Deviation Principle (LDP) for a model of interacting particles indexed by a lattice $\mathbb{Z}^d$. The connections are random, sparse and unscaled, so that the system converges in the large…

This paper establishs the large deviation principle (LDP) for multiple averages on $\mathbb{N}^d$. We extend the previous work of [Carinci et al., Indag. Math. 2012] to multidimensional lattice $\mathbb{N}^d$ for $d\geq 2$. The same…

For any $\alpha\in (0,1)$ and any $n^{\alpha}\leq d\leq n/2$, we show that $\lambda(G)\leq C_\alpha \sqrt{d}$ with probability at least $1-\frac{1}{n}$, where $G$ is the uniform random $d$-regular graph on $n$ vertices, $\lambda(G)$ denotes…

In a recent paper, Aistleitner, Gantert, Kabluchko, Prochno and Ramanan studied large deviation principles (LDPs) for lacunary trigonometric sums $\sum_{n=1}^N \cos(2 \pi n_k x)$, where the sequence $(n_k)_{k \geq 1}$ satisfies the Hadamard…

We consider the random point processes on a measure space X defined by the Gibbs measures associated to a given sequence of N-particle Hamiltonians H^{(N)}. Inspired by the method of Messer-Spohn for proving concentration properties for the…

Let $\lambda^{*}$ be the maximum spectral radius of connected irregular graphs on $n$ vertices with maximum degree $\Delta$. Liu, Shen and Wang (2007) conjectured that $\lim_{n\rightarrow…

A theorem of Hoffman gives an upper bound on the independence ratio of regular graphs in terms of the minimum $\lambda_{\min}$ of the spectrum of the adjacency matrix. To complement this result we use random eigenvectors to gain lower…