A general model of web graphs

Authors:
Colin Cooper;Alan Frieze
Affiliations:
Department of Computer Science, King's College, University of London, London WC2R 2LS, United Kingdom;Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, Pennsylvania
Venue:
Random Structures & Algorithms
Year:
2003

Citing 10
Cited 42

The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Authoritative sources in a hyperlinked environment

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Small worlds: the dynamics of networks between order and randomness

Small worlds: the dynamics of networks between order and randomness
The Web as a graph

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Graph structure in the Web

Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
The degree sequence of a scale-free random graph process

Random Structures & Algorithms
Crawling on web graphs

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Stochastic models for the Web graph

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Distribution of Vertex Degree in Web-Graphs

Combinatorics, Probability and Computing

A General Model of Undirected Web Graphs

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Structural and algorithmic aspects of massive social networks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Adversarial deletion in a scale free random graph process

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The influence of search engines on preferential attachment

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Graphs over time: densification laws, shrinking diameters and possible explanations

Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Graph mining: Laws, generators, and algorithms

ACM Computing Surveys (CSUR)
Evolution of page popularity under random web graph models

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Dependent rounding and its applications to approximation algorithms

Journal of the ACM (JACM)
A stochastic model for the evolution of the Web allowing link deletion

ACM Transactions on Internet Technology (TOIT)
Distribution of Vertex Degree in Web-Graphs

Combinatorics, Probability and Computing
Graph evolution: Densification and shrinking diameters

ACM Transactions on Knowledge Discovery from Data (TKDD)
Preferential deletion in dynamic models of web-like networks

Information Processing Letters
The degree distribution of the generalized duplication model

Theoretical Computer Science
First to market is not everything: an analysis of preferential attachment with fitness

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The phase transition in inhomogeneous random graphs

Random Structures & Algorithms
Non-searchability of random scale-free graphs

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Quasi-random graphs with given degree sequences

Random Structures & Algorithms
PageRank and the random surfer model

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Simulation and Measurement of Complex Network Growth: the Interplay of Uniform and Preferential Attachment

Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Workshop on Algorithms and Models for the Web Graph

Algorithms and Models for the Web-Graph
Link privacy in social networks

Proceedings of the 17th ACM conference on Information and knowledge management
The degree distribution of random k-trees

Theoretical Computer Science
Affiliation networks

Proceedings of the forty-first annual ACM symposium on Theory of computing
Improved duplication models for proteome network evolution

RECOMB'05 Proceedings of the 2005 joint annual satellite conference on Systems biology and regulatory genomics
Not all scale free networks are Born equal: the role of the seed graph in PPI network emulation

RECOMB'06 Proceedings of the joint 2006 satellite conference on Systems biology and computational proteomics
A geometric preferential attachment model of networks II

WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Non-searchability of random power-law graphs

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Rank-Based Attachment Leads to Power Law Graphs

SIAM Journal on Discrete Mathematics
Random Walks with Look-Ahead in Scale-Free Random Graphs

SIAM Journal on Discrete Mathematics
Connectivity of Random Cubic Sum Graphs

SIAM Journal on Discrete Mathematics
The clustering coefficient of a scale-free random graph

Discrete Applied Mathematics
Construction of scale-free networks with partial information

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A survey of models of the web graph

CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
A fast algorithm to find all high degree vertices in power law graphs

Proceedings of the 21st international conference companion on World Wide Web
Random hyperbolic graphs: degree sequence and clustering

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Simulation and Measurement of Complex Network Growth: the Interplay of Uniform and Preferential Attachment

Fundamenta Informaticae - Workshop on Combinatorial Algorithms
On certain properties of random apollonian networks

WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
A fast algorithm to find all high degree vertices in graphs with a power law degree sequence

WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
Impact of dynamic growing on the internet degree distribution

ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
A random model of publication activity

Discrete Applied Mathematics
Category-based routing in social networks: Membership dimension and the small-world phenomenon

Theoretical Computer Science
Approximability of the vertex cover problem in power-law graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a very general model of a random graph process whose proportional degree sequence obeys a power law. Such laws have recently been observed in graphs associated with the world wide web.