A unified tensor framework models higher-order Markov chains with memory via an even-order paired tensor linking folded and unfolded dynamics, with approximation to low-dimensional nonlinear systems and application to hypergraph random walks.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
In-network congestion marking for synchronization packets enables better delay filtering, improving clock offset accuracy by 80%+ in hardware and 30-80% in multi-hop scenarios without protocol changes.
citing papers explorer
-
Markov Chains and Random Walks with Memory on Hypergraphs: A Tensor-Based Approach
A unified tensor framework models higher-order Markov chains with memory via an even-order paired tensor linking folded and unfolded dynamics, with approximation to low-dimensional nonlinear systems and application to hypergraph random walks.
-
Improving Network Clock Synchronization by Marking Congestion
In-network congestion marking for synchronization packets enables better delay filtering, improving clock offset accuracy by 80%+ in hardware and 30-80% in multi-hop scenarios without protocol changes.