Random walks on simplicial complexes

arXiv:2404.08803v1 Announce Type: cross
Abstract: The notion of Laplacian of a graph can be generalized to simplicial complexes and hypergraphs, and contains information on the topology of these structures. Even for a graph, the consideration of associated simplicial complexes is interesting to understand its shape. Whereas the Laplacian of a graph has a simple probabilistic interpretation as the generator of a continuous time Markov chain on the graph, things are not so direct when considering simplicial complexes. We define here …

abstract arxiv generalized graph information math.pr notion random simple stat.ml topology type