1 citations · 1 across the 2 of their papers we have counts for
6 papers
Using synthetic networks for parameter tuning in community detection
Liudmila Prokhorenkova
Community detection is one of the most important and challenging problems in network analysis. However, real-world networks may have very different structural properties and commun…
Clustering Properties of Spatial Preferential Attachment Model
Lenar Iskhakov, Bogumil Kaminski, Maksim Mironov +2
In this paper, we study the clustering properties of the Spatial Preferential Attachment (SPA) model introduced by Aiello et al. in 2009. This model naturally combines geometry and…
Community Detection through Likelihood Optimization: In Search of a Sound Model
Liudmila Prokhorenkova, Alexey Tikhonov
Community detection is one of the most important problems in network analysis. Among many algorithms proposed for this task, methods based on statistical inference are of particula…
PageRank in Undirected Random Graphs
Konstantin Avrachenkov, Arun Kadavankandy, Liudmila Ostroumova Prokhorenkova +1
PageRank has numerous applications in information retrieval, reputation systems, machine learning, and graph partitioning. In this paper, we study PageRank in undirected random gra…
Global clustering coefficient in scale-free weighted and unweighted networks
Liudmila Ostroumova Prokhorenkova
In this paper, we present a detailed analysis of the global clustering coefficient in scale-free graphs. Many observed real-world networks of diverse nature have a power-law degree…
Empirical Validation of the Buckley--Osthus Model for the Web Host Graph: Degree and Edge Distributions
Maxim Zhukovskiy, Dmitry Vinogradov, Yuri Pritykin +5
There has been a lot of research on random graph models for large real-world networks such as those formed by hyperlinks between web pages in the world wide web. Though largely suc…