{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T10:42:57Z","timestamp":1730198577441,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/asonam.2018.8508755","type":"proceedings-article","created":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T23:19:29Z","timestamp":1540509569000},"page":"25-32","source":"Crossref","is-referenced-by-count":0,"title":["Persistence of the Jordan Center in Random Growing Trees"],"prefix":"10.1109","author":[{"given":"Sarath","family":"Pattathil","sequence":"first","affiliation":[]},{"given":"Nikhil","family":"Karamchandani","sequence":"additional","affiliation":[]},{"given":"Dhruti","family":"Shah","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"20","article-title":"Bridging centrality: identifying bridging nodes in scale-free networks","author":"woochang","year":"2006","journal-title":"Acm Sigkdd Intl Conf on Knowledge Discovery and Data Mining"},{"journal-title":"Social and Economic Networks","year":"2010","author":"matthew o","key":"ref11"},{"key":"ref12","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":"varun","year":"2017","journal-title":"IEEE Transactions on Network Science and Engineering"},{"key":"ref13","article-title":"Persistence of centrality in random growing trees","author":"varun","year":"2018","journal-title":"Random Structures & Algorithms"},{"key":"ref14","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":"justin","year":"2017","journal-title":"IEEE Transactions on Network Science and Engineering"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90098-5"},{"journal-title":"Persis-tence of the Jordan center in Random Growing Trees","year":"2017","author":"sarath","key":"ref16"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"5163","DOI":"10.1109\/TIT.2011.2158885","article-title":"Rumors in a network: Who's the culprit?","volume":"57","author":"devavrat","year":"2011","journal-title":"IEEE Trans on Information Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.6028\/jres.079B.011"},{"key":"ref19","first-page":"145","article-title":"Optimal detection of influential spreaders in online social networks","author":"chee wei","year":"2016","journal-title":"Conf Inform Sci Syst (CISS)"},{"journal-title":"Introductory lectures on stochastic population systems","year":"2017","author":"dawson","key":"ref4"},{"key":"ref3","first-page":"158","article-title":"Finding Adam in random growing trees. Random Structures and Algorithms","volume":"50 2","author":"sebastien","year":"2017","journal-title":"Random Structures & Algorithms"},{"key":"ref6","first-page":"59","article-title":"Existence of a persistent hub in the convex preferential attachment model","author":"pavel","year":"2016","journal-title":"Probability and Mathematical Statistics"},{"key":"ref5","first-page":"153","article-title":"Rumor source obfuscation on irregular trees","author":"giulia","year":"2016","journal-title":"ACM SIGMETRICS Intl Conf on Measurement and Modeling of Computer Science"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.7.3.287"},{"journal-title":"Branching Processes Variation Growth and Extinction of Populations","year":"2005","author":"patsy","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.11.008"},{"key":"ref1","first-page":"509","article-title":"Emergence of scaling in random networks","volume":"286 5439","author":"albert-laszlo","year":"1999","journal-title":"Science"},{"key":"ref9","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":"mitchell","year":"1981","journal-title":"Transportation Science"},{"key":"ref20","first-page":"408","article-title":"Information source detection in the SIR model: A sample-path-based approach","volume":"24 1","author":"kai","year":"2016","journal-title":"IEEE\/ACM Trans on Networking"},{"key":"ref21","first-page":"1","article-title":"Information source detection in networks: Possibility and impossibility results","author":"kai","year":"2016","journal-title":"Annual IEEE Intl Conf on Computer Communications (INFOCOM)"}],"event":{"name":"2018 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","start":{"date-parts":[[2018,8,28]]},"location":"Barcelona","end":{"date-parts":[[2018,8,31]]}},"container-title":["2018 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8488381\/8508239\/08508755.pdf?arnumber=8508755","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T20:59:05Z","timestamp":1643230745000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8508755\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/asonam.2018.8508755","relation":{},"subject":[],"published":{"date-parts":[[2018,8]]}}}