Given a model for random walkers on hypergraphs, one can define the Kayz-centrality of a node as the average fraction of walkers sitting on this node at equilibirum.
The simplest random walker we could think of could :
select an hyperedge at random among those containing the current node,
jump to a random node of this hyperedge (remaining on the current node is not allowed).
I have written a code for this feature and I would be happy to contribute.
Given a model for random walkers on hypergraphs, one can define the Kayz-centrality of a node as the average fraction of walkers sitting on this node at equilibirum.
The simplest random walker we could think of could :
I have written a code for this feature and I would be happy to contribute.