Related papers: The rank of diluted random graphs

We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph $G_N$ with vertex set $[N] = \{1,\dots,N\}$ for which the pair of vertices $i,j \in [N]$, $i\neq j$, is connected by an edge with probability $r(\tfrac{i}{N},\tfrac{j}{N})$,…

We study the properties of random graphs where for each vertex a {\it neighbourhood} has been previously defined. The probability of an edge joining two vertices depends on whether the vertices are neighbours or not, as happens in Small…

We analyze gene co-expression network under the random matrix theory framework. The nearest neighbor spacing distribution of the adjacency matrix of this network follows Gaussian orthogonal statistics of random matrix theory (RMT). Spectral…

This paper systematically studies the behavior of the leading eigenvectors for independent edge undirected random graphs generated from a general latent position model whose link function is possibly infinite rank and also possibly…

Let G be a random subgraph of the n-cube where each edge appears randomly and independently with probability p. We prove that the largest eigenvalue of the adjacency matrix of G is almost surely \lambda_1(G)= (1+o(1))…

We study eigenvalue distribution of the adjacency matrix $A^{(N,p, \alpha)}$ of weighted random bipartite graphs $\Gamma= \Gamma_{N,p}$. We assume that the graphs have $N$ vertices, the ratio of parts is $\frac{\alpha}{1-\alpha}$ and the…

We show that for any fixed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combines the viewpoints of the well-studied problems of embedding…

Given an $n\times n$ symmetric matrix $W\in [0,1]^{[n]\times [n]}$, let $\mathcal{G}(n,W)$ be the random graph obtained by independently including each edge $jk$ with probability $W_{jk}$. Given a degree sequence ${\bf d}=(d_1,\ldots,…

McKay proved that the limiting spectral measures of the ensembles of $d$-regular graphs with $N$ vertices converge to Kesten's measure as $N\to\infty$. In this paper we explore the case of weighted graphs. More precisely, given a large…

In this work, we study some statistical properties of the extreme eigenstates of the randomly-weighted adjacency matrices of random graphs. We focus on two random graph models: Erd\H{o}s-R\'{e}nyi (ER) graphs and random geometric graphs…

A set $S$ of vertices in a graph $G$ is a paired dominating set if every vertex of $G$ is adjacent to a vertex in $S$ and the subgraph induced by $S$ contains a perfect matching (not necessarily as an induced subgraph). The paired…

Let $d\geq 3$ be fixed and $G$ be a large random $d$-regular graph on $n$ vertices. We show that if $n$ is large enough then the entry distribution of every almost eigenvector $v$ of $G$ (with entry sum 0 and normalized to have length…

For each $n \ge 1$, let $\mathrm{d}^n=(d^{n}(i),1 \le i \le n)$ be a sequence of positive integers with even sum $\sum_{i=1}^n d^n(i) \ge 2n$. Let $(G_n,T_n,\Gamma_n)$ be uniformly distributed over the set of simple graphs $G_n$ with degree…

Let $A$ be an $n\times n$ random symmetric matrix with independent identically distributed subgaussian entries of unit variance. We prove the following large deviation inequality for the rank of $A$: for all $1\leq k\leq c\sqrt{n}$,…

Random graphs defined by an occurrence probability that is invariant under node aggregation have been identified recently in the context of network renormalization. The invariance property requires that edges are drawn with a specific…

The article considers an inhomogeneous Erd\H{o}s-R\"enyi random graph on $\{1,\ldots, N\}$, where an edge is placed between vertices $i$ and $j$ with probability $\varepsilon_N f(i/N,j/N)$, for $i\le j$, the choice being made independent…

Two distinct projections of finite rank $m$ are adjacent if their difference is an operator of rank two or, equivalently, the intersection of their images is $(m-1)$-dimensional. We extend this adjacency relation on other conjugacy classes…

The goal of this paper is to provide a general purpose result for the coupling of exploration processes of random graphs, both undirected and directed, with their local weak limits when this limit is a marked Galton-Watson process. This…

Let $G$ be a $d$-regular graph $G$ on $n$ vertices. Suppose that the adjacency matrix of $G$ is such that the eigenvalue $\lambda$ which is second largest in absolute value satisfies $\lambda=o(d)$. Let $G_p$ with $p=\frac{\alpha}{d}$ be…

Given a graph $G,$ a subset of vertices is called a maximum dissociation set of $G$ if it induces a subgraph with vertex degree at most 1, and the subset has maximum cardinality. The cardinality of a maximum dissociation set is called the…