2019
DOI: 10.1007/978-3-030-22741-8_20
|View full text |Cite
|
Sign up to set email alerts
|

Personalized Ranking in Dynamic Graphs Using Nonbacktracking Walks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…The exclusion of backtracking walks, besides reflecting the intuitive notion that back-and-forth patterns appear less relevant in the transmission of information [3], also helps reducing localization effects. See [11,118] and references therein for the definition and analysis of new centrality measures based on non-backtracking walks on directed and dynamic graphs. In [12], the authors derive an explicit formula for the exponential generating function of non-backtracking walks for both undirected and directed graphs.…”
Section: Theorem 1 [25]mentioning
confidence: 99%
“…The exclusion of backtracking walks, besides reflecting the intuitive notion that back-and-forth patterns appear less relevant in the transmission of information [3], also helps reducing localization effects. See [11,118] and references therein for the definition and analysis of new centrality measures based on non-backtracking walks on directed and dynamic graphs. In [12], the authors derive an explicit formula for the exponential generating function of non-backtracking walks for both undirected and directed graphs.…”
Section: Theorem 1 [25]mentioning
confidence: 99%