Related papers: A large deviation principle for block models

We prove joint large deviation principle for the \emph{ empirical pair measure} and \emph{empirical locality measure} of the \emph{near intermediate} coloured random geometric graph models on $n$ points picked uniformly in a $d-$dimensional…

We introduce and analyse ensembles of 2-regular random graphs with a tuneable distribution of short cycles. The phenomenology of these graphs depends critically on the scaling of the ensembles' control parameters relative to the number of…

We consider a finite collection of independent Hermitian heavy-tailed random matrices of growing dimension. Our model includes the L\'evy matrices proposed by Bouchaud and Cizeau, as well as sparse random matrices with O(1) non-zero entries…

This paper deals with rare events in a general {interacting gas} at high temperature, by means of Large Deviations Principles. The main result is an LDP for the tagged empirical field, which features the competition of an energy term and an…

Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…

Density matrices of graphs are combinatorial laplacians normalized to have trace one (Braunstein \emph{et al.} \emph{Phys. Rev. A,} \textbf{73}:1, 012320 (2006)). If the vertices of a graph are arranged as an array, then its density matrix…

We prove two Large deviations principles (LDP) in the zone of moderate deviation probabilities. First we establish LDP for the conditional distributions of moderate deviations of empirical bootstrap measures given empirical probability…

We recover the Donsker-Varadhan large deviations principle (LDP) for the empirical measure of a continuous time Markov chain on a countable (finite or infinite) state space from the joint LDP for the empirical measure and the empirical flow…

We revisit the classical hard-core model, also known as independent set and dual to vertex cover problem, where one puts particles with a first-neighbor hard-core repulsion on the vertices of a random graph. Although the case of random…

We consider the problem of finding a Hamiltonian path or cycle with precedence constraints in the form of a partial order on the vertex set. We study the complexity for graph width parameters for which the ordinary problems…

Random graphs with latent geometric structure are popular models of social and biological networks, with applications ranging from network user profiling to circuit design. These graphs are also of purely theoretical interest within…

We consider a two-dimensional Hamiltonian system perturbed by a small diffusion term, whose coefficient is state-dependent and non-degenerate. As a result, the process consists of the fast motion along the level curves and slow motion…

Time-evolving random graph models have appeared and have been studied in various fields of research over the past decades. However, the rigorous mathematical treatment of large graphs and their limits at the process-level is still in its…

We study the dynamical large deviations of the classical stochastic symmetric simple exclusion process (SSEP) by means of numerical matrix product states. We show that for half-filling, long-time trajectories with a large enough imbalance…

We prove general nonlinear large deviation estimates similar to Chatterjee-Dembo's original bounds except that we do not require any second order smoothness. Our approach relies on convex analysis arguments and is valid for a broad class of…

We study a large deviation principle for a system of stochastic reaction--diffusion equations (SRDEs) with a separation of fast and slow components and small noise in the slow component. The derivation of the large deviation principle is…

We prove identifiability of parameters for a broad class of random graph mixture models. These models are characterized by a partition of the set of graph nodes into latent (unobservable) groups. The connectivities between nodes are…

Large time-varying graphs are increasingly common in financial, social and biological settings. Feature extraction that efficiently encodes the complex structure of sparse, multi-layered, dynamic graphs presents computational and…

This work has two contributions. The first one is extending the Large Deviation Principle for uniform hyper-graphons from Lubetzky and Zhao \cite{lubetzky2015replica} to the multi-relational setting where each hyper-graphon can have…

We combine hydrodynamic and modulated energy techniques to study the large deviations of systems of particles with pairwise singular repulsive interactions and additive noise. Specifically, we examine periodic Riesz interactions indexed by…