Access the full text.
Sign up today, get DeepDyve free for 14 days.
Paolo Boldi, Sebastiano Vigna (2014)
Axioms for centralityInternet Mathematics, 10
Stephen J. Hardiman, Liran Katzir (2013)
Estimating clustering coefficients and size of social networks via random walkProceedings of the 22nd International Conference on World Wide Web (WWW’13). ACM
Elizabeth Costenbader, Thomas W. Valente (2003)
The stability of centrality measures when networks are sampledSocial Networks, 25
Lawrence Page, Sergey Brin, Rajeev Motwani, Terry Winograd (1999)
The PageRank Citation Ranking: Bringing Order to the WebTechnical Report. Stanford InfoLab.
Matthew Richardson, Pedro Domingos (2002)
Mining knowledge-sharing sites for viral marketingProceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’02). ACM
Sören Auer, Christian Bizer, Georgi Kobilarov, Jens Lehmann, Richard Cyganiak, Zachary Ives (2007)
Dbpedia: A nucleus for a web of open dataThe Semantic Web. Springer
Shiyu Ji, Zenghui Yan (2016)
Refining approximating betweenness centrality based on samplingsarXiv preprint arXiv:1608.04472 (2016).
Stephen P. Borgatti, Kathleen M. Carley, David Krackhardt (2006)
On the robustness of centrality measures under conditions of imperfect dataSocial Networks, 28
Claudia Wagner, Philipp Singer, Fariba Karimi, Jürgen Pfeffer, Markus Strohmaier (2017)
Sampling from Social Networks with AttributesProceedings of the 26th International Conference on World Wide Web (WWW’17)
Lin Zhu, N. Menzies, Jianing Wang, B. Linas, S. Goodreau, J. Salomon (2020)
Estimation and correction of bias in network simulations based on respondent-driven sampling dataScientific Reports, 10
Wassily Hoeffding (1963)
Probability inequalities for sums of bounded random variablesJournal of the American Statistical Association, 58
Toshiki Matsumura, Kenta Iwasaki, Kazuyuki Shudo (2018)
Average path length estimation of social networks by random walkProceedings of the 2018 IEEE International Conference on Big Data and Smart Computing (BigComp’18). IEEE, 2018
Michele Benzi, Christine Klymko (2013)
Total communicability as a centrality measureJournal of Complex Networks, 1
David Kempe, Jon Kleinberg, Éva Tardos (2003)
Maximizing the spread of influence through a social networkProceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’03). ACM
Phillip Bonacich (1972)
Factoring and weighting approaches to status scores and clique identificationJournal of Mathematical Sociology, 2
Livemocha network dataset – KONECT
Retrieved from http://konect.uni-koblenz.de/networks/livemocha.
Sang Hoon Lee, Pan-Jun Kim, Hawoong Jeong (2006)
Statistical properties of sampled networksPhysical Review E, 73
Leo Katz (1953)
A new status index derived from sociometric analysisPsychometrika, 18
Nesreen K. Ahmed, Jennifer Neville, Ramana Kompella (2010)
Reconsidering the foundations of network samplingProceedings of the 2nd Workshop on Information in Networks (WIN’10).
Jure Leskovec, Christos Faloutsos (2006)
Sampling from large graphsProceedings of the 12th International Conference on Knowledge Discovery and Data Mining (KDD’06). ACM
Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri (2018)
Provable and practical approximations for the degree distribution using sublinear graph samplesProceedings of the 27th International Conference on World Wide Web (WWW’18)
Nesreen K. Ahmed, Jennifer Neville, Ramana Kompella (2014)
Network sampling: From static to streaming graphsACM Transactions on Knowledge Discovery from Data, 8
Roohollah Etemadi, Jianguo Lu (2017)
Bias correction in clustering coefficient estimationProceedings of the IEEE International Conference on Big Data (Big Data’17). IEEE
Arun S. Maiya, Tanya Y. Berger-Wolf (2011)
Benefits of bias: Towards better characterization of network samplingProceedings of the 17th International Conference on Knowledge Discovery and Data Mining (KDD’11). ACM
Jing Zhao, Ting-Hong Yang, Yongxu Huang, Petter Holme (2011)
Ranking candidate disease genes from gene expression and protein interaction: A Katz-centrality based approachPLoS ONE, 6
Tomasz Was, Oskar Skibski (2018)
An axiomatization of the Eigenvector and Katz centralitiesProceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI’18).
D. Eppstein, Joseph Wang (2000)
Fast approximation of centralityArXiv, cs.DS/0009005
Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, Michael W. Mahoney (2008)
Statistical properties of community structure in large social and information networksProceedings of the 17th International Conference on World Wide Web (WWW’08). ACM
Matteo Riondato, Evgenios M. Kornaropoulos (2016)
Fast approximation of betweenness centrality through samplingData Mining and Knowledge Discovery, 30
Wei Chen, Shang-Hua Teng (2017)
Interplay between social influence and network centrality: A comparative study on Shapley centrality and single-node-influence centralityProceedings of the 26th International Conference on World Wide Web (WWW’17). International World Wide Web Conferences Steering Committee
Eisha Nathan, Geoffrey Sanders, James Fairbanks, David A. Bader (2017)
Graph ranking guarantees for numerical approximations to Katz centralityInternational Conference on Computational Science (ICCS’17)
Alireza Rezvanian, Behnaz Moradabadi, Mina Ghavipour, Mohammad Mehdi Daliri Khomami, Mohammad Reza Meybodi (2019)
Social network samplingLearning Automata Approach for Social Networks. Springer
Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke (2018)
Scalable Katz ranking computation in large static and dynamic graphsProceedings of the 26th Annual European Symposium on Algorithms (ESA’18), 42
Lubos Takac, Michal Zabovsky (2012)
Data analysis in public social networksProceedings of the International Scientific Conference and International Workshop Present Day Trends of Innovations
Minas Gjoka, Maciej Kurant, Carter T. Butts, Athina Markopoulou (2010)
Walking in Facebook: A case study of unbiased sampling of OSNsProceedings of the 2010 IEEE Infocom. IEEE, 2010
Daniel G. Horvitz, Donovan J. Thompson (1952)
A generalization of sampling without replacement from a finite universeJournal of the American Statistical Association, 47
Kurt C. Foster, Stephen Q. Muth, John J. Potterat, Richard B. Rothenberg (2001)
A faster Katz status score algorithmComputational & Mathematical Organization Theory, 7
Mingkai Lin, Wenzhong Li, Cam-tu Nguyen, Xiaoliang Wang, Sanglu Lu (2019)
Sampling based Katz centrality estimation for large-scale social networksProceedings of the International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP’19). Springer
Eric D. Kolaczyk (2009)
Statistical Analysis of Network Data: Methods and ModelsSpringer.
Bernardete Ribeiro, Don Towsley (2012)
On the estimation accuracy of degree distributions from graph samplingProceedings of the IEEE 51st IEEE Conference on Decision and Control.
S. Ceri, A. Bozzon, Marco Brambilla, Emanuele Valle, P. Fraternali, S. Quarteroni (2013)
An Introduction to Information Retrieval
Douglas D. Heckathorn, Christopher J. Cameron (2017)
Network sampling: From snowball and multiplicity to respondent-driven samplingAnnual Review of Sociology, 43
Eisha Nathan, David A. Bader (2017)
Approximating personalized Katz centrality in dynamic graphsProceedings of the International Conference on Parallel Processing and Applied Mathematics (PPAM’17). Springer
Katz centrality is a fundamental concept to measure the influence of a vertex in a social network. However, existing approaches to calculating Katz centrality in a large-scale network are unpractical and computationally expensive. In this article, we propose a novel method to estimate Katz centrality based on graph sampling techniques, which object to achieve comparable estimation accuracy of the state-of-the-arts with much lower computational complexity. Specifically, we develop a Horvitz–Thompson estimate for Katz centrality by using a multi-round sampling approach and deriving an unbiased mean value estimator. We further propose SAKE, a Sampling-based Algorithm for fast Katz centrality Estimation. We prove that the estimator calculated by SAKE is probabilistically guaranteed to be within an additive error from the exact value. Extensive evaluation experiments based on four real-world networks show that the proposed algorithm can estimate Katz centralities for partial vertices with low sampling rate, low computation time, and it works well in identifying high influence vertices in social networks.
ACM Transactions on Knowledge Discovery from Data (TKDD) – Association for Computing Machinery
Published: Apr 18, 2021
Keywords: Katz centrality
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.