The diagonal elements just shift the spectrum (and the top eigenvalue) by $1$. So we may assume they are $0$.
I first did not see that the entries that are not $1$ are uniform on $[0,1]$ (thanks to Will Sawin for pointing this out). What follows is the solution for the case that they ar 0. At the bottom, after the edit, I answer the original question.
CASE 1: only 0/1 entries, no uniform variables.
All depends on what $k$ is. If $k/n^2\to \alpha\in (0,1/2)$, youYou are essentially dealing with a symmetric matrix whose entries above the diagonal are iid, sum of a Bernoulli $\{0,1\}$ of parameter (=mean) $p=2\alpha$$q=2k/n^2$ and varianceof a uniform random variable on $\sigma^2=p(1-p)$$[0,1]$.
(I will discuss below the difference between your model The mean is therefore $p=q+(1-q)/2$ and the Bernoulli one).
Letvariance is $X$ be this Bernoulli matrix$\sigma^2=q+(1-q)/3-p^2$.
Write $X=\sqrt{n} (Y+p/\sqrt{n} 1 1^T)=\sqrt{n} Z$ where Since, for any value of q, the $Y$'s now have mean $0$is bounded below and so is the variance, you are dealing with the perturbation by $1/n$.
It is$\sqrt{N}$ times a standard fact that there isWigner matrix of a transition: if $p\leq \sigma$
then the largest eigenvaluematrix of $Z$ concentrates at $2\sigma$. Ifrank $p>\sigma$ then it concentrates at$1$ and norm $p+\sigma^2/p$$pN$. Fluctuation results are also knownThus, seeyour top eigenvalue will concentrate around that value ($\pm O(\sqrt{N})$ by estimates on the top eigenvalue of a Wigner matrix and
Weyl's inequalities.
I earlier referred to https://arxiv.org/pdf/math/0605624v1.pdf
Note that your model is sandwiched whp between $p_-=p-K/\sqrt{n}$ and
$p_+=p+K/\sqrt{n}$, for $K$ large with probability $\epsilon(K)\to_{K\to\infty}0$, so your model behaves the same (up to multiplication by
$\sqrt{n}$ and shift by $1$).
If on the other hand $k/n^2\to 0$, you have that the rank 1 perturbation disappears (formally, note thatbut this is the behavior when $p\to 0$ and $p/\sigma^2\to 1$, so $p<\sigma$). But in this case, of course thea very different scaling is not $\sqrt{n}$ but rather $\sqrt{n}\sigma \sim \sqrt{pn}$. This will work as long as $k$ is not too small, I have not checked exactly the threshold,
but $k/n\to \infty$ faster than some poly log should work https://arxiv.org/abs/1309.4922
Finally, if $k/n\to 0$, you will have many empty rows and columns, so you need to first erase those. I did not check and am not sure what happens there.
EDIT:
CASE 2: the original OP.
Here, the mean of the entries is $q=p+(1-p)/2$ and the
variance of the entries is not $p(1-p)$ but rather $p+(1-p)/3 -q^2$. The matrix is never sparse, so no need to single out the case $k/n^2\to 0$scraped that answer.