相关论文: Respondent Driven Sampling on sparse Erd\"os-R\'en…

We consider general Exponential Random Graph Models (ERGMs) where the sufficient statistics are functions of homomorphism counts for a fixed collection of simple graphs $F_k$. Whereas previous work has shown a degeneracy phenomenon in dense…

We study the problem of robustly estimating the edge density of Erd\H{o}s-R\'enyi random graphs $G(n, d^\circ/n)$ when an adversary can arbitrarily add or remove edges incident to an $\eta$-fraction of the nodes. We develop the first…

We study the graph alignment problem over two independent Erd\H{o}s-R\'enyi graphs on $n$ vertices, with edge density $p$ falling into two regimes separated by the critical window around $p_c=\sqrt{\log n/n}$. Our result reveals an…

The problem of detecting edge correlation between two Erd\H{o}s-R\'enyi random graphs on $n$ unlabeled nodes can be formulated as a hypothesis testing problem: under the null hypothesis, the two graphs are sampled independently; under the…

We prove that the bulk eigenvectors of sparse random matrices, i.e. the adjacency matrices of Erd\H{o}s-R\'enyi graphs or random regular graphs, are asymptotically jointly normal, provided the averaged degree increases with the size of the…

We consider the adjacency matrix $A$ of the Erd\H{o}s-R\'enyi graph on $N$ vertices with edge probability $d/N$. For $(\log \log N)^4 \ll d \lesssim \log N$, we prove that the eigenvalues near the spectral edge form asymptotically a Poisson…

Respondent-driven sampling (RDS) is a commonly used method for acquiring data on hidden communities, i.e., those that lack unbiased sampling frames or face social stigmas that make their mem- bers unwilling to identify themselves. Obtaining…

In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are interested in recovering sparse vectors representing the…

We prove a moderate deviations principles for the size of the largest connected component in a random $d$-uniform hypergraph. The key tool is a version of the exploration process, that is also used to investigate the giant component of an…

We compute an asymptotic expansion in $1/c$ of the limit in $n$ of the empirical spectral measure of the adjacency matrix of an Erd\H{o}s-R\'enyi random graph with $n$ vertices and parameter $c/n$. We present two different methods, one of…

A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…

In this paper, we present a novel approach based on the random walk process for finding meaningful representations of a graph model. Our approach leverages the transient behavior of many short random walks with novel initialization…

We analyse the eigenvectors of the adjacency matrix of the Erd\H{o}s-R\'enyi graph $\mathbb G(N,d/N)$ for $\sqrt{\log N} \ll d \lesssim \log N$. We show the existence of a localized phase, where each eigenvector is exponentially localized…

We consider spectral properties of sparse sample covariance matrices, which includes biadjacency matrices of the bipartite Erd\H{o}s-R\'enyi graph model. We prove a local law for the eigenvalue density up to the upper spectral edge. Under a…

This paper examines a model involving two dynamic Erd\H{o}s-R\'enyi random graphs that evolve in parallel, with edges in each graph alternating between being present and absent according to specified on- and off-time distributions. A key…

We study the intersection of a random geometric graph with an Erd\H{o}s-R\'enyi graph. Specifically, we generate the random geometric graph $G(n, r)$ by choosing $n$ points uniformly at random from $D=[0, 1]^2$ and joining any two points…

We study the spectrum of a random multigraph with a degree sequence ${\bf D}_n=(D_i)_{i=1}^n$ and average degree $1 \ll \omega_n \ll n$, generated by the configuration model, and also the spectrum of the analogous random simple graph. We…

Let $A$ be the (rescaled) adjacency matrix of the Erd\H{o}s-R\'enyi graphs $\cal G(N,p)$. For $N^{-1+\tau} \leqslant p\leqslant N^{-\tau}$, we study the fluctuation of $f(A)_{ii}$ on the global and mesoscopic spectral scales. We show that…

We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. In particular, we follow the methodology…

We contribute an approach to the problem of locally computing sparse connected subgraphs of dense graphs. In this setting, given an edge in a connected graph $G = (V, E)$, an algorithm locally decides its membership in a sparse connected…