{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:34:03Z","timestamp":1743078843600,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319684444"},{"type":"electronic","value":"9783319684451"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68445-1_87","type":"book-chapter","created":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T00:40:36Z","timestamp":1508805636000},"page":"754-762","source":"Crossref","is-referenced-by-count":0,"title":["Bounding the Convergence Time of Local Probabilistic Evolution"],"prefix":"10.1007","author":[{"given":"Simon","family":"Apers","sequence":"first","affiliation":[]},{"given":"Alain","family":"Sarlette","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Ticozzi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,24]]},"reference":[{"key":"87_CR1","unstructured":"Cheeger, J.: A lower bound for the smallest eigenvalue of the Laplacian. In: Proceedings of the Princeton Conference in Honor of Professor S. Bochner (1969)"},{"issue":"2","key":"87_CR2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.24033\/asens.1426","volume":"15","author":"P Buser","year":"1982","unstructured":"Buser, P.: A note on the isoperimetric constant. Annales Scientifiques de l\u2019Ecole Normale Sup\u00e9rieure 15(2), 213\u2013230 (1982). Buser, P.: Ueber den ersten Eigenwert des Laplace-Operators auf kompakten Fl\u00e4chen. Commentarii Mathematici Helvetici 54(1), 477\u2013493 (1979)","journal-title":"Annales Scientifiques de l\u2019Ecole Normale Sup\u00e9rieure"},{"issue":"1","key":"87_CR3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0095-8956(85)90092-9","volume":"38","author":"N Alon","year":"1985","unstructured":"Alon, N., Milman, V.D.: $$\\lambda _1$$ , isoperimetric inequalities for graphs, and superconcentrators. J. Combin. Theory Ser. B 38(1), 73\u201388 (1985). Alon, N.: Eigenvalues and expanders. Combinatorica 6(2), 83\u201396 (1986)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"87_CR4","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler, M.: Algebraic connectivity of graphs. Czech. Math. J. 23(2), 298\u2013305 (1973)","journal-title":"Czech. Math. J."},{"issue":"1","key":"87_CR5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1017\/S0269964800000267","volume":"1","author":"D Aldous","year":"1987","unstructured":"Aldous, D.: On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing. Probab. Eng. Inf. Sci. 1(1), 33\u201346 (1987)","journal-title":"Probab. Eng. Inf. Sci."},{"issue":"2","key":"87_CR6","first-page":"557","volume":"309","author":"GF Lawler","year":"1988","unstructured":"Lawler, G.F., Sokal, A.D.: Bounds on the $$L^2$$ spectrum for Markov chains and Markov processes: a generalization of Cheeger\u2019s inequality. Trans. Am. Math. Soc. 309(2), 557\u2013580 (1988)","journal-title":"Trans. Am. Math. Soc."},{"key":"87_CR7","doi-asserted-by":"crossref","unstructured":"Mihail, M.: Conductance and convergence of Markov chains-a combinatorial treatment of expanders. In: IEEE Annual Symposium on Foundations of Computer Science (1989)","DOI":"10.1109\/SFCS.1989.63529"},{"issue":"2","key":"87_CR8","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1090\/S0002-9947-1984-0743744-X","volume":"284","author":"J Dodziuk","year":"1984","unstructured":"Dodziuk, J.: Difference equations, isoperimetric inequality and transience of certain random walks. Trans. Am. Math. Soc. 284(2), 787\u2013794 (1984)","journal-title":"Trans. Am. Math. Soc."},{"key":"87_CR9","doi-asserted-by":"crossref","unstructured":"Chen, F., Lov\u00e1sz, L., Pak, I.: Lifting Markov chains to speed up mixing. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing. ACM (1999)","DOI":"10.1145\/301250.301315"},{"key":"87_CR10","doi-asserted-by":"crossref","unstructured":"Aharonov, D., et al.: Quantum walks on graphs. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing. ACM (2001)","DOI":"10.1145\/380752.380758"},{"issue":"3","key":"87_CR11","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8(3), 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"issue":"17","key":"87_CR12","doi-asserted-by":"crossref","first-page":"11B603","DOI":"10.1063\/1.3002335","volume":"129","author":"M Mohseni","year":"2008","unstructured":"Mohseni, M., et al.: Environment-assisted quantum walks in photosynthetic energy transfer. J. Chem. Phys. 129(17), 11B603 (2008)","journal-title":"J. Chem. Phys."},{"key":"87_CR13","unstructured":"Tsitsiklis, J.N., Athans, M.: Problems in decentralized decision making and computation. Ph.D. thesis, MIT (1984)"},{"key":"87_CR14","unstructured":"Murray, R., Saber, R.O.: Consensus protocols for networks of dynamic agents. In: Proceedings of the American Control Conference (2003)"},{"issue":"6","key":"87_CR15","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1137\/0218077","volume":"18","author":"M Jerrum","year":"1989","unstructured":"Jerrum, M., Sinclair, A.: Approximating the permanent. SIAM J. Comput. 18(6), 1149\u20131178 (1989)","journal-title":"SIAM J. Comput."},{"key":"87_CR16","doi-asserted-by":"crossref","unstructured":"Diaconis, P., Holmes, S., Neal, R.M.: Analysis of a nonreversible Markov chain sampler. Ann. Appl. Probab. 726\u2013752 (2000)","DOI":"10.1214\/aoap\/1019487508"},{"issue":"3","key":"87_CR17","doi-asserted-by":"crossref","first-page":"032325","DOI":"10.1103\/PhysRevA.71.032325","volume":"71","author":"S Aaronson","year":"2005","unstructured":"Aaronson, S.: Quantum computing and hidden variables. Phys. Rev. A 71(3), 032325 (2005)","journal-title":"Phys. Rev. A"},{"key":"87_CR18","unstructured":"Aldous, D., Fill, J.: Reversible Markov chains and random walks on graphs (2002)"},{"key":"87_CR19","doi-asserted-by":"crossref","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. American Mathematical Soc. (2009)","DOI":"10.1090\/mbk\/058"},{"key":"87_CR20","unstructured":"Apers, S., Sarlette, A., Ticozzi, F.: Lifting Markov chains to mix faster: limits and opportunities. IEEE Trans. Inf. Theory (2017, in preparation)"},{"issue":"8","key":"87_CR21","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1016\/j.spa.2006.11.004","volume":"117","author":"L Saloff-Coste","year":"2007","unstructured":"Saloff-Coste, L., Z\u00faniga, J.: Convergence of some time inhomogeneous Markov chains via spectral techniques. Stochast. Process. Appl. 117(8), 961\u2013979 (2007). Touri, B., Nedi\u0107, A.: Alternative characterization of ergodicity for doubly stochastic chains. In: Proceedings of the IEEE Conference on Decision and Control (2011)","journal-title":"Stochast. Process. Appl."},{"key":"87_CR22","doi-asserted-by":"crossref","unstructured":"Mossel, E., Peres, Y., Sinclair, A.: Shuffling by semi-random transpositions. In: Proceedings of the IEEE Symposium on Foundations of Computer Science (2004). Diaconis, P., Ram, A.: Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques. Stanford University, Department of Statistics (2000)","DOI":"10.1109\/FOCS.2004.60"},{"issue":"2","key":"87_CR23","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/j.automatica.2013.11.034","volume":"50","author":"JM Hendrickx","year":"2014","unstructured":"Hendrickx, J.M., et al.: Graph diameter, eigenvalues, and minimum-time consensus. Automatica 50(2), 635\u2013640 (2014). Hendrickx, J.M., Shi, G., Johansson, K.H.: Finite-time consensus using stochastic matrices with positive diagonals. IEEE Trans. Autom. Control 60(4), 1070\u20131073 (2015)","journal-title":"Automatica"},{"issue":"1","key":"87_CR24","doi-asserted-by":"crossref","first-page":"3","DOI":"10.13001\/1081-3810.1174","volume":"14","author":"L Hogben","year":"2005","unstructured":"Hogben, L.: Spectral graph theory and the inverse eigenvalue problem of a graph. Electron. J. Linear Algebra 14(1), 3 (2005)","journal-title":"Electron. J. Linear Algebra"}],"container-title":["Lecture Notes in Computer Science","Geometric Science of Information"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68445-1_87","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T09:55:48Z","timestamp":1603187748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68445-1_87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319684444","9783319684451"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68445-1_87","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}