{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T09:36:31Z","timestamp":1720344991097},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"name":"Indo-French, India","award":["IFC\/DST-Inria-2016-01\/448"]},{"name":"DST INSPIRE Faculty Fellowship from the Govt. of India"},{"name":"GCOE and IBM OPRF, IIT Bombay, India"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Performance Evaluation"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1016\/j.peva.2019.03.002","type":"journal-article","created":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T14:46:19Z","timestamp":1554389179000},"page":"1-20","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Stochastic approximation algorithms for rumor source inference on graphs"],"prefix":"10.1016","volume":"132","author":[{"given":"Anand","family":"Kalvit","sequence":"first","affiliation":[]},{"given":"Vivek S.","family":"Borkar","sequence":"additional","affiliation":[]},{"given":"Nikhil","family":"Karamchandani","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.peva.2019.03.002_b1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/1811099.1811063","article-title":"Detecting sources of computer viruses in networks: theory and experiment","volume":"38","author":"Shah","year":"2010","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"10.1016\/j.peva.2019.03.002_b2","series-title":"Social Network Analysis: Methods and Applications, Vol. 8","first-page":"185","author":"Wasserman","year":"1994"},{"key":"10.1016\/j.peva.2019.03.002_b3","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2011.2158885","article-title":"Rumors in a network: who\u2019s the culprit?","author":"Shah","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.peva.2019.03.002_b4","series-title":"Finding Rumor Sources on Random Graphs","author":"Shah","year":"2012"},{"issue":"1","key":"10.1016\/j.peva.2019.03.002_b5","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1145\/2318857.2254782","article-title":"Rumor centrality: a universal source detector","volume":"40","author":"Shah","year":"2012","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"10.1016\/j.peva.2019.03.002_b6","unstructured":"K. Zhu, L. Ying, Source localization in networks: Trees and beyond, arXiv preprint arXiv:1510.01814, 2015."},{"issue":"1","key":"10.1016\/j.peva.2019.03.002_b7","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":"10.1016\/j.peva.2019.03.002_b8","series-title":"Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on","article-title":"Rumor source detection under probabilistic sampling","author":"Karamchandani","year":"2013"},{"issue":"4","key":"10.1016\/j.peva.2019.03.002_b9","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1109\/JSTSP.2014.2315533","article-title":"How to identify an infection source with limited observations","volume":"8","author":"Luo","year":"2014","journal-title":"IEEE J. Sel. Top. Sign. Proces."},{"issue":"4","key":"10.1016\/j.peva.2019.03.002_b10","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1109\/JSTSP.2015.2389191","article-title":"Rooting our rumor sources in online social networks: The value of diversity from multiple observations","volume":"9","author":"Wang","year":"2015","journal-title":"IEEE J. Sel. Top. Sign. Proces."},{"key":"10.1016\/j.peva.2019.03.002_b11","series-title":"Big Data in Complex and Social Networks","first-page":"163","article-title":"Rumor spreading and detection in online social networks","author":"Wu","year":"2016"},{"key":"10.1016\/j.peva.2019.03.002_b12","doi-asserted-by":"crossref","DOI":"10.1109\/TSIPN.2017.2668141","article-title":"Temporally agnostic rumor source detection","author":"Kumar","year":"2017","journal-title":"IEEE Trans. Signal Inf. Process. Netw."},{"key":"10.1016\/j.peva.2019.03.002_b13","doi-asserted-by":"crossref","DOI":"10.1109\/JSTSP.2018.2844813","article-title":"Averting cascading failures in networked infrastructures: poset-constrained graph algorithms","author":"Yu","year":"2018","journal-title":"IEEE J. Sel. Top. Sign. Proces."},{"key":"10.1016\/j.peva.2019.03.002_b14","series-title":"Information Sciences and Systems (CISS), 2018 52nd Annual Conference on","first-page":"1","article-title":"Graph algorithms for preventing cascading failures in networks","author":"Yu","year":"2018"},{"issue":"772","key":"10.1016\/j.peva.2019.03.002_b15","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1098\/rspa.1927.0118","article-title":"A contribution to the mathematical theory of epidemics","volume":"115","author":"Kermack","year":"1927","journal-title":"Proc. Roy. Soc. Lond. Ser. A"},{"issue":"1","key":"10.1016\/j.peva.2019.03.002_b16","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","article-title":"Monte carlo sampling methods using markov chains and their applications","volume":"57","author":"Hastings","year":"1970","journal-title":"Biometrika"},{"key":"10.1016\/j.peva.2019.03.002_b17","series-title":"Foundations of Computer Science, 2009. FOCS\u201909. 50th Annual IEEE Symposium on","article-title":"Faster generation of random spanning trees","author":"Kelner","year":"2009"},{"key":"10.1016\/j.peva.2019.03.002_b18","series-title":"Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing","article-title":"Generating random spanning trees more quickly than the cover time","author":"Wilson","year":"1996"},{"key":"10.1016\/j.peva.2019.03.002_b19","series-title":"Matrix Computations 3rd edition The John Hopkins University Press","author":"Golub","year":"1996"},{"key":"10.1016\/j.peva.2019.03.002_b20","unstructured":"D. Aldous, J. Fill, Reversible markov chains and random walks on graphs (2002)."},{"issue":"6","key":"10.1016\/j.peva.2019.03.002_b21","doi-asserted-by":"crossref","first-page":"1913","DOI":"10.1137\/080734029","article-title":"Graph sparsification by effective resistances","volume":"40","author":"Spielman","year":"2011","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.peva.2019.03.002_b22","series-title":"IJCAI","first-page":"3733","article-title":"Efficient algorithms for spanning tree centrality","author":"Hayashi","year":"2016"},{"key":"10.1016\/j.peva.2019.03.002_b23","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs. I","volume":"6","author":"Erd\u0151s","year":"1959","journal-title":"Publ. Math. Debrecen"},{"issue":"5439","key":"10.1016\/j.peva.2019.03.002_b24","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":"10.1016\/j.peva.2019.03.002_b25","series-title":"S\u00e9minaire de Probabilit\u00e9s XVII 1981\/82","article-title":"Random walks on finite groups and rapidly mixing markov chains","author":"Aldous","year":"1983"},{"key":"10.1016\/j.peva.2019.03.002_b26","series-title":"Markov Chains and Mixing Times","author":"Levin","year":"2009"},{"issue":"3","key":"10.1016\/j.peva.2019.03.002_b27","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1215\/00127094-2010-029","article-title":"Cutoff phenomena for random walks on random regular graphs","volume":"153","author":"Lubetzky","year":"2010","journal-title":"Duke Math. J."},{"key":"10.1016\/j.peva.2019.03.002_b28","first-page":"1","article-title":"Random walks on graphs","volume":"2","author":"Lov\u00e1sz","year":"1993","journal-title":"Combinatorics"},{"key":"10.1016\/j.peva.2019.03.002_b29","series-title":"Spectra of Graphs","author":"Brouwer","year":"2011"},{"issue":"3","key":"10.1016\/j.peva.2019.03.002_b30","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s101070050099","article-title":"Hit-and-run mixes fast","volume":"86","author":"Lov\u00e1sz","year":"1999","journal-title":"Math. Program."},{"key":"10.1016\/j.peva.2019.03.002_b31","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/j.peva.2019.03.002_b32","doi-asserted-by":"crossref","DOI":"10.1214\/ss\/1177011077","article-title":"Simulated annealing","author":"Bertsimas","year":"1993","journal-title":"Stat. Sci."},{"issue":"3\/4","key":"10.1016\/j.peva.2019.03.002_b33","doi-asserted-by":"crossref","first-page":"324","DOI":"10.2307\/2334029","article-title":"Rank analysis of incomplete block designs: I. the method of paired comparisons","volume":"39","author":"Bradley","year":"1952","journal-title":"Biometrika"},{"key":"10.1016\/j.peva.2019.03.002_b34","series-title":"Individual Choice Behavior: A Theoretical Analysis","author":"Luce","year":"2005"},{"key":"10.1016\/j.peva.2019.03.002_b35","unstructured":"D. McFadden, et al. Conditional logit analysis of qualitative choice behavior, 1973."}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531618301172?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531618301172?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T11:38:06Z","timestamp":1694777886000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166531618301172"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":35,"alternative-id":["S0166531618301172"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.peva.2019.03.002","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[2019,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Stochastic approximation algorithms for rumor source inference on graphs","name":"articletitle","label":"Article Title"},{"value":"Performance Evaluation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.peva.2019.03.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}
