Related papers: Large deviation principles for graphon sampling

We derive an annealed large deviation principle for the normalised local times of a continuous-time random walk among random conductances in a finite domain in $\Z^d$ in the spirit of Donsker-Varadhan \cite{DV75}. We work in the interesting…

In this article we establish a large deviation principle for the family {\nu_{\epsilon}:\epsilon \in (0,1)} of distributions of the scaled stochastic processes {P_{-\log\sqrt{\epsilon}}Z_t}_{t\leq 1}, where (Z_t)_{t\in \lbrack 0,1]} is a…

We study large deviations for random walks on stratified (Carnot) Lie groups. For such groups, there is a natural collection of vectors which generates their Lie algebra, and we consider random walks with increments in only these…

We consider a bounded step size random walk in an ergodic random environment with some ellipticity, on an integer lattice of arbitrary dimension. We prove a level 3 large deviation principle, under almost every environment, with rate…

Large deviation functions contain information on the stability and response of systems driven into nonequilibrium steady states, and in such a way are similar to free energies for systems at equilibrium. As with equilibrium free energies,…

In this paper, we study large and moderate deviation principles for stochastic partial differential equations (SPDEs) on metric graphs and their associated multiscale models via the weak convergence approach, providing a refined…

Sampling methods (e.g., node-wise, layer-wise, or subgraph) has become an indispensable strategy to speed up training large-scale Graph Neural Networks (GNNs). However, existing sampling methods are mostly based on the graph structural…

Motivated by metastability in the zero-range process, we consider i.i.d.\ random variables with values in $\N_0$ and Weibull-like (stretched exponential) law $\mathbb P(X_i =k) = c \exp( - k^\alpha)$, $\alpha \in (0,1)$. We condition on…

This is basically a polished presentation for Sections 1,2 of arXiv:0801.1050. The Moderate Deviations Principle (MDP) is well-understood for sums of independent random variables, worse understood for stationary random sequences, and…

We identify the upper large deviation probability for the number of edges in scale-free geometric random graph models as the space volume goes to infinity. Our result covers the models of scale-free percolation, the Boolean model with…

In this paper, we study the asymptotic behavior of randomly perturbed path-dependent stochastic differential equations with small parameter $\vartheta_{\varepsilon}$, when $\varepsilon \rightarrow 0$, $\vartheta_\varepsilon$ goes to $0$.…

Birth-death processes form a natural class where ideas and results on large deviations can be tested. In this paper, we derive a large deviation principle under the assumption that the rate of a jump down (death) is growing asymptotically…

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…

We propose a computational method for large deviation statistics of time-averaged quantities in general Markov processes. In our proposed method, we repeat a response measurement against external forces, where the forces are determined by…

Random walks on graphs can be slow. To speed them up, imagine that at each step instead of choosing the neighbor at random, there is a small probability $\varepsilon>0$ that we can choose it. We show that in this case, at least for graphs…

We prove a sharp large deviation principle concerning intervals shrinking with sub-exponential speed for certain models involving the Poincar\'e map related to a Markov family for an Axiom A flow restricted to a basic set $\Lambda$…

This work is concerned with Freidlin-Wentzell type large deviation principle for a family of multi-scale quasilinear and semilinear stochastic partial differential equations. Employing the weak convergence method and Khasminskii's time…

Langevin algorithms are popular Markov chain Monte Carlo methods that are often used to solve high-dimensional large-scale sampling problems in machine learning. The most classical Langevin Monte Carlo algorithm is based on the overdamped…

The problem of learning graphons has attracted considerable attention across several scientific communities, with significant progress over the recent years in sparser regimes. Yet, the current techniques still require diverging degrees in…

We establish the large deviation principle for the slow variables in slow-fast dynamical system driven by both Brownian noises and L\'evy noises. The fast variables evolve at much faster time scale than the slow variables, but they are…