THe largest eigenvalue of sparse random graphs
| dc.creator | Krivelevich, Michael | |
| dc.creator | Sudakov, Benny | |
| dc.date | 2001-06-10 | |
| dc.date.accessioned | 2026-07-07T04:42:04Z | |
| dc.date.available | 2026-07-07T04:42:04Z | |
| dc.description | We prove that for all values of the edge probability p(n) the largest eigenvalue of a random graph G(n,p) satisfies almost surely: λ_1(G)=(1+o(1))max{\sqrtΔ,np}, where Δis a maximal degree of G, and the o(1) term tends to zero as max{\sqrtΔ,np} tends to infinity. | |
| dc.identifier | https://arxiv.org/abs/math/0106066 | |
| dc.identifier | http://arxiv.org/abs/math/0106066 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/61618 | |
| dc.subject | Combinatorics | |
| dc.subject | Probability | |
| dc.subject | 05C80 (Primary) 15A52, 60B** (Secondary) | |
| dc.title | THe largest eigenvalue of sparse random graphs | |
| dc.type | text |