Related papers: The large deviation principle for inhomogeneous Er…

We prove pathwise large deviation principles of slow variables in slow-fast systems in the limit of time-scale separation tending to infinity. In the limit regime we consider, the convergence of the slow variable to its deterministic limit…

In this paper we introduce a network model which evolves in time, and study its largest connected component. We consider a process of graphs $(G_t:t\in [0,1])$, where initially we start with a critical Erd\H{o}s-R\'enyi graph ER(n, 1/n),…

Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting…

We prove a local law for the adjacency matrix of the Erd\H{o}s-R\'enyi graph $G(N, p)$ in the supercritical regime $ pN \geq C\log N$ where $G(N,p)$ has with high probability no isolated vertices. In the same regime, we also prove the…

A well-known theorem of Erd\H{o}s and Gallai asserts that a graph with no path of length $k$ contains at most $\frac{1}{2}(k-1)n$ edges. Recently Gy\H{o}ri, Katona and Lemons gave an extension of this result to hypergraphs by determining…

In this paper we consider the problem of embedding almost-spanning, bounded degree graphs in a random graph. In particular, let $\Delta\geq 5$, $\varepsilon > 0$ and let $H$ be a graph on $(1-\varepsilon)n$ vertices and with maximum degree…

Majority dynamics on a graph $G$ is a deterministic process such that every vertex updates its $\pm 1$-assignment according to the majority assignment on its neighbor simultaneously at each step. Benjamini, Chan, O'Donnel, Tamuz and Tan…

Let $(g_n)_{n\geq 1}$ be a sequence of independent and identically distributed elements of the general linear group $GL(d, \mathbb R)$. Consider the random walk $G_n: = g_n \ldots g_1$. Under suitable conditions, we establish…

The empirical mean of $n$ independent and identically distributed (i.i.d.) random variables $(X_1,\dots,X_n)$ can be viewed as a suitably normalized scalar projection of the $n$-dimensional random vector $X^{(n)}\doteq(X_1,\dots,X_n)$ in…

This paper investigates the Fr\'echet mean of the Erd\H{o}s-R\'enyi random graph $G_{n,p}$ with respect to the Frobenius distance on graph Laplacians, a metric that captures global structural information beyond local edge flips. We first…

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…

Let $(k_n)_{n \in \mathbb{N}}$ be a sequence of positive integers growing to infinity at a sublinear rate, $k_n \rightarrow \infty$ and $k_n/n \rightarrow 0$ as $n \rightarrow \infty$. Given a sequence of $n$-dimensional random vectors…

We establish the Level-1 and Level-3 Large Deviation Principles (LDPs) for invariant measures on shift spaces over finite alphabets under very general decoupling conditions for which the thermodynamic formalism does not apply. Such…

In this paper, we study the entropy of a hard random geometric graph (RGG), a commonly used model for spatial networks, where the connectivity is governed by the distances between the nodes. Formally, given a connection range $r$, a hard…

Consider a pair of correlated Erd\H{o}s-R\'enyi graphs $\mathcal G(n,\tfrac{\lambda}{n};s)$ that are subsampled from a common parent Erd\H{o}s-R\'enyi graph with average degree $\lambda$ and subsampling probability $s$. We establish a sharp…

In the inhomogeneous random graph model, each vertex $i\in\{1,\ldots,n\}$ is assigned a weight $W_i\sim\text{Unif}(0,1)$, and an edge between any two vertices $i,j$ is present with probability $k(W_i,W_j)/\lambda_n\in[0,1]$, where $k$ is a…

We introduce and analyse a Dynamic Random Graph with Vertex Removal (DRGVR) defined as follows. At every step, with probability $p > 1/2$ a new vertex is introduced, and with probability $1-p$ a vertex, chosen uniformly at random among the…

Given an $n$-dimensional random vector $X^{(n)}$ , for $k < n$, consider its $k$-dimensional projection $\mathbf{a}_{n,k}X^{(n)}$, where $\mathbf{a}_{n,k}$ is an $n \times k$-dimensional matrix belonging to the Stiefel manifold…

Consider the complete graph \(K_n\) on \(n\) vertices where each edge \(e\) is independently open with probability \(p_n(e)\) or closed otherwise. Here \(\frac{C-\alpha_n}{n} \leq p_n(e) \leq \frac{C+\alpha_n}{n}\) where \(C > 0\) is a…

Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is crucial for studying its random…