183 search results - page 17 / 37 » The Degree Distribution of Random k-Trees |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
SIGMETRICS
2003
ACM
14 years 1 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
TVCG
2012
11 years 11 months ago
2012
—In this paper, we study the sensitivity of centrality metrics as a key metric of social networks to support visual reasoning. As centrality represents the prestige or importance...
CAAN
2004
Springer
14 years 2 months ago
2004
Springer
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
SIGCOMM
2006
ACM
14 years 2 months ago
2006
ACM
A pervasive requirement of distributed systems is to deal with churn — change in the set of participating nodes due to joins, graceful leaves, and failures. A high churn rate ca...