@article{Fekete,
abstract = {In this Letter 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 re moving edges from the original network},
archivePrefix = {arXiv},
arxivId = {arXiv:0810.1428v2},
author = {Fekete, Attila and Vattay, Gabor and Posfai, Marton},
eprint = {arXiv:0810.1428v2},
file = {:home/ecem/Dropbox/mendeley\_sampling\_references/Fekete, Vattay, Posfai/Unknown\_Fekete, Vattay, Posfai\_Shortest path discovery of complex networks.pdf:pdf},
pages = {1--10},
title = {{Shortest path discovery of complex networks}}
}

{"_id":{"_str":"534211116d78590a06000062"},"__v":1,"authorIDs":[],"author_short":["Fekete, A.","Vattay, G.","Posfai, M."],"bibbaseid":"fekete-vattay-posfai-shortestpathdiscoveryofcomplexnetworks","bibdata":{"bibtype":"article","type":"article","abstract":"In this Letter 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 re moving edges from the original network","archiveprefix":"arXiv","arxivid":"arXiv:0810.1428v2","author":[{"propositions":[],"lastnames":["Fekete"],"firstnames":["Attila"],"suffixes":[]},{"propositions":[],"lastnames":["Vattay"],"firstnames":["Gabor"],"suffixes":[]},{"propositions":[],"lastnames":["Posfai"],"firstnames":["Marton"],"suffixes":[]}],"eprint":"arXiv:0810.1428v2","file":":home/ecem/Dropbox/mendeley_sampling_references/Fekete, Vattay, Posfai/Unknown_Fekete, Vattay, Posfai_Shortest path discovery of complex networks.pdf:pdf","pages":"1–10","title":"Shortest path discovery of complex networks","bibtex":"@article{Fekete,\nabstract = {In this Letter 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 re moving edges from the original network},\narchivePrefix = {arXiv},\narxivId = {arXiv:0810.1428v2},\nauthor = {Fekete, Attila and Vattay, Gabor and Posfai, Marton},\neprint = {arXiv:0810.1428v2},\nfile = {:home/ecem/Dropbox/mendeley\\_sampling\\_references/Fekete, Vattay, Posfai/Unknown\\_Fekete, Vattay, Posfai\\_Shortest path discovery of complex networks.pdf:pdf},\npages = {1--10},\ntitle = {{Shortest path discovery of complex networks}}\n}\n","author_short":["Fekete, A.","Vattay, G.","Posfai, M."],"key":"Fekete","id":"Fekete","bibbaseid":"fekete-vattay-posfai-shortestpathdiscoveryofcomplexnetworks","role":"author","urls":{},"downloads":0},"bibtype":"article","biburl":"http://www.utdallas.edu/~emrah.cem/Sampling.bib","downloads":0,"keywords":[],"search_terms":["shortest","path","discovery","complex","networks","fekete","vattay","posfai"],"title":"Shortest path discovery of complex networks","year":null,"dataSources":["NzvQMDNRQxZEm47er"]}