Random walks with resetting on hypergraphs can be analyzed through the spectral decomposition of the reset-free walk, and resetting improves search when the coefficient of variation of first passage times is large.
What are higher-order networks?
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Random walks with resetting on hypergraph
Random walks with resetting on hypergraphs can be analyzed through the spectral decomposition of the reset-free walk, and resetting improves search when the coefficient of variation of first passage times is large.