{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T11:45:48Z","timestamp":1753875948835,"version":"3.41.2"},"reference-count":26,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2019,9,30]],"date-time":"2019-09-30T00:00:00Z","timestamp":1569801600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"Promotion of Advanced Research"},{"name":"IFCPAR\/CEFIPRA"},{"name":"Machine Learning for Network Analytics","award":["IFC\/DST-Inria-2016-01\/448"],"award-info":[{"award-number":["IFC\/DST-Inria-2016-01\/448"]}]},{"name":"Bharti Centre for Communication at IIT Bombay"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,10,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The Jordan centre of a graph is defined as a vertex whose maximum distance to other nodes in the graph is minimal, and it finds applications in facility location and source detection problems. We study properties of the Jordan centre in the case of random growing trees. In particular, we consider a regular tree graph on which an infection starts from a root node and then spreads along the edges of the graph according to various random spread models. For the Independent Cascade (IC) model and the discrete Susceptible Infected (SI) model, both of which are discrete-time models, we show that as the infected subgraph grows with time, the Jordan centre persists on a single vertex after a finite number of timesteps. As a corollary of our results, we also establish that the distance between the Jordan centre and the infection source (root node) is finite. Finally, we also study the continuous-time version of the SI model and bound the maximum distance between the Jordan centre and the root node at any time.<\/jats:p>","DOI":"10.1093\/comnet\/cnz035","type":"journal-article","created":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T19:28:12Z","timestamp":1567625292000},"source":"Crossref","is-referenced-by-count":0,"title":["Jordan centre in random trees: persistence and distance to root"],"prefix":"10.1093","volume":"8","author":[{"given":"Sarath","family":"Pattathil","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA"}]},{"given":"Nikhil","family":"Karamchandani","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Indian Institute of Technology, Bombay, Mumbai, India"}]},{"given":"Dhruti","family":"Shah","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Indian Institute of Technology, Bombay, Mumbai, India"}]}],"member":"286","published-online":{"date-parts":[[2019,9,30]]},"reference":[{"key":"2020100912542533000_B1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.socnet.2004.11.008","article-title":"Centrality and network flow","volume":"27","author":"Borgatti","year":"2005","journal-title":"Soc. Netw."},{"key":"2020100912542533000_B2","doi-asserted-by":"crossref","DOI":"10.1515\/9781400833993","author":"Jackson","year":"2008","journal-title":"Social and Economic Networks."},{"key":"2020100912542533000_B3","first-page":"20","article-title":"Bridging centrality: identifying bridging nodes in scale-free networks","author":"Hwang","year":"2006","journal-title":"ACM SIGKDD International Conference on Knowledge Discovery and Data Mining."},{"key":"2020100912542533000_B4","first-page":"145","article-title":"Optimal detection of influential spreaders in online social networks","author":"Tan","year":"2016","journal-title":"Annual Conference on Information Science and Systems (CISS), Princeton, NJ, USA, 16-18 March"},{"key":"2020100912542533000_B5","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1002\/rsa.20649","article-title":"Finding Adam in random growing trees","volume":"50","author":"Bubeck","year":"2017","journal-title":"Random Struct. Algorithms"},{"key":"2020100912542533000_B6","first-page":"153","article-title":"Rumor source obfuscation on irregular trees","author":"Fanti","year":"2016","journal-title":"ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, Antibes Juan-Les-Pins, France, 14-18 June"},{"key":"2020100912542533000_B7","doi-asserted-by":"crossref","first-page":"5163","DOI":"10.1109\/TIT.2011.2158885","article-title":"Rumors in a network: who\u2019s the culprit","volume":"57","author":"Shah","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2020100912542533000_B8","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1109\/TNET.2014.2364972","article-title":"Information source detection in the SIR model: a sample-path-based approach","volume":"24","author":"Zhu","year":"2016","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"2020100912542533000_B9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/trsc.7.3.287","article-title":"Minimax location of a facility in an undirected tree graph","volume":"7","author":"Handler","year":"1973","journal-title":"Transp. Sci."},{"key":"2020100912542533000_B10","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/trsc.15.2.98","article-title":"Linear algorithms for finding the Jordan center and path center of a tree","volume":"15","author":"Hedetniemi","year":"1981","journal-title":"Transp. Sci."},{"key":"2020100912542533000_B11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.6028\/jres.079B.011","article-title":"Maximin facility location","volume":"79","author":"Slater","year":"1975","journal-title":"J. Natl. Bureau Stand. B"},{"key":"2020100912542533000_B12","first-page":"59","article-title":"Existence of a persistent hub in the convex preferential attachment model","volume":"36","author":"Galashin","year":"2016","journal-title":"Probab. Math. Stat."},{"key":"2020100912542533000_B13","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barabasi","year":"1999","journal-title":"Science"},{"key":"2020100912542533000_B14","doi-asserted-by":"crossref","DOI":"10.1002\/rsa.20726","article-title":"Persistence of centrality in random growing trees","author":"Jog","year":"2018","journal-title":"Random Struct. Algorithms"},{"key":"2020100912542533000_B15","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0012-365X(78)90098-5","article-title":"Another characterization of the centroid of a tree","volume":"24","author":"Mitchell","year":"1978","journal-title":"Discrete Math."},{"key":"2020100912542533000_B16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TNSE.2016.2622923","article-title":"Analysis of centrality in sublinear preferential attachment trees via the Crump-Mode-Jagers branching process","volume":"4","author":"Jog","year":"2017","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"2020100912542533000_B17","first-page":"1","article-title":"Information source detection in networks: possibility and impossibility results","author":"Zhu","year":"2016","journal-title":"35th Annual IEEE International Conference on Computer Communications (INFOCOM), San Francisco, CA, USA, 10-14 April"},{"key":"2020100912542533000_B18","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/TNSE.2016.2627502","article-title":"Confidence sets for the source of a diffusion in regular trees","volume":"4","author":"Khim","year":"2017","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"2020100912542533000_B19","article-title":"Persistence of the Jordan center in Random Growing Trees","author":"Pattathil","year":"2018","journal-title":"IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)."},{"article-title":"Introductory lectures on stochastic population systems","year":"2010","author":"Dawson","key":"2020100912542533000_B20"},{"key":"2020100912542533000_B21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511629136","author":"Haccou","year":"2005","journal-title":"Branching Processes: Variation, Growth, and Extinction of Populations"},{"key":"2020100912542533000_B22","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1214\/aoap\/1177004832","article-title":"Minimal positions in a branching random walk","volume":"5","author":"McDiarmid","year":"1995","journal-title":"Ann. Appl. Probab."},{"key":"2020100912542533000_B23","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks,","volume":"286","author":"Barab\u00e1si","year":"1999","journal-title":"Science"},{"key":"2020100912542533000_B24","article-title":"Locating contagion sources in networks with partial timestamps","author":"Zhu","year":"2014","journal-title":"CoRR"},{"key":"2020100912542533000_B25","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u2018small-world\u2019 networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"},{"key":"2020100912542533000_B26","doi-asserted-by":"publisher","DOI":"10.1140\/epjds5","article-title":"Social dynamics of Digg","author":"Hogg","year":"2012","journal-title":"EPJ Data Science"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/8\/4\/cnz035\/33858511\/cnz035.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/8\/4\/cnz035\/33858511\/cnz035.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,9]],"date-time":"2020-10-09T16:54:43Z","timestamp":1602262483000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnz035\/5578435"}},"subtitle":[],"editor":[{"given":"Desmond","family":"Higham","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2019,9,30]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,10,9]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnz035","relation":{},"ISSN":["2051-1329"],"issn-type":[{"type":"electronic","value":"2051-1329"}],"subject":[],"published-other":{"date-parts":[[2020,8]]},"published":{"date-parts":[[2019,9,30]]},"article-number":"cnz035"}}