16 search results - page 2 / 4 » The scaling window for a random graph with a given degree se... |
APPROX
2008
Springer
13 years 8 months ago
2008
Springer
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
COMBINATORICS
2006
13 years 6 months ago
2006
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...
SODA
1997
ACM
13 years 7 months ago
1997
ACM
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
ALENEX
2003
13 years 7 months ago
2003
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
RSA
2010
13 years 4 months ago
2010
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...