Sciweavers

21 search results - page 3 / 5
» The Critical Phase for Random Graphs with a Given Degree Seq...
Sort
View
ALENEX
2003
137views Algorithms» more  ALENEX 2003»
13 years 9 months ago
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
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...
Christos Gkantsidis, Milena Mihail, Ellen W. Zegur...
RSA
2010
108views more  RSA 2010»
13 years 6 months ago
Resolvent of large random graphs
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...
Charles Bordenave, Marc Lelarge
STOC
2000
ACM
112views Algorithms» more  STOC 2000»
13 years 12 months ago
A random graph model for massive graphs
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
William Aiello, Fan R. K. Chung, Linyuan Lu
CAAN
2007
Springer
14 years 1 months ago
Vertex Pursuit Games in Stochastic Network Models
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
Anthony Bonato, Pawel Pralat, Changping Wang
COMBINATORICA
2008
123views more  COMBINATORICA 2008»
13 years 6 months ago
Counting canonical partitions in the random graph
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
Jean A. Larson