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
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Random Structures & Algorithms
Stochastic models for the Web graph
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The Diameter of a Scale-Free Random Graph
Combinatorica
Random Structures & Algorithms
Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
A spatial web graph model with local influence regions
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Random Walks with Look-Ahead in Scale-Free Random Graphs
SIAM Journal on Discrete Mathematics
A fast algorithm to find all high degree vertices in power law graphs
Proceedings of the 21st international conference companion on World Wide Web
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
| Hi-index | 0.00 |
We give results for the age-dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process introduced in [8]. For such processes we show that as $k \rightarrow \infty$, the expected proportion of vertices of degree $k$ has power law parameter $1+1/\eta$ where $\eta$ is the limiting ratio of the expected number of edge endpoints inserted by preferential attachment to the expected total degree. The proof for the undirected process generalizes naturally to give similar results for the directed hub-authority process, and an undirected hypergraph process.