{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:49Z","timestamp":1750308709499,"version":"3.41.0"},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2012,1,4]],"date-time":"2012-01-04T00:00:00Z","timestamp":1325635200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2012,12,4]]},"abstract":"<jats:p>We consider an edge-weighted uniform random graph with a given degree sequence (Repeated Configuration Model) which is a useful approximation for many real-world networks. It has been observed that the vertices which are separated from the rest of the graph by a distance exceeding certain threshold play an important role in determining some global properties of the graph like diameter, ooding time etc., in spite of being statistically rare. We give a convergence result for the distribution of the number of such far-out vertices. We also make a conjecture about how this relates to the longest edge of the minimal spanning tree on the graph under consideration.<\/jats:p>","DOI":"10.1145\/2425248.2425276","type":"journal-article","created":{"date-parts":[[2013,1,8]],"date-time":"2013-01-08T15:34:16Z","timestamp":1357659256000},"page":"100-103","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Farout vertices in weighted repeated configuration model"],"prefix":"10.1145","volume":"40","author":[{"given":"B.","family":"B\u0142aszczyszyn","sequence":"first","affiliation":[{"name":"INRIA\/ENS, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Gaurav","sequence":"additional","affiliation":[{"name":"UPMC\/INRIA\/ENS, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,1,4]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"B laszczyszyn and D. Yogeshwaran. Clustering, percolation and directionally convex ordering of point processes. arXiv:1105.4293v1","author":"B.","year":"2011","unstructured":"B. B laszczyszyn and D. Yogeshwaran. Clustering, percolation and directionally convex ordering of point processes. arXiv:1105.4293v1 , 2011 . B. B laszczyszyn and D. Yogeshwaran. Clustering, percolation and directionally convex ordering of point processes. arXiv:1105.4293v1, 2011."},{"key":"e_1_2_1_2_1","series-title":"London Mathematical Society Lecture Notes","volume-title":"Epidemics and Rumors in Complex Networks","author":"Draief M.","year":"2010","unstructured":"M. Draief and L. Massoulie . Epidemics and Rumors in Complex Networks , volume 369 of London Mathematical Society Lecture Notes . Cambridge University Press , 2010 . M. Draief and L. Massoulie. Epidemics and Rumors in Complex Networks, volume 369 of London Mathematical Society Lecture Notes. Cambridge University Press, 2010."},{"key":"e_1_2_1_3_1","volume-title":"The diameter of weighted random graphs. arXiv:1112.6330v1","author":"Lelarge M.","year":"2011","unstructured":"M. Lelarge and H. Amini . The diameter of weighted random graphs. arXiv:1112.6330v1 , 2011 . M. Lelarge and H. Amini. The diameter of weighted random graphs. arXiv:1112.6330v1, 2011."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1034625335"},{"key":"e_1_2_1_5_1","volume-title":"Random graphs and complex networks","author":"van der Hofstad R.","year":"2009","unstructured":"R. van der Hofstad . Random graphs and complex networks . 2009 . available at http:\/\/www.win.tue.nl\/rhofstad\/RGCN.html. R. van der Hofstad. Random graphs and complex networks. 2009. available at http:\/\/www.win.tue.nl\/rhofstad\/RGCN.html."}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2425248.2425276","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2425248.2425276","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:09Z","timestamp":1750277649000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2425248.2425276"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,4]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,12,4]]}},"alternative-id":["10.1145\/2425248.2425276"],"URL":"https:\/\/doi.org\/10.1145\/2425248.2425276","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2012,1,4]]},"assertion":[{"value":"2012-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}