{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:53:08Z","timestamp":1742921588726,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030925109"},{"type":"electronic","value":"9783030925116"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92511-6_7","type":"book-chapter","created":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T14:05:12Z","timestamp":1638885912000},"page":"107-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Accelerating MCMC by\u00a0Rare Intermittent Resets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0756-5402","authenticated-orcid":false,"given":"Vivek S.","family":"Borkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7284-8009","authenticated-orcid":false,"given":"Syomantak","family":"Chaudhuri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,8]]},"reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"657","DOI":"10.2307\/3214097","volume":"24","author":"S Anily","year":"1987","unstructured":"Anily, S., Federgruen, A.: Simulated annealing methods with general acceptance probabilities. J. Appl. Prob. 24(3), 657\u2013667 (1987)","journal-title":"J. Appl. Prob."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.spa.2021.03.006","volume":"136","author":"S Apers","year":"2021","unstructured":"Apers, S., Sarlette, A., Ticozzi, F.: Characterizing limits and opportunities in speeding up Markov chain mixing. Stochast. Process. Appl. 136, 145\u2013191 (2021)","journal-title":"Stochast. Process. Appl."},{"issue":"4","key":"7_CR3","first-page":"1","volume":"5","author":"K Avrachenkov","year":"2018","unstructured":"Avrachenkov, K., Borkar, V.S., Kadavankandy, A., Sreedharan, J.K.: Revisiting random walk based sampling in networks: Evasion of burn-in period and frequent regenerations. Comput. Social Netw. 5(4), 1\u201319 (2018)","journal-title":"Comput. Social Netw."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-18009-5_10","volume-title":"Algorithms and Models for the Web-Graph","author":"K Avrachenkov","year":"2010","unstructured":"Avrachenkov, K., Ribeiro, B., Towsley, D.: Improving random walk estimation accuracy with uniform restarts. In: Kumar, R., Sivakumar, D. (eds.) WAW 2010. LNCS, vol. 6516, pp. 98\u2013109. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-18009-5_10"},{"issue":"10","key":"7_CR5","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10), P10008 (2008)","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"7_CR6","series-title":"Probability and Its Applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33131-2","volume-title":"Quasi-Stationary Distributions: Markov Chains, Diffusions and Dynamical Systems","author":"P Collet","year":"2012","unstructured":"Collet, P., Martin\u00e9z, S., San Martin, J.: Quasi-Stationary Distributions: Markov Chains, Diffusions and Dynamical Systems. Probability and Its Applications, Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33131-2"},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1080\/15427951.2016.1164100","volume":"12","author":"C Cooper","year":"2016","unstructured":"Cooper, C., Radzik, T., Siantos, Y.: Fast low-cost estimation of network properties using random walks. Internet Math. 12(4), 221\u2013238 (2016)","journal-title":"Internet Math."},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0024-3795(00)00095-1","volume":"315","author":"P Deuflhard","year":"2000","unstructured":"Deuflhard, P., Huisinga, W., Fischer, A., Sch\u00fctte, C.: Identification of almost invariant aggregates in reversible nearly uncoupled Markov chains. Linear Algebra Appl. 315(1), 39\u201359 (2000)","journal-title":"Linear Algebra Appl."},{"issue":"19","key":"7_CR9","doi-asserted-by":"publisher","first-page":"193001","DOI":"10.1088\/1751-8121\/ab7cfe","volume":"53","author":"MR Evans","year":"2020","unstructured":"Evans, M.R., Majumdar, S.N., Schehr, G.: Stochastic resetting and applications. J. Phys. A Math. Theor. 53(19), 193001 (2020)","journal-title":"J. Phys. A Math. Theor."},{"key":"7_CR10","unstructured":"Giles, C., Bollacker, K., Lawrence, S.: Citeseer: an automatic citation indexing system. In: Proceedings of 3rd ACM Conference on Digital Libraries (2000)"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1214\/105051606000000772","volume":"17","author":"Y Guan","year":"2007","unstructured":"Guan, Y., Krone, S.N.: Small-world MCMC and convergence to multi-modal distributions: from slow mixing to fast mixing. Ann. Appl. Prob. 17(1), 284\u2013304 (2007)","journal-title":"Ann. Appl. Prob."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using networkx. In: Varoquaux, G., Vaught, T., Millman, J. (eds.) Proceedings of the 7th Python in Science Conference, Pasadena, CA USA, pp. 11\u201315 (2008)","DOI":"10.25080\/TCWV9851"},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"B Hajek","year":"1988","unstructured":"Hajek, B.: Cooling schedules for optimal annealing. Math. Oper. Res. 13(2), 311\u2013329 (1988)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"174","DOI":"10.2307\/3096941","volume":"44","author":"DD Heckathorn","year":"1997","unstructured":"Heckathorn, D.D.: Respondent-driven sampling: a new approach to the study of hidden populations. Social Prob. 44(2), 174\u2013199 (1997)","journal-title":"Social Prob."},{"issue":"4","key":"7_CR15","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/BF01224127","volume":"115","author":"R Holley","year":"1988","unstructured":"Holley, R., Stroock, D.: Simulated annealing via Sobolev inequalities. Commun. Math. Phys. 115(4), 553\u2013569 (1988)","journal-title":"Commun. Math. Phys."},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"AN Langville","year":"2004","unstructured":"Langville, A.N., Meyer, C.D.: Deeper inside pagerank. Internet Math. 1(3), 335\u2013380 (2004)","journal-title":"Internet Math."},{"key":"7_CR17","unstructured":"Leskovec, J., Mcauley, J.: Learning to discover social circles in ego networks. In: Pereira, F., Burges, C.J.C., Bottou, L., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 25. Curran Associates, Inc. (2012)"},{"issue":"6","key":"7_CR18","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"issue":"3","key":"7_CR19","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1561\/0400000003","volume":"1","author":"R Montenegro","year":"2006","unstructured":"Montenegro, R., Tetali, P.: Mathematical aspects of mixing times in Markov chains. Found. Trends Theor. Comput. Sci. 1(3), 237\u2013354 (2006)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/EJP.v20-4039","volume":"20","author":"D Paulin","year":"2015","unstructured":"Paulin, D.: Concentration inequalities for Markov chains by Marton couplings and spectral methods. Electron. J. Prob. 20, 1\u201332 (2015)","journal-title":"Electron. J. Prob."},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Ribeiro, B., Towsley, D.: Estimating and sampling graphs with multidimensional random walks. In: Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement, IMC \u201910, pp. 390\u2013403. Association for Computing Machinery, New York (2010)","DOI":"10.1145\/1879141.1879192"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"e1435","DOI":"10.1002\/wics.1435","volume":"10","author":"C Robert","year":"2018","unstructured":"Robert, C., Elvira, V., Tawn, N., Wu, C.: Accelerating MCMC algorithms. Wiley Interdisc. Rev. Comput. Stat. 10, e1435 (2018)","journal-title":"Wiley Interdisc. Rev. Comput. Stat."},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1287\/moor.14.1.70","volume":"14","author":"J Tsitsiklis","year":"1989","unstructured":"Tsitsiklis, J.: Markov chains with rare transitions and simulated annealing. Math. Oper. Res. 14, 70\u201390 (1989)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Performance Evaluation Methodologies and Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92511-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T23:01:58Z","timestamp":1726268518000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92511-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030925109","9783030925116"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92511-6_7","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"8 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VALUETOOLS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"EAI International Conference on Performance Evaluation Methodologies and Tools","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"valuetools2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}