- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2364-8228
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Estimating PageRank deviations in crawled graphs ; volume:4 ; number:1 ; day:22 ; month:10 ; year:2019 ; pages:1-22 ; date:12.2019
Applied network science ; 4, Heft 1 (22.10.2019), 1-22, 12.2019
- Creator
-
Holzmann, Helge
Anand, Avishek
Khosla, Megha
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s41109-019-0201-9
- URN
-
urn:nbn:de:101:1-2020021601423967726317
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:51 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Holzmann, Helge
- Anand, Avishek
- Khosla, Megha
- SpringerLink (Online service)
Other Objects (12)
Estimating PageRank deviations in crawled graphs
Rank Deviations for Overpartitions
Rank deviations for overpartitions
Spectral deviations of graphs
Non-backtracking PageRank
Axioms for centrality: rank monotonicity for PageRank
Optimized relativity search: node reduction in personalized page rank estimation for large graphs
The Juxtaposed approximate PageRank method for robust PageRank approximation in a peer-to-peer web search network
Estimating the rank of the spectral density matrix
Estimating the rank of the spectral density matrix
Estimating Matching Affinity Matrix under Low-Rank Constraints
L γ -PageRank for semi-supervised learning
Estimating PageRank deviations in crawled graphs
Rank Deviations for Overpartitions
Rank deviations for overpartitions
Spectral deviations of graphs
Non-backtracking PageRank
Axioms for centrality: rank monotonicity for PageRank
Optimized relativity search: node reduction in personalized page rank estimation for large graphs
The Juxtaposed approximate PageRank method for robust PageRank approximation in a peer-to-peer web search network
Estimating the rank of the spectral density matrix
Estimating the rank of the spectral density matrix
Estimating Matching Affinity Matrix under Low-Rank Constraints
L γ -PageRank for semi-supervised learning
Estimating PageRank deviations in crawled graphs
Rank Deviations for Overpartitions
Rank deviations for overpartitions
Spectral deviations of graphs
Non-backtracking PageRank
Axioms for centrality: rank monotonicity for PageRank
Optimized relativity search: node reduction in personalized page rank estimation for large graphs
The Juxtaposed approximate PageRank method for robust PageRank approximation in a peer-to-peer web search network
Estimating the rank of the spectral density matrix
Estimating the rank of the spectral density matrix
Estimating Matching Affinity Matrix under Low-Rank Constraints