Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Quick Detection of High-degree Entities in Large Directed Networks

Abstract : In this paper, we address the problem of quick detection of high-degree entities in large online social networks. Practical importance of this problem is attested by a large number of companies that continuously collect and update statistics about popular entities, usually using the degree of an entity as an approximation of its popularity. We suggest a simple, efficient, and easy to implement two-stage randomized algorithm that provides highly accurate solutions for this problem. For instance, our algorithm needs only one thousand API requests in order to find the top-100 most followed users in Twitter, a network with approximately a billion of registered users, with more than 90% precision. Our algorithm significantly outperforms existing methods and serves many different purposes, such as finding the most popular users or the most popular interest groups in social networks. We show that the complexity of the algorithm is sublinear in the network size, and that high efficiency is achieved in networks with high variability among the entities, expressed through heavy-tailed distributions.
Document type :
Conference papers
Complete list of metadata
Contributor : Konstantin Avrachenkov Connect in order to contact the contributor
Submitted on : Wednesday, December 17, 2014 - 12:33:23 PM
Last modification on : Thursday, January 20, 2022 - 4:13:05 PM

Links full text




Konstantin Avrachenkov, Nelly Litvak, Liudmila Ostroumova, Euvgenia Suyargulova. Quick Detection of High-degree Entities in Large Directed Networks. ICDM 2014 - IEEE International Conference on Data Mining, Dec 2014, Shenzhen, China. pp.20 - 29 ⟨10.1109/ICDM.2014.95⟩. ⟨hal-01096353⟩



Record views