פעילויות השבוע

Random walks on graphs (and their spectral analysis) is an extensively explored topic with many applications in pure math and computer science. Recently, there has been much interest (by both the math and the CS communities) in the study of random walks on simplicial complexes as a high dimensional generalization on random walks on graphs. In this talk, we consider the spectrum of random walks on finite partite simplicial complexes and show how with a general decomposition theorem on Hilbert spaces we can improve previous works. All the definitions will be given. This is a joint work with Izhar Oppenheim.