10 citations · 11 across the 3 of their papers we have counts for
6 papers
On the Stability of the Independence Number of the Distance Graph G(n,r,<s) for Growing r and s
Vsevolod A. Pokhachevskiy, Andrei Raigorodskii
We consider a random subgraph G_p(n,r,<s) of the complete distance graph G(n,r,<s) whose vertices are the r-element subsets of the set {1,...,n} and whose edges join pairs of subse…
On the Stability of the Independence Number in Random Distance Graphs
Vsevolod A. Pokhachevskiy, Andrei Raigorodskii
We consider a random subgraph of the complete distance graph whose vertices are the -element subsets of the set and whose edges join pa…
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…
Modularity of complex networks models
Liudmila Ostroumova Prokhorenkova, Pawel Pralat, Andrei Raigorodskii
Modularity is designed to measure the strength of division of a network into clusters (known also as communities). Networks with high modularity have dense connections between the…
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…
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…