Sciweavers

37 search results - page 4 / 8
» On the Degree Sequences of Random Outerplanar and Series-Par...
Sort
View
RSA
2011
124views more  RSA 2011»
13 years 2 months ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...
ALENEX
2003
137views Algorithms» more  ALENEX 2003»
13 years 8 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...
SODA
1997
ACM
95views Algorithms» more  SODA 1997»
13 years 8 months ago
Randomly Sampling Molecules
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...
Leslie Ann Goldberg, Mark Jerrum
IM
2006
13 years 7 months ago
Protean Graphs
We propose a new random model of web graphs in which the degree of a vertex depends on its age. We characterize the degree sequence of this model and study its behaviour near the c...
Tomasz Luczak, Pawel Pralat
RSA
2010
108views more  RSA 2010»
13 years 5 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