We consider an Erd\H{o}s-R\'{e}nyi graph $\mathbb{G}(n,p)$ on $n$ vertices with edge probability $p$ such that \[ \sqrt{\frac{\log n}{\log \log n}} \ll np \le n^{1/2-o(1)}, \label{eq:abs} \tag{$\dagger$} \] and derive the upper tail large deviations of $\lambda(\mathbb{G}(n,p))$, the largest eigenvalue of its adjacency matrix. Within this regime we show that, for $p \gg n^{-2/3}$ the $\log$-probability of the upper tail event of $\lambda(\mathbb{G}(n,p))$ equals to that of planting a clique of an appropriate size (upon ignoring smaller order terms), while for $p \ll n^{-2/3}$ the same is given by that of the existence of a high degree vertex. This, in particular, shows an emergence of {\em non-planted localized structure} in the latter regi...
We consider the ensemble of adjacency matrices of Erdős-Rényi random graphs, i.e. graphs on N vertic...
Abstract. The upper tail problem in the Erdős-Rényi random graph G ∼ Gn,p asks to estimate the pro...
Abstract. We study the lower tail large deviation problem for subgraph counts in a random graph. Let...
Eigenvalues of Wigner matrices has been a major topic of investigation. A particularly important sub...
We consider an inhomogeneous Erdos-Renyi random graph G(N) with vertex set [N] = {1, . . . , N} for ...
We consider the adjacency matrix $A$ of the Erd\H{o}s-R\'enyi graph on $N$ vertices with edge probab...
Let (Formula presented.) be the Erdős–Rényi graph with connection probability (Formula presented.) a...
24 pages, 5 figures.We compute an asymptotic expansion in $1/c$ of the limit in $n$ of the empirical...
Abstract. What is the probability that the number of triangles in Gn,p, the Erdős-Rényi random gra...
In this note, we give a precise description of the limiting empirical spectral distribution (ESD) fo...
AbstractWhat does an Erdős-Rényi graph look like when a rare event happens? This paper answers this ...
We establish bounds on the spectral radii for a large class of sparse random matrices, which include...
We consider a class of sparse random matrices which includes the adjacency matrix of the Erdős-Rényi...
We develop tail estimates for the number of edges in a Chung-Lu random graph with regularly varying ...
For the Erdos-Rényi random graph Gn,p, we consider the order of a largest vertex subset that induces...
We consider the ensemble of adjacency matrices of Erdős-Rényi random graphs, i.e. graphs on N vertic...
Abstract. The upper tail problem in the Erdős-Rényi random graph G ∼ Gn,p asks to estimate the pro...
Abstract. We study the lower tail large deviation problem for subgraph counts in a random graph. Let...
Eigenvalues of Wigner matrices has been a major topic of investigation. A particularly important sub...
We consider an inhomogeneous Erdos-Renyi random graph G(N) with vertex set [N] = {1, . . . , N} for ...
We consider the adjacency matrix $A$ of the Erd\H{o}s-R\'enyi graph on $N$ vertices with edge probab...
Let (Formula presented.) be the Erdős–Rényi graph with connection probability (Formula presented.) a...
24 pages, 5 figures.We compute an asymptotic expansion in $1/c$ of the limit in $n$ of the empirical...
Abstract. What is the probability that the number of triangles in Gn,p, the Erdős-Rényi random gra...
In this note, we give a precise description of the limiting empirical spectral distribution (ESD) fo...
AbstractWhat does an Erdős-Rényi graph look like when a rare event happens? This paper answers this ...
We establish bounds on the spectral radii for a large class of sparse random matrices, which include...
We consider a class of sparse random matrices which includes the adjacency matrix of the Erdős-Rényi...
We develop tail estimates for the number of edges in a Chung-Lu random graph with regularly varying ...
For the Erdos-Rényi random graph Gn,p, we consider the order of a largest vertex subset that induces...
We consider the ensemble of adjacency matrices of Erdős-Rényi random graphs, i.e. graphs on N vertic...
Abstract. The upper tail problem in the Erdős-Rényi random graph G ∼ Gn,p asks to estimate the pro...
Abstract. We study the lower tail large deviation problem for subgraph counts in a random graph. Let...