{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T23:32:18Z","timestamp":1772580738923,"version":"3.50.1"},"reference-count":15,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2009,2,2]],"date-time":"2009-02-02T00:00:00Z","timestamp":1233532800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct Algorithms"],"published-print":{"date-parts":[[2009,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider in this article the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A subset of nodes is selected according to some criterion. As a measure of efficiency of the algorithm, the Steiner distance of the selected nodes, i.e. the size of the spanning subtree of these nodes, is investigated. For the selection of nodes, two criteria are considered: a node is randomly selected with a probability, which is either independent of the depth of the node (uniform model) or else in the depth biased model, is exponentially decaying with respect to its depth. The limiting behavior the size of the discovered subtree is investigated for both models. \u00a9 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009<\/jats:p>","DOI":"10.1002\/rsa.20263","type":"journal-article","created":{"date-parts":[[2009,2,2]],"date-time":"2009-02-02T15:05:52Z","timestamp":1233587152000},"page":"194-215","source":"Crossref","is-referenced-by-count":1,"title":["Analysis of Steiner subtrees of random trees for traceroute algorithms"],"prefix":"10.1002","volume":"35","author":[{"given":"Fabrice","family":"Guillemin","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Robert","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2009,2,2]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Branching processes, Die Grundlehren der mathematischen Wissenschaften, Band 196","author":"Athreya K. B.","year":"1972"},{"key":"e_1_2_1_3_2","volume-title":"A stochastic model for topology discovery of tree networks, Proceedings of ITC'19","author":"Azzana Y.","year":"2005"},{"key":"e_1_2_1_4_2","unstructured":"Caida Skitter project url:http:\/\/www.caida.org\/tools\/measurement\/skitter."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1214\/105051605000000106"},{"key":"e_1_2_1_6_2","unstructured":"L.Dall'Astra I.Alvarez\u2010Hameli A.Barrat A.V\u00e1squez andA.Vespignani A statistical approach to the traceroute exploration of networks: Theory and simulations Available at arXiv:cond\u2010mat\/0406404 June2004."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00002-E"},{"key":"e_1_2_1_8_2","author":"Lyons R.","year":"2005","journal-title":"Probability on trees and networks"},{"key":"e_1_2_1_9_2","volume-title":"Wiley\u2010Interscience series in discrete mathematics and optimization: Evolution of random search trees","author":"Mahmoud H. M.","year":"1992"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1042765668"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1214\/105051605000000494"},{"key":"e_1_2_1_12_2","first-page":"199","article-title":"Arbres et processus de Galton\u2010Watson","volume":"22","author":"Neveu J.","year":"1986","journal-title":"Annales de l'institut Henri Poincar\u00e9, S\u00e9rie B"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548304006212"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1214\/105051604000000071"},{"key":"e_1_2_1_15_2","unstructured":"Dimes project url:http:\/\/www.netdimes.org\/."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20075"}],"container-title":["Random Structures &amp; Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.20263","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rsa.20263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T15:10:23Z","timestamp":1697555423000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/rsa.20263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,2]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["10.1002\/rsa.20263"],"URL":"https:\/\/doi.org\/10.1002\/rsa.20263","archive":["Portico"],"relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,2]]}}}