Sciweavers

750 search results - page 3 / 150
» Reconstruction for Models on Random Graphs
Sort
View
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
13 years 8 months ago
On properties of random dissections and triangulations
In the past decades the Gn,p model of random graphs, introduced by Erdos and R
Nicla Bernasconi, Konstantinos Panagiotou, Angelik...
RSA
2006
98views more  RSA 2006»
13 years 7 months ago
Levels of a scale-free tree
Consider the random graph model of Barab
Zsolt Katona
FOCS
2008
IEEE
14 years 1 months ago
Noise Tolerance of Expanders and Sublinear Expander Reconstruction
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
Satyen Kale, Yuval Peres, C. Seshadhri
STOC
2000
ACM
112views Algorithms» more  STOC 2000»
13 years 11 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
COMBINATORICS
2006
131views more  COMBINATORICS 2006»
13 years 7 months ago
Encores on Cores
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...
Julie Cain, Nicholas C. Wormald