Graph fibrations, graph isomorphism, and PageRank
By Paolo Boldi, Violetta Lonati, Massimo Santini, Sebastiano Vigna. 2006
49 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Computer Vision and Pattern Recognition
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Muhan Zhang
- Yixin Chen
- Carlos Castillo
- Paolo Boldi
- Kristian Kersting
- Sebastiano Vigna
- Aristides Gionis
- Marion Neumann
In Computational Theory and Mathematics
- Muhan Zhang
- Yixin Chen
- Kristian Kersting
- Roman Garnett
- Carlos Castillo
- Aristides Gionis
- Francesco Bonchi
- Paolo Boldi
In Computer Vision and Pattern Recognition
- Muhan Zhang
- Yixin Chen
- Kristian Kersting
- Marion Neumann
- Roman Garnett
- Carlos Castillo
- Aristides Gionis
- Francesco Bonchi
Citations in the corpus
- An End-to-End Deep Learning Architecture for Graph Classification (2018, background): “The connection between discrete WL, continuous optimization, and random walks have also been studied in (Boldi et al. 2006; Kersting et al. 2014; Kipf and Welling 2016) etc.”
- Power Iterated Color Refinement (2014, background): “We now combine this sandwiching behavior with a seminal result due to Boldi et al. (2006). They have proven that the steady state distribution of any Markov chain with restart induced by G also induces a condensation of D∗.”
- The query-flow graph: model and applications (2008, background): “Although A is not ergodic in general, as proven in [5] A is unichain as long as α ∈ [0 .”