185 citations · 1k across the 50 of their papers we have counts for
51 papers
Extending Utility Functions on Arbitrary Sets
Pavel Chebotarev
We consider the problem of extending a function defined on a subset of an arbitrary set to strictly monotonically with respect to a preorder def…
The Power of Small Coalitions under Two-Tier Majority on Regular Graphs
Pavel Chebotarev, David Peleg
In this paper, we study the following problem. Consider a setting where a proposal is offered to the vertices of a given network , and the vertices must conduct a vote and decid…
Hierarchical Cyclic Pursuit: Algebraic Curves Containing the Laplacian Spectra
Sergei E. Parsegov, Pavel Yu. Chebotarev, Pavel S. Shcherbakov +1
The paper addresses the problem of multi-agent communication in networks with regular directed ring structure. These can be viewed as hierarchical extensions of the classical cycli…
Dissecting graph measure performance for node clustering in LFR parameter space
Vladimir Ivashkin, Pavel Chebotarev
Graph measures that express closeness or distance between nodes can be employed for graph nodes clustering using metric clustering algorithms. There are numerous measures applicabl…
Measuring Proximity in Attributed Networks for Community Detection
Rinat Aynulin, Pavel Chebotarev
Proximity measures on graphs have a variety of applications in network analysis, including community detection. Previously they have been mainly studied in the context of networks…
How to choose the most appropriate centrality measure? A decision tree approach
Pavel Chebotarev, Dmitry Gubanov
Centrality metrics play a crucial role in network analysis, while the choice of specific measures significantly influences the accuracy of conclusions as each measure represents a…