Related papers: A large deviation principle for block models
We analyze maximum entropy random graph ensembles with constrained degrees, drawn from arbitrary degree distributions, and a tuneable number of 3-loops (triangles). We find that such ensembles generally exhibit two transitions, a clustering…
Random geometric graphs (RGG) can be formalized as hidden-variables models where the hidden variables are the coordinates of the nodes. Here we develop a general approach to extract the typical configurations of a generic hidden-variables…
We consider a statistical model for the problem of finding subgraphs with specified topology in an otherwise random graph. This task plays an important role in the analysis of social and biological networks. In these types of networks,…
Motivated by the Beck-Fiala conjecture, we study the discrepancy problem in two related models of random hypergraphs on $n$ vertices and $m$ edges. In the first (edge-independent) model, a random hypergraph $H_1$ is constructed by fixing a…
We identify the scaling limit of random intersection graphs inside their critical windows. The limit graphs vary according to the clustering regimes, and coincide with the continuum Erdos--Renyi graph in two out of the three regimes. Our…
We present a linear stability analysis of stationary states (or fixed points) in large dynamical systems defined on random directed graphs with a prescribed distribution of indegrees and outdegrees. We obtain two remarkable results for such…
Let $A_N$ be distributed according to the Haar probability measure on the orthogonal group $\mathscr{O}(N)$ for each $N\in\mathbb{N}$. It is well-known that the upper left $m_N\times k_N$ block of $\sqrt{N}A_N$ with $m_Nk_N = o(N)$…
In this article we establish a large deviation principle for the empirical measures of a simple spatially inhomogeneous random walk on $\overline{\mathbb{Z}}$, the two-point compactification of $\mathbb{Z}$. The classical Donsker--Varadhan…
Our general subject is the emergence of phases, and phase transitions, in large networks subjected to a few variable constraints. Our main result is the analysis, in the model using edge and triangle subdensities for constraints, of a sharp…
In this paper, we prove the large deviation principle (LDP) for stochastic differential equations driven by stochastic integrals in one dimension. The result can be proved with a minimal use of rough path theory, and this implies the LDP…
Recent years are characterized by an unprecedented quantity of available network data which are produced at an astonishing rate by an heterogeneous variety of interconnected sensors and devices. This high-throughput generation calls for the…
Spontaneous symmetry breaking is a cornerstone of modern physics, defining a wealth of phenomena in condensed-matter and high-energy physics, and beyond. It requires an infinite number of degrees of freedom, and even then, for continuous…
We study the dynamics of smooth interval maps with non-flat critical points. For every such a map that is topologically exact, we establish the full (level-2) Large Deviation Principle for empirical means. In particular, the Large Deviation…
A method for compression of large graphs and non-negative matrices to a block structure is proposed. Szemer\'edi's regularity lemma is used as heuristic motivation of the significance of stochastic block models. Another ingredient of the…
We consider classes of pseudo-random graphs on $n$ vertices for which the degree of every vertex and the co-degree between every pair of vertices are in the intervals $(np - Cn^\delta,np+Cn^\delta)$ and $(np^2- C n^\delta, np^2 +C…
The configuration model is a sequence of random graphs constructed such that in the large network limit the degree distribution converges to a pre-specified probability distribution. The component structure of such random graphs can be…
We consider the multi-parameter random simplicial complex as a higher dimensional extension of the classical Erd\"os-R\'enyi graph. We investigate appearance of "unusual" topological structures in the complex from the point of view of large…
We utilize the weak convergence method to establish the Freidlin--Wentzell large deviations principle (LDP) for stochastic delay differential equations (SDDEs) with super-linearly growing coefficients, which covers a large class of cases…
A LDP is proved for the inviscid shell model of turbulence. As the viscosity coefficient converges to 0 and the noise intensity is multiplied by the square root of the viscosity, we prove that some shell models of turbulence with a…
Large-deviations theory deals with tails of probability distributions and the rare events of random processes, for example spreading packets of particles. Mathematically, it concerns the exponential fall-of of the density of thin-tailed…