{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,12]],"date-time":"2023-08-12T04:15:00Z","timestamp":1691813700203},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s00493-023-00017-8","type":"journal-article","created":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T06:01:57Z","timestamp":1685944917000},"page":"367-384","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounded Cutoff Window for the Non-backtracking Random Walk on Ramanujan Graphs"],"prefix":"10.1007","volume":"43","author":[{"given":"Evita","family":"Nestoridi","sequence":"first","affiliation":[]},{"given":"Peter","family":"Sarnak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,5]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","DOI":"10.4171\/CMH\/537","author":"M Chapman","year":"2022","unstructured":"Chapman, M., Parzanchevski, O.: Cutoff on Ramanujan complexes and classical groups. arXiv:1901.09383 (2022). https:\/\/doi.org\/10.4171\/CMH\/537","journal-title":"arXiv:1901.09383"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/17-ECP72","volume":"22","author":"J Hermon","year":"2017","unstructured":"Hermon, J.: Cutoff for Ramanujan graphs via degree inflation. Electron. Commun. Probab. 22, 1\u201310 (2017)","journal-title":"Electron. Commun. Probab."},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1007\/s00039-016-0382-7","volume":"26","author":"E Lubetzky","year":"2016","unstructured":"Lubetzky, E., Peres, Y.: Cutoff on all Ramanujan graphs. Geom. Funct. Anal. 26(4), 1190\u20131216 (2016)","journal-title":"Geom. Funct. Anal."},{"issue":"11","key":"17_CR4","doi-asserted-by":"publisher","first-page":"3441","DOI":"10.4171\/JEMS\/990","volume":"22","author":"E Lubetzky","year":"2020","unstructured":"Lubetzky, E., Lubotzky, A., Parzanchevski, O.: Random walks on Ramanujan complexes and digraphs. J. Eur. Math. Soc. (JEMS) 22(11), 3441\u20133466 (2020)","journal-title":"J. Eur. Math. Soc. (JEMS)"},{"key":"17_CR5","doi-asserted-by":"publisher","DOI":"10.1214\/20-ECP358","author":"N Ozawa","year":"2020","unstructured":"Ozawa, N.: An entropic proof of cutoff on Ramanujan graphs. Electron. Commun. Probab. (2020). https:\/\/doi.org\/10.1214\/20-ECP358","journal-title":"Electron. Commun. Probab."},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s00493-017-3605-0","volume":"39","author":"NT Sardari","year":"2019","unstructured":"Sardari, N.T.: Diameter of Ramanujan graphs and random Cayley graphs. Combinatorica 39(2), 427\u2013446 (2019)","journal-title":"Combinatorica"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Hashimoto, Ki-ichiro.: Zeta functions of finite graphs and representations of $$p$$-adic groups. In  Automorphic forms and geometry of arithmetic varieties, volume\u00a015 of  Adv. Stud. Pure Math., pages 211\u2013280. Academic Press, Boston, MA, (1989)","DOI":"10.1016\/B978-0-12-330580-0.50015-X"},{"issue":"4","key":"17_CR8","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1142\/S0219199707002551","volume":"9","author":"N Alon","year":"2007","unstructured":"Alon, N., Benjamini, I., Lubetzky, E., Sodin, S.: Non-backtracking random walks mix faster. Commun. Contemp. Math. 9(4), 585\u2013603 (2007)","journal-title":"Commun. Contemp. Math."},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/16-AOP1142","volume":"46","author":"C Bordenave","year":"2018","unstructured":"Bordenave, C., Lelarge, M., Massouli\u00e9, L.: Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs. Ann. Probab. 46(1), 1\u201371 (2018)","journal-title":"Ann. Probab."},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"1752","DOI":"10.1214\/16-AOP1100","volume":"45","author":"A Ben-Hamou","year":"2017","unstructured":"Ben-Hamou, A., Salez, J.: Cutoff for nonbacktracking random walks on sparse random graphs. Ann. Probab. 45(3), 1752\u20131770 (2017)","journal-title":"Ann. Probab."},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/s10955-012-0684-6","volume":"150","author":"R Fitzner","year":"2013","unstructured":"Fitzner, R., van der Hofstad, R.: Non-backtracking random walk. J. Stat. Phys. 150(2), 264\u2013284 (2013)","journal-title":"J. Stat. Phys."},{"key":"17_CR12","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2011.09385","author":"C Glover","year":"2020","unstructured":"Glover, C., Kempton, M.: Spectral properties of the non-backtracking matrix of a graph. arXiv:2011.09385 (2020). https:\/\/doi.org\/10.48550\/arXiv.2011.09385","journal-title":"arXiv:2011.09385"},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1214\/18-AIHP949","volume":"55","author":"J Hermon","year":"2019","unstructured":"Hermon, J.: Reversibility of the non-backtracking random walk. Ann. Inst. Henri Poincar\u00e9 Probab. Stat. 55(4), 2295\u20132319 (2019)","journal-title":"Ann. Inst. Henri Poincar\u00e9 Probab. Stat."},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1214\/21-AOP1532","volume":"50","author":"J Hermon","year":"2022","unstructured":"Hermon, J., Sly, A., Sousi, P.: Universality of cutoff for graphs with an added random matching. Ann. Probab. 50(1), 203\u2013240 (2022)","journal-title":"Ann. Probab."},{"issue":"4","key":"17_CR15","doi-asserted-by":"publisher","first-page":"828","DOI":"10.4153\/CJM-2007-035-1","volume":"59","author":"R Ortner","year":"2007","unstructured":"Ortner, R., Woess, W.: Non-backtracking random walks and cogrowth of graphs. Canad. J. Math. 59(4), 828\u2013844 (2007)","journal-title":"Canad. J. Math."},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1215\/00127094-2010-029","volume":"153","author":"E Lubetzky","year":"2010","unstructured":"Lubetzky, E., Sly, A.: Cutoff phenomena for random walks on random regular graphs. Duke Math. J. 153(3), 475\u2013510 (2010)","journal-title":"Duke Math. J."},{"issue":"3","key":"17_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica 8(3), 261\u2013277 (1988)","journal-title":"Combinatorica"},{"issue":"2","key":"17_CR18","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1214\/aoap\/1177005705","volume":"2","author":"D Bayer","year":"1992","unstructured":"Bayer, D., Diaconis, P.: Trailing the dovetail shuffle to its lair. Ann. Appl. Probab. 2(2), 294\u2013313 (1992)","journal-title":"Ann. Appl. Probab."},{"issue":"2","key":"17_CR19","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1022472220105","volume":"1","author":"M Hildebrand","year":"1992","unstructured":"Hildebrand, M.: Generating random elements in $${\\rm SL}_n({ F}_q)$$ by random transvections. J. Algebraic Combin. 1(2), 133\u2013150 (1992)","journal-title":"J. Algebraic Combin."},{"key":"17_CR20","unstructured":"Sarnak, Peter.: Letter to Miller and Tabelizadeh on optimal strong approximation by integral points on quadratics, appendix : Optimal lifting of integral points. https:\/\/publications.ias.edu\/sarnak\/paper\/2637, (2015)"},{"key":"17_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2022.103530","volume":"104","author":"K Golubev","year":"2022","unstructured":"Golubev, K., Kamber, A.: Cutoff on graphs and the Sarnak\u2013Xue density of eigenvalues. J. Combinat. 104, 103530 (2022)","journal-title":"J. Combinat."},{"key":"17_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/S1474748020000663","author":"C Bordenave","year":"2021","unstructured":"Bordenave, C., Lacoin, H.: Cutoff at the entropic time for random walks on covered expander graphs. J Inst. Math. Jussieu (2021). https:\/\/doi.org\/10.1017\/S1474748020000663","journal-title":"J Inst. Math. Jussieu"},{"issue":"3","key":"17_CR23","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1137\/S0895480191217776","volume":"7","author":"FRK Chung","year":"1994","unstructured":"Chung, F.R.K., Faber, V., Manteuffel, T.A.: An upper bound on the diameter of a graph from eigenvalues associated with its Laplacian. SIAM J. Discrete Math. 7(3), 443\u2013457 (1994)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"17_CR24","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF02579310","volume":"2","author":"B Bollob\u00e1s","year":"1982","unstructured":"Bollob\u00e1s, B., Fernandez de la Vega, W.: The diameter of random regular graphs. Combinatorica 2(2), 125\u2013134 (1982)","journal-title":"Combinatorica"},{"key":"17_CR25","unstructured":"Levin, David\u00a0A., Peres, Yuval.:  Markov chains and mixing times. American Mathematical Society, Providence, RI, Second edition of [MR2466937], With contributions by Elizabeth L. Wilmer, With a chapter on \u201cCoupling from the past\u201d by James G. Propp and David B. Wilson (2017)"},{"issue":"5","key":"17_CR26","doi-asserted-by":"publisher","first-page":"3303","DOI":"10.1214\/19-AOP1340","volume":"47","author":"M Bernstein","year":"2019","unstructured":"Bernstein, M., Nestoridi, E.: Cutoff for random to random card shuffle. Ann. Probab. 47(5), 3303\u20133320 (2019)","journal-title":"Ann. Probab."},{"issue":"2","key":"17_CR27","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF00535487","volume":"57","author":"P Diaconis","year":"1981","unstructured":"Diaconis, P., Shahshahani, M.: Generating a random permutation with random transpositions. Z. Wahrsch. Verw. Gebiete 57(2), 159\u2013179 (1981)","journal-title":"Z. Wahrsch. Verw. Gebiete"},{"issue":"3","key":"17_CR28","doi-asserted-by":"publisher","first-page":"1601","DOI":"10.1214\/14-AOP937","volume":"44","author":"M Ab\u00e9rt","year":"2016","unstructured":"Ab\u00e9rt, M., Glasner, Y., Vir\u00e1g, B.: The measurable Kesten theorem. Ann. Probab. 44(3), 1601\u20131646 (2016)","journal-title":"Ann. Probab."},{"key":"17_CR29","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2201.03523","author":"P Sarnak","year":"2022","unstructured":"Sarnak, P., Zubrilina, N.: Convergence to Plancherel measure of Hecke eigenvalues. arXiv:2201.03523v1 (2022). https:\/\/doi.org\/10.48550\/arXiv.2201.03523","journal-title":"arXiv:2201.03523v1"},{"key":"17_CR30","volume-title":"Elementary number theory, group theory, and Ramanujan graphs, London Mathematical Society Student Texts","author":"G Davidoff","year":"2003","unstructured":"Davidoff, G., Sarnak, P., Valette, A.: Elementary number theory, group theory, and Ramanujan graphs, London Mathematical Society Student Texts. Cambridge University Press, Cambridge (2003)"},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"Cartier, P.: Harmonic analysis on trees. In  Harmonic analysis on homogeneous spaces (Proc. Sympos. Pure Math., Vol. XXVI, Williams Coll., Williamstown, Mass., 1972), pages 419\u2013424, (1973)","DOI":"10.1090\/pspum\/026\/0338272"},{"key":"17_CR32","first-page":"2019","volume-title":"Ramanujan graphs in cryptography, Research Directions in Number Theory","author":"A Costache","year":"2019","unstructured":"Costache, A., Feigon, B., Lauter, K., Massierer, M., Pusk\u00e1s, A.: Ramanujan graphs in cryptography, Research Directions in Number Theory, p. 2019. Springer International Publishing, Cham (2019)"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00017-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-023-00017-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00017-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T10:05:06Z","timestamp":1691748306000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-023-00017-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["17"],"URL":"https:\/\/doi.org\/10.1007\/s00493-023-00017-8","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4]]},"assertion":[{"value":"20 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}