Related papers: Local Large deviation: A McMillian Theorem for Col…
We propose a linear programming (LP) framework for steady-state diffusion and flux optimization on geometric networks. The state variable satisfies a discrete diffusion law on a weighted, oriented graph, where conductances are scaled by…
The Large Deviations Principle (LDP) is verified for a homogeneous diffusion process with respect to a Brownian motion $B_t$, $$ X^\eps_t=x_0+\int_0^tb(X^\eps_s)ds+ \eps\int_0^t\sigma(X^\eps_s)dB_s, $$ where $b(x)$ and $\sigma(x)$ are are…
In this work, we propose a large-graph limit estimate of the matching coverage for several matching algorithms, on general graphs generated by the configuration model. For a wide class of {\em local} matching algorithms, namely, algorithms…
We study large deviations of the size of the largest connected component in a general class of inhomogeneous random graphs with iid weights, parametrized so that the degree distribution is regularly varying. We derive a large-deviation…
Suppose $\alpha, \beta$ are Lipschitz strongly concave functions from $[0, 1]$ to $\mathbb{R}$ and $\gamma$ is a concave function from $[0, 1]$ to $\mathbb{R}$, such that $\alpha(0) = \gamma(0) = 0$, and $\alpha(1) = \beta(0) = 0$ and…
Let $\mathcal{H}$ be a $t$-regular hypergraph on $n$ vertices and $m$ edges. Let $M$ be the $m \times n$ incidence matrix of $\mathcal{H}$ and let us denote $\lambda =\max_{v \perp \overline{1},\|v\| = 1}\|Mv\|$. We show that the…
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…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
In this article, we develop a framework to study the large deviation principle for matrix models and their quantized versions, by tilting the measures using the limits of spherical integrals obtained in [46,47]. As examples, we obtain 1. a…
We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…
Spectral independence is a recently-developed framework for obtaining sharp bounds on the convergence time of the classical Glauber dynamics. This new framework has yielded optimal $O(n \log n)$ sampling algorithms on bounded-degree graphs…
In this paper we explore maximal deviations of large random structures from their typical behavior. We introduce a model for a high-dimensional random graph process and ask analogous questions to those of Vapnik and Chervonenkis for…
We prove a moderate deviation principle for subgraph count statistics of Erdos-Renyi random graphs. This is equivalent in showing a moderate deviation principle for the trace of a power of a Bernoulli random matrix. It is done via an…
We show a deterministic constant-time local algorithm for constructing an approximately maximum flow and minimum fractional cut in multisource-multitarget networks with bounded degrees and bounded edge capacities. Locality means that the…
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…
We prove a large deviation principle for the finite dimensional marginals of the Gibbs distribution of the macroscopic `overlap'-parameters in the Hopfield model in the case where the number of random patterns, $M$, as a function of the…
When each data point is a large graph, graph statistics such as densities of certain subgraphs (motifs) can be used as feature vectors for machine learning. While intuitive, motif counts are expensive to compute and difficult to work with…
The large deviations theory for heavy-tailed processes has seen significant advances in the recent past. In particular, Rhee et al. (2019) and Bazhba et al. (2020) established large deviation asymptotics at the sample-path level for L\'evy…
We derive a large deviation principle for families of random variables in the basin of attraction of spectrally positive stable distributions by proving a uniform version of the Tauberian theorem for Laplace-Stieltjes transforms. The main…
Consider a measure $\mu_\lambda = \sum_x \xi_x \delta_x$ where the sum is over points $x$ of a Poisson point process of intensity $\lambda$ on a bounded region in $d$-space, and $\xi_x$ is a functional determined by the Poisson points near…