Random walks on simplicial complexes
29 May 2019 Wednesday, 04:00 PM to 05:00 PM
COM1 Level 2
Video Conference Room, COM1-02-13
Simplicial complexes (or hypergraphs) generalize graphs and can be used to represent relationships between more than two entities. As random walks on graphs have been widely investigated, it seems natural to explore their analog on simplicial complexes. There exists only one paper on the subject. We here define a new type of random walks on simplicial complexes and give a few of its properties.
Laurent Decreusefond is Full Professor of Mathematics at Telecom ParisTech, France. His areas of expertise are probability, random geometry, random topology and stochastic modelling. He graduated from the Ecole Normale Superieure, France and has a PhD from Telecom ParisTech. He is in charge of the subgroup on applied mathematics, computing, networking, computation and Industry of the French society of Applied Maths.