4.8k citations · 5.1k across the 59 of their papers we have counts for
9 papers · 1 filter
Mean Field Analysis of Personalized PageRank with Implications for Local Graph Clustering
Konstantin Avrachenkov, Arun Kadavankandy, Nelly Litvak
We analyse a mean-field model of Personalized PageRank on the Erdos-Renyi random graph containing a denser planted Erdos-Renyi subgraph. We investigate the regimes where the values…
Cooperative Game Theory Approaches for Network Partitioning
Konstantin Avrachenkov, Aleksei Kondratev, Vladimir Mazalov
The paper is devoted to game-theoretic methods for community detection in networks. The traditional methods for detecting community structure are based on selecting denser subgraph…
PageRank in undirected random graphs
Konstantin Avrachenkov, Arun Kadavankandy, Liudmila Ostroumova +1
PageRank has numerous applications in information retrieval, reputation systems, machine learning, and graph partitioning.In this paper, we study PageRank in undirected random grap…
Bayesian Inference of Online Social Network Statistics via Lightweight Random Walk Crawls
Konstantin Avrachenkov, Bruno Ribeiro, Jithin K. Sreedharan
Online social networks (OSN) contain extensive amount of information about the underlying society that is yet to be explored. One of the most feasible technique to fetch informatio…
Quick Detection of High-degree Entities in Large Directed Networks
Konstantin Avrachenkov, Nelly Litvak, Liudmila Ostroumova Prokhorenkova +1
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…
Distribution and Dependence of Extremes in Network Sampling Processes
Konstantin Avrachenkov, Natalia M. Markovich, Jithin K. Sreedharan
We explore the dependence structure in the sampled sequence of large networks. We consider randomized algorithms to sample the nodes and study extremal properties in any associated…
Information dissemination processes in directed social networks
Konstantin Avrachenkov, Koen De Turck, Dieter Fiems +1
Social networks can have asymmetric relationships. In the online social network Twitter, a follower receives tweets from a followed person but the followed person is not obliged to…
Alpha current flow betweenness centrality
Konstantin Avrachenkov, Nelly Litvak, Vasily Medyanikov +1
A class of centrality measures called betweenness centralities reflects degree of participation of edges or nodes in communication between different parts of the network. The origi…
Online Myopic Network Covering
Konstantin Avrachenkov, Prithwish Basu, Giovanni Neglia +2
Efficient marketing or awareness-raising campaigns seek to recruit influential individuals -- where is the campaign budget -- that are able to cover a large target audience…