Sciweavers

50 search results - page 2 / 10
» The Diameter of a Scale-Free Random Graph
Sort
View
INFOCOM
2008
IEEE
13 years 11 months ago
Modeling the Evolution of Degree Correlation in Scale-Free Topology Generators
—In this paper, we examine the asymptotic behavior of degree correlation (i.e., the joint degree distribution of adjacent nodes) in several scale-free topology generators GED [13...
Xiaoming Wang, Xiliang Liu, Dmitri Loguinov
COCOON
2005
Springer
13 years 10 months ago
Construction of Scale-Free Networks with Partial Information
It has recently been observed that the node degrees of many real-world large-scale networks, such as the Internet and the Web, follow a power law distributions. Since the classical...
Jianyang Zeng, Wen-Jing Hsu, Suiping Zhou
IM
2007
13 years 5 months ago
PageRank of Scale-Free Growing Networks
PageRank is one of the principle criteria according to which Google ranks Web pages. PageRank can be interpreted as a frequency of Web page visits by a random surfer and thus it r...
Konstantin Avrachenkov, Dmitri Lebedev
ACSAC
2007
IEEE
13 years 11 months ago
A Taxonomy of Botnet Structures
We propose a taxonomy of botnet structures, based on their utility to the botmaster. We propose key metrics to measure their utility for various activities (e.g., spam, ddos). Usi...
David Dagon, Guofei Gu, Christopher P. Lee, Wenke ...
SODA
2001
ACM
138views Algorithms» more  SODA 2001»
13 years 6 months ago
The diameter of random massive graphs
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...
Linyuan Lu