Sciweavers

JCT
2007
108views more  JCT 2007»
13 years 9 months ago
The cover time of the preferential attachment graph
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...
Colin Cooper, Alan M. Frieze
WWW
2008
ACM
14 years 10 months ago
Measuring extremal dependencies in web graphs
We analyze dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical inference for multivariate regular variation. ...
Yana Volkovich, Nelly Litvak, Bert Zwart