Shortest-path sampling of dense homogeneous networks

M. Pósfai, A. Fekete, G. Vattay

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Article number18007
JournalEPL
Volume89
Issue number1
DOIs
Publication statusPublished - 2010

Fingerprint

sampling
scaling

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Cite this

Shortest-path sampling of dense homogeneous networks. / Pósfai, M.; Fekete, A.; Vattay, G.

In: EPL, Vol. 89, No. 1, 18007, 2010.

Research output: Contribution to journalArticle

Pósfai, M. ; Fekete, A. ; Vattay, G. / Shortest-path sampling of dense homogeneous networks. In: EPL. 2010 ; Vol. 89, No. 1.
@article{aa06b8c2a2c249f68920f9f9aede3fbd,
title = "Shortest-path sampling of dense homogeneous networks",
abstract = "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.",
author = "M. P{\'o}sfai and A. Fekete and G. Vattay",
year = "2010",
doi = "10.1209/0295-5075/89/18007",
language = "English",
volume = "89",
journal = "Europhysics Letters",
issn = "0295-5075",
publisher = "IOP Publishing Ltd.",
number = "1",

}

TY - JOUR

T1 - Shortest-path sampling of dense homogeneous networks

AU - Pósfai, M.

AU - Fekete, A.

AU - Vattay, G.

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79051471152&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79051471152&partnerID=8YFLogxK

U2 - 10.1209/0295-5075/89/18007

DO - 10.1209/0295-5075/89/18007

M3 - Article

VL - 89

JO - Europhysics Letters

JF - Europhysics Letters

SN - 0295-5075

IS - 1

M1 - 18007

ER -