The average number of spanning trees in sparse graphs with given degrees
We give an asymptotic expression for the expected number of spanning trees in a random graph with a given degree sequence , provided that the number of edges is at least , where is the maximum degree. A key part of our argument involves establishing a concentration result for a certain family of functions over random trees with given degrees, using PrÃ¼fer codes.
63
6-25
6-25
Elsevier