A new algorithm, t-NeSt, samples random temporal networks that preserve the time-respecting (causal) neighborhood structure up to a chosen depth d, with theoretical guarantees for temporal Katz centrality.
Incremental multiset hash functions and their application to memory integrity checking
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.SI 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Efficient Sampling of Temporal Networks with Preserved Causality Structure
A new algorithm, t-NeSt, samples random temporal networks that preserve the time-respecting (causal) neighborhood structure up to a chosen depth d, with theoretical guarantees for temporal Katz centrality.