{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article9358","name":"High Dimensional Random Walks and Colorful Expansion","abstract":"Random walks on bounded degree expander graphs have numerous applications, both in theoretical and practical computational problems. A key property of these walks is that they converge rapidly to their stationary distribution.\r\n\t\r\nIn this work we define high order random walks: These are generalizations of random walks on graphs to high dimensional simplicial complexes, which are the high dimensional analogues of graphs. A simplicial complex of dimension d has vertices, edges, triangles, pyramids, up to d-dimensional cells. For any 0 \\leq i < d, a high order random walk on dimension i moves between neighboring i-faces (e.g., edges) of the complex, where two i-faces are considered neighbors if they share a common (i+1)-face (e.g., a triangle). The case of i=0 recovers the well studied random walk on graphs.\r\n\t\r\nWe provide a local-to-global criterion on a complex which implies rapid convergence of all high order random walks on it. Specifically, we prove that if the 1-dimensional skeletons of all the links of a complex are spectral expanders, then for all 0 \\le i < d the high order random walk on dimension i converges rapidly to its stationary distribution.\r\n\t\r\nWe derive our result through a new notion of high dimensional combinatorial expansion of complexes which we term colorful expansion. This notion is a natural generalization of combinatorial expansion of graphs and is strongly related to the convergence rate of the high order random walks.\r\n\t\r\nWe further show an explicit family of bounded degree complexes which satisfy this criterion. Specifically, we show that Ramanujan complexes meet this criterion, and thus form an explicit family of bounded degree high dimensional simplicial complexes in which all of the high order random walks converge rapidly to their stationary distribution.","keywords":["High dimensional expanders","expander graphs","random walks"],"author":[{"@type":"Person","name":"Kaufman, Tali","givenName":"Tali","familyName":"Kaufman"},{"@type":"Person","name":"Mass, David","givenName":"David","familyName":"Mass"}],"position":4,"pageStart":"4:1","pageEnd":"4:27","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Kaufman, Tali","givenName":"Tali","familyName":"Kaufman"},{"@type":"Person","name":"Mass, David","givenName":"David","familyName":"Mass"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.4","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":"http:\/\/lucatrevisan.wordpress.com\/2016\/02\/09\/cheeger-type-inequalities-for-%CE%BBn\/","isPartOf":{"@type":"PublicationVolume","@id":"#volume6270","volumeNumber":67,"name":"8th Innovations in Theoretical Computer Science Conference (ITCS 2017)","dateCreated":"2017-11-28","datePublished":"2017-11-28","editor":{"@type":"Person","name":"Papadimitriou, Christos H.","givenName":"Christos H.","familyName":"Papadimitriou"},"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article9358","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6270"}}}