STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Conductance and congestion in power law graphs
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scaling properties of the Internet graph
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Origin authentication in interdomain routing
Proceedings of the 10th ACM conference on Computer and communications security
On the emergence of highly variable distributions in the autonomous system topology
ACM SIGCOMM Computer Communication Review
Web Communities: Models and Algorithms
World Wide Web
Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
On the scaling of congestion in the internet graph
ACM SIGCOMM Computer Communication Review
Adversarial deletion in a scale free random graph process
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Formation of cooperation structure by interaction network in directed multi-agent
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Graph mining: Laws, generators, and algorithms
ACM Computing Surveys (CSUR)
Scalable percolation search on complex networks
Theoretical Computer Science - Complex networks
On the communication complexity of randomized broadcasting in random-like graphs
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Origin authentication in interdomain routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Adversarial Deletion in a Scale-Free Random Graph Process
Combinatorics, Probability and Computing
The degree distribution of the generalized duplication model
Theoretical Computer Science
A geographic directed preferential internet topology model
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient heuristics for message dissemination in networks
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Modelling and simulation of the web graph: evaluating an exponential growth copying model
International Journal of Web Engineering and Technology
The degree distribution of random k-trees
Theoretical Computer Science
Proceedings of the forty-first annual ACM symposium on Theory of computing
Discovering clues for review quality from author's behaviors on e-commerce sites
Proceedings of the 11th International Conference on Electronic Commerce
Improved duplication models for proteome network evolution
RECOMB'05 Proceedings of the 2005 joint annual satellite conference on Systems biology and regulatory genomics
A geometric preferential attachment model of networks II
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
A lightweight privacy preserving SMS-based recommendation system for mobile users
Proceedings of the fourth ACM conference on Recommender systems
Milgram-routing in social networks
Proceedings of the 20th international conference on World wide web
Bounded arboricity to determine the local structure of sparse graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Stability and similarity of link analysis ranking algorithms
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Toward the eigenvalue power law
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On randomized broadcasting in power law networks
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Random hyperbolic graphs: degree sequence and clustering
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
The configuration of networked publics on the web: evidence from the Greek Indignados movement
Proceedings of the 3rd Annual ACM Web Science Conference
Linear algorithm for broadcasting in unicyclic graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Evolving friend lists in social networks
Proceedings of the 7th ACM conference on Recommender systems
Hi-index | 0.00 |
Many massive graphs (such as theWWW 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 will 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-degreesand 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.