Volume 89, Number 1, January 2010
|Number of page(s)||5|
|Section||Interdisciplinary Physics and Related Areas of Science and Technology|
|Published online||22 January 2010|
Shortest-path sampling of dense homogeneous networks
Eötvös University, Department
of Physics of Complex Systems - H-1117 Budapest, Pázmány P.
sétány 1/A, Hungary, EU
Corresponding author: firstname.lastname@example.org
Accepted: 17 December 2009
The study of complex networks is usually based on samples of the network. We analyze edge and node samples of dense homogeneous networks, obtained by shortest-path exploration of the network between a set of agents, distributed uniformly among the nodes. We characterize the density of the network by a novel metric based on the scaling of the average degree with the size of the network and present the edge and node sampling probability as a function of the agent density for the densest network scenarios.
PACS: 89.75.Fb – Structures and organization in complex systems / 89.20.Hh – World Wide Web, Internet
© EPLA, 2010
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.