{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:05:12Z","timestamp":1757617512909,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610891"},{"type":"electronic","value":"9789819610907"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1090-7_32","type":"book-chapter","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:33:13Z","timestamp":1741105993000},"page":"397-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Random Schreier Graphs as\u00a0Expanders"],"prefix":"10.1007","author":[{"given":"Geoffroy","family":"Caillat-Grenier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"key":"32_CR1","unstructured":"The on-line Encyclopedia of Integer Sequences, sequence a048651. https:\/\/oeis.org\/A048651"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s00493-020-4429-x","volume":"41","author":"N Alon","year":"2020","unstructured":"Alon, N.: Explicit expanders of every degree and size. Combinatorica 41, 447\u2013463 (2020)","journal-title":"Combinatorica"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1002\/rsa.3240050203","volume":"5","author":"N Alon","year":"1994","unstructured":"Alon, N., Roichman, Y.: Random Cayley graphs and expanders. Random Struct. Algorithms 5, 271\u2013285 (1994)","journal-title":"Random Struct. Algorithms"},{"issue":"4","key":"32_CR4","first-page":"1393","volume":"53","author":"C Bordenave","year":"2015","unstructured":"Bordenave, C.: A new proof of Friedman\u2019s second eigenvalue theorem and its extension to random lifts. Annales scientifiques de l\u2019\u00c9cole normale sup\u00e9rieure 53(4), 1393\u20131439 (2015)","journal-title":"Annales scientifiques de l\u2019\u00c9cole normale sup\u00e9rieure"},{"issue":"2","key":"32_CR5","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1017\/S0963548321000249","volume":"31","author":"G Brito","year":"2022","unstructured":"Brito, G., Dumitriu, I., Harris, K.D.: Spectral gap in random bipartite biregular graphs and applications. Comb. Probab. Comput. 31(2), 229\u2013267 (2022). https:\/\/doi.org\/10.1017\/S0963548321000249","journal-title":"Comb. Probab. Comput."},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Broder, A., Shamir, E.: On the second eigenvalue of random regular graphs. In: Proceedings of the 28th ACM Symposium on Theory of Computing, pp. 286\u2013294 (1987)","DOI":"10.1109\/SFCS.1987.45"},{"key":"32_CR7","first-page":"1","volume":"2","author":"D Calvetti","year":"1994","unstructured":"Calvetti, D., Reichel, L., Sorensen, D.C.: An implicitly restarted Lanczos method for large symmetric eigenvalue problems. Electron. Trans. Numer. Anal. 2, 1\u201321 (1994)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1002\/rsa.20177","volume":"32","author":"D Christofides","year":"2008","unstructured":"Christofides, D., Markstr\u00f6m, K.: Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales. Random Struct. Algor. 32, 88\u2013100 (2008)","journal-title":"Random Struct. Algor."},{"issue":"2","key":"32_CR9","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/4234.905935","volume":"5","author":"S-Y Chung","year":"2001","unstructured":"Chung, S.-Y., Forney, G.D., Richardson, T.J., Urbanke, R.: On the design of low-density parity-check codes within 0.0045 db of the Shannon limit. IEEE Commun. Lett. 5(2), 58\u201360 (2001). https:\/\/doi.org\/10.1109\/4234.905935","journal-title":"IEEE Commun. Lett."},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1007\/s00453-016-0269-x","volume":"78","author":"M Dinitz","year":"2015","unstructured":"Dinitz, M., Schapira, M., Valadarsky, A.: Explicit expanding expanders. Algorithmica 78, 1225\u20131245 (2015)","journal-title":"Algorithmica"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00222-021-01065-x","volume":"227","author":"S Eberhard","year":"2020","unstructured":"Eberhard, S., Jezernik, U.: Babai\u2019s conjecture for high-rank classical groups with random generators. Invent. Math. 227, 149\u2013210 (2020)","journal-title":"Invent. Math."},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Friedman, J.: A proof of Alon\u2019s second eigenvalue conjecture. In: Proceedings of the 35th ACM Symposium on Theory of Computing, pp. 720\u2013724 (2003)","DOI":"10.1145\/780542.780646"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S Hoory","year":"2006","unstructured":"Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Am. Math. Soc. 43, 439\u2013561 (2006)","journal-title":"Bull. Am. Math. Soc."},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Kaltofen, E.L., Lobo, A.A.: On rank properties of Toeplitz matrices over finite fields. In: International Symposium on Symbolic and Algebraic Computation (1996)","DOI":"10.1145\/236869.237081"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Li, W.-C.W., Sol\u00e9, P.: Spectra of regular graphs and hypergraphs and orthogonal polynomials. Eur. J. Comb. 17(5), 461\u2013477 (1996)","DOI":"10.1006\/eujc.1996.0040"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A Lubotzky","year":"2017","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica 8, 261\u2013277 (2017)","journal-title":"Combinatorica"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Matsumoto, M.,\u00a0Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator 8(1) (1998)","DOI":"10.1145\/272991.272995"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Mohanty, S., O\u2019Donnell, R., Paredes, P.: Explicit near-Ramanujan graphs of every degree. In: Proceedings of the 52nd ACM Symposium on Theory of Computing, pp. 510\u2013523 (2019)","DOI":"10.1145\/3357713.3384231"},{"issue":"1","key":"32_CR19","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jctb.1994.1054","volume":"62","author":"M Morgenstern","year":"1994","unstructured":"Morgenstern, M.: Existence and explicit constructions of $$q + 1$$ regular Ramanujan graphs for every prime power $$q$$. J. Comb. Theory Ser. B. 62(1), 44\u201362 (1994)","journal-title":"J. Comb. Theory Ser. B."},{"issue":"2","key":"32_CR20","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(91)90112-F","volume":"91","author":"A Nilli","year":"1991","unstructured":"Nilli, A.: On the second eigenvalue of a graph. Discret. Math. 91(2), 207\u2013210 (1991)","journal-title":"Discret. Math."},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Reingold, O.,\u00a0Vadhan, S.,\u00a0Wigderson, A.: Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In: Proceedings of the 41th ACM Symposium on Theory of Computing, pp. 3\u201313 (2000)","DOI":"10.1109\/SFCS.2000.892006"},{"key":"32_CR22","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1007\/s10801-022-01136-z","volume":"56","author":"L Sabatini","year":"2021","unstructured":"Sabatini, L.: Random Schreier graphs and expanders. J. Algebraic Combin. 56, 889\u2013901 (2021)","journal-title":"J. Algebraic Combin."},{"issue":"6","key":"32_CR23","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M Sipser","year":"1996","unstructured":"Sipser, M., Spielman, D.A.: Expander codes. IEEE Trans. Inf. Theory 42(6), 1710\u20131722 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"32_CR24","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1109\/18.910593","volume":"47","author":"G Zemor","year":"2001","unstructured":"Zemor, G.: On expander codes. IEEE Trans. Inf. Theory 47(2), 835\u2013837 (2001)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1090-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T07:29:59Z","timestamp":1757143799000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1090-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610891","9789819610907"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1090-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}