Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
1 answer
336 views

Eigenvalues of random graphs

At time $t=0$, let $G_n(V,E)$ be a graph with $n$ vertices and $m < n$ edges. Then there exists a unique symmetric adjacency matrix $A_n$ associated with $G_n(V,E)$, defined as follows: $a_{ij} = 1$...
Piero Giacomelli's user avatar