I find the theorem for largest eigenvalue of the adjacency matrix of ER random graph in here https://arxiv.org/pdf/math/0106066.pdf. The adjacency matrix is a symmetric random matrix s.t. diagonal values are all fixed as 0, and every value in the upper triangle is i.i.d. drawn from Bernoulli($ p$ ) for some $ p\in[0,1]$ .

For a weighted random graph, each edge in the adjacency matrix is represented by decimal in $ [0,1]$ drawn from a uniform distribution over $ [0,1]$ (or possibly other distribution over $ [0,1]$ ). The adjacency matrix is a symmetric random matrix s.t. diagonal values are all fixed as 0, and every value in the upper triangle is i.i.d. drawn from uniform over $ [0,1]$ .

My question is,

Is there similar known result about the largest eigenvalue for weighted random graph?

Thanks!