Maximum-Entropy Random Walks on Hypergraphs
This paper introduces a maximum-entropy random walk framework for directed hypergraphs that models both broadcasting and merging interactions through a Kullback-Leibler divergence projection, utilizing Sinkhorn-type iterations to derive transition kernels and analyze ergodicity for capturing complex higher-order flows.