Random evolution in massive graphs
- 1 January 2001
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15525244,p. 510-519
- https://doi.org/10.1109/sfcs.2001.959927
Abstract
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by the so-called "power law." In this paper, we, examine three important aspects of power law graphs, (1) the evolution of power law graphs, (2) the asymmetry of in-degrees and out-degrees, (3) the "scale invariance" of power law graphs. In particular, we give three increasingly general directed graph models and one general undirected graph model for generating power law graphs by adding at most one node and possibly one or more edges at a time. We show that for any given edge density and desired power laws for in-degrees and out-degrees, not necessarily the same, the resulting graph will almost surely have the desired edge density and the power laws for the in-degrees and out-degrees. Our most general directed and undirected models include nearly all known power law evolution models as special cases. Finally, we show that our evolution models generate "scale invariant" graphs. We describe a method for scaling the time in our evolution model such that the power law of the degree sequences remains invariant.Keywords
This publication has 20 references indexed in Scilit:
- A general model of web graphsRandom Structures & Algorithms, 2003
- Connected Components in Random Graphs with Given Expected Degree SequencesAnnals of Combinatorics, 2002
- Random graphs with arbitrary degree distributions and their applicationsPhysical Review E, 2001
- The degree sequence of a scale‐free random graph processRandom Structures & Algorithms, 2001
- Graph structure in the WebComputer Networks, 2000
- Mean-field theory for scale-free random networksPhysica A: Statistical Mechanics and its Applications, 1999
- On power-law relationships of the Internet topologyACM SIGCOMM Computer Communication Review, 1999
- The Size of the Giant Component of a Random Graph with a Given Degree SequenceCombinatorics, Probability and Computing, 1998
- A critical point for random graphs with a given degree sequenceRandom Structures & Algorithms, 1995
- On the strength of connectedness of a random graphActa Mathematica Hungarica, 1964