To overcome this limitation, authors of [1]} studied a random walk process defined on a generic hypergraph using a new (random
walk) Laplace matrix. It is worth mentioning that the transition rates of
the associated process, linearly correlates with the size of the involved
hyperedges. Stated differently, exchanges are favoured among nodes belonging to the same hyperedge (weighted according to its associated size). Note that a similar construction has been proposed in [2]} to extract a \(n\) -clique graph from a network. The main difference in the present case is that hyperedges can have an heterogeneous size distribution and thus provide a more flexible framework for tackling a wide range of problems.
