See this document in CiteSeerX!

A Random Graph Model for Massive Graphs  (Make Corrections)  (104 citations)
William Aiello, Fan Chung, Linyuan Lu



  Home/Search   Context   Related

 
View or download:
ucsd.edu/~llu/papers/random.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ucsd.edu/~llu/mycv (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: 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 and log-log growth rate. These parameters capture some universal characteristics of massive graphs. Furthermore, from these parameters, various properties of the graph can be derived. For example, for certain ranges of the parameters, we will compute the expected distribution of the sizes of the connected components... (Update)

Cited by:   More
An Empirical Study of Routing Bias in Variable-Degree Networks - Shudong Jin Department   (Correct)
Unknown - Scalable Delivery Of   (Correct)
Small-World Characteristics of the Internet and Multicast.. - Shudong Jin Boston   (Correct)

Similar documents (at the sentence level):
58.4%:   A Random Graph Model for Power Law Graphs - Aiello, Chung, Lu (2000)   (Correct)
36.6%:   A Random Graph Model for Massive Graphs - Aiello, Chung, Lu   (Correct)

Active bibliography (related documents):   More   All
0.5:   Random Evolution in Massive Graphs - Aiello, Chung, Lu (2001)   (Correct)
0.3:   The Diameter of Random Massive Graphs - Lu (2000)   (Correct)
0.2:   The Structure and Function of Complex Networks - Newman (2003)   (Correct)

System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text:   More   All
0.5:   Random Evolution In Massive Graphs - Aiello, Chung, Lu (2001)   (Correct)
0.4:   (3) A random graph model for massive graphs - Many Graphstap Arise   (Correct)
0.3:   An upper bound for the Turán number t_3(n, 4) - Chung, Lu (1998)   (Correct)

Related documents from co-citation:   More   All
71:   On power-law relationships of the internet topology - Michalis, Petros - 1999
50:   Emergence of Scaling in Random Networks (context) - aszl, Barab et al. - 1999
28:   Graph structure in the Web (context) - Broder, Kumar et al. - 2000

BibTeX entry:   (Update)

W. Aiello, F. Chung Graham, and L. Lu. A Random Graph Model for Massive Graphs. http://math.ucsd.edu/~fan/random.ps http://citeseer.ist.psu.edu/599912.html   More

@inproceedings{ aiello00random,
    author = "William Aiello and Fan Chung and Linyuan Lu",
    title = "A random graph model for massive graphs",
    pages = "171--180",
    year = "2000",
    url = "citeseer.ist.psu.edu/599912.html" }
Citations (may not include all citations):
375   On powerlaw relationships of the internet topology - Faloutsos, Faloutsos et al. - 1999
132   the evolution of random graphs (context) - Erdos, Renyi - 1960
126   Diameter of the World Wide Web (context) - Albert, Jeong et al. - 1999
106   Trawling the web for emerging cyber communities - Kumar, Raphavan et al. - 1999
72   The web as a graph: Measurements (context) - Kleinberg, Kumar et al. - 1999
62   Extracting large-scale knowledge bases from the web - Kumar, Raghavan et al. - 1999
35   Models of random regular graphs (context) - Wormald - 1999
33   A functional approach to external graph algorithms - Abello, Buchsbaum et al. - 1998
30   Wiley and Sons (context) - Alon, Spencer et al. - 1992
30   A critical point for random graphs with a given degree seque.. - Molloy, Reed - 1995
18   The size of the giant component of a random graph with a giv.. - Molloy, Reed - 1998
17   the strength of connectedness of random graphs (context) - Erdos, Renyi - 1961
8   Sparse random graphs with a given degree sequence (context) - Luczak - 1989
8   personal communication (context) - Raghavan
4   Jeong Scale-free characteristics of random networks: the top.. (context) - Barabasi, Albert - 1999
4   Random evolution of power law graphs (context) - Aiello, Chung et al.
2   The asymptotic connectivity of labeled regular graphs (context) - Wormald - 1981
1   This data was compiled by J (context) - Barabasi, Albert et al. - 1999



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://math.ucsd.edu/~llu/mycv.html):   More
A Random Graph Model for Massive Graphs - Aiello, Chung, Lu (2000)   (Correct)
The Diameter of Random Massive Graphs - Lu (2000)   (Correct)
Guessing Secrets with Inner Product Questions - Chung, Graham, Lu (2002)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC