Random walks on simplicial complexes and harmonics

Random Structures and Algorithms

Volumn 49, Issue 2, 2016, Pages 379-405

  Mukherjee, Sayan ^a   Steenbergen, John ^b  

^a DUKE UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

random walks; simplicial complexes; spectral theory

Indexed keywords

EID: 84960157370     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20645     Document Type: Article

References (23)

1. J. Callut, K. Françoisse, M. Saerens, and P. Dupont, Semi-supervised classification from discriminative random walks, Machine learning and knowledge discovery in databases, Springer-Verlag, Berlin-Heidelberg-New York, 2008, pp. 162–177.
2. F. R. K. Chung, Spectral graph theory, American Mathematical Society, Providence, RI, 1997.
3. F. R. K. Chung, Random walks and local cuts in graphs, Linear Algebra Appli Vol. 423 (2007), 22–32.
4. F. R. K. Chung, Quasi-random hypergraphs revisited, Random Struct Algorithms 40 (2012), 39–48.
5. F. R. K. Chung and R. L. Graham, Quasi-random hypergraphs, Random Struct Algorithms 1 (1990), 105–124.
6. E. Cohen, D. Mubyi, P. Ralli, and P. Tetali, Inverse expander mixing for hypergraphs, Arxiv preprint arXiv:1407.2285, 2014.
7. J. Dodziuk, Difference equations, isoperimetric inequality and transience of certain random walks, Trans Am Math Soc 284 (1984), 787–794.
8. D. Dotterrer and M. Kahle, Coboundary expanders, J Topol Anal 4 (2012), 499–514.
9. B. Eckmann, Harmonische Funktionen und Randwertaufgaben in einem Komplex, Comment Math Helv 17 (1944), 240–255.
10. J. Friedman and A. Wigderson, On the second eigenvalue of hypergraphs, Combinatorica 15 (1995), 43–65.
11. T. Jaakkola and M. Szummer, Partially labeled classification with M, arkov random walks, Advances in neural information processing systems (NIPS), MIT Press, Cambridge, MA, Vol. 14, 2002, pp. 945–952.
12. M. Kahle, Sharp vanishing thresholds for cohomology of random flag complexes, Ann Math 179 (2014), 1085–1107.
13. D. A. Levin, Y. Peres, and E. L. Wilmer, Markov chains and mixing times, American Mathematical Society, Providence, RI, 2008.
14. L. Lovász, Random walks on graphs: A survey, In D. Miklós, V. T. Sós and T. Szőnyi, editors, Combinatorics, Paul Erdős is eighty, Vol. 2, János Bolyai Mathematical Society, Budapest-Hungary, 1996, pp. 353–398.
15. A. Lubotzky, Ramanujan complexes and high dimensional expanders, Japanese Journal of Mathematics 9 (2014), 137–169.
16. M. Meilă and J. Shi, A random walks view of spectral segmentation, In AI and Statistics (AISTATS) 2001, Key West, Florida, 2001.
17. O. Parzanchevski and R. Rosenthal, Simplicial complexes: Spectrum, homology and random walks, arXiv:1211.6775v2, 2012.
18. O. Parzanchevski, R. Rosenthal, and R. J. Tessler, Isoperimetric inequalities in simplicial complexes, Combinatorica, 1–33.
19. R. Rosenthal, Simplicial branching random walks and their applications, Arxiv preprint arXiv:1412.5406, 2014.
20. J. Steenbergen, Towards a spectral theory for simplicial complexes, PhD thesis, Duke University, Durham, NC, 2013, AAI3605065.
21. J. Steenbergen, C. Klivans, and S. Mukherjee, A Cheeger-type inequality on simplicial complexes, Adv Appl Math 56 (2014), 56–77.
22. D. Zhou and B. Schölkopf, Learning from labeled and unlabeled data using random walks, Pattern recognition, Springer, Berlin-Heidelberg, 2004, pp. 237–244.
23. X. Zhu, Semi-supervised learning with graphs, PhD thesis, Carnegie Mellon University, Language Technologies Institute, School of Computer Science, Pittsburgh, PA, 2005.