Show simple item record

Author
dc.contributor.author
Fekete, A 
Author
dc.contributor.author
Vattay, G 
Author
dc.contributor.author
Posfai, M 
Availability Date
dc.date.accessioned
2020-04-07T09:13:18Z
Availability Date
dc.date.available
2020-04-07T09:13:18Z
Release
dc.date.issued
2009
uri
dc.identifier.uri
http://hdl.handle.net/10831/43284
Abstract
dc.description.abstract
In this Rapid Communication we present an analytic study of sampled networks in the case of some important shortest-path sampling models. We present analytic formulas for the probability of edge discovery in the case of an evolving and a static network model. We also show that the number of discovered edges in a finite network scales much more slowly than predicted by earlier mean-field models. Finally, we calculate the degree distribution of sampled networks and we demonstrate that they are analogous to a destroyed network obtained by randomly removing edges from the original network.
Language
dc.language
Angol
Title
dc.title
Shortest path discovery of complex networks
Type
dc.type
folyóiratcikk
Date Change
dc.date.updated
2019-07-17T09:30:43Z
Doi ID
dc.identifier.doi
10.1103/PhysRevE.79.065101
Wos ID
dc.identifier.wos
000267698900001
ID Scopus
dc.identifier.scopus
67650099196
MTMT ID
dc.identifier.mtmt
1388944
Issue Number
dc.identifier.issue
6
abbreviated journal
dc.identifier.jabbrev
PHYS REV E STAT NONLIN
Journal
dc.identifier.jtitle
PHYSICAL REVIEW E - STATISTICAL, NONLINEAR AND SOFT MATTER PHYSICS (2001-2015)
Volume Number
dc.identifier.volume
79
Release Date
dc.description.issuedate
2009
Pubmed ID
dc.identifier.pubmed
19658546
department of Author
dc.contributor.institution
Fizika Doktori Iskola
department of Author
dc.contributor.institution
Komplex Rendszerek Fizikája Tanszék
Author institution
dc.contributor.department
Komplex Rendszerek Fizikája Tanszék
Author institution
dc.contributor.department
Komplex Rendszerek Fizikája Tanszék
Author institution
dc.contributor.department
Komplex Rendszerek Fizikája Tanszék


Files in this item

Shortest path discovery of complex networks
 

This item appears in the following Collection(s)

Show simple item record