Consider two types of slightly different $n \times n$ symmetric random matrices $X$. The diagonal elements of $X$ are fixed as $1$. Suppose $\frac{k}{n} \to \alpha$ for some constant $\alpha\in(0,1)$.

**Type I**: Randomly sample $k$ distinct numbers $i_1,...,i_k$ from $1,...,n$. Let $X(i,j)=X(j,i) = 1$. All other elements above the diagonal are i.i.d. uniform random variables, and the elements in the lower triangle are set accordingly.

**Type II**: Randomly sample $k^2 - k$ distinct cell above the diagonal and set them as $1$, then all other elements above the diagonal are i.i.d. uniform random variables. The elements in the lower triangle are set accordingly. Type II is more random than type I and every element above the diagonal can still be viewed as i.i.d. with mean $0.5+0.5\alpha^2$.

The answer of https://mathoverflow.net/questions/290582/bound-for-largest-eigenvalue-of-symmetric-matrices-of-uniform-random-variables-o has explained the largest eigenvalue of the Type II will concentrate around $(0.5n+0.5\alpha^2n+O(\sqrt n))$. The question is,

>In Type I, the elements above the diagonal seems not i.i.d., will Type I still has a similar result for the largest eigenvalue?

Any explanation or reference is very much appreciated!