Pavel Chebotarev

64 papers C 1Journal 57Unranked 5

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Evolution of Society Caused by Collective and Individual Decisions - A ViSE Model Study. GDN Pavel Chebotarev
2025	J	`jnl`	Evolution of Society Caused by Collective and Individual Decisions. CoRR Pavel Chebotarev
2025	J	`jnl`	How to Choose the Most Appropriate Centrality Measure? A Decision-Tree Approach. IEEE Trans. Syst. Man Cybern. Syst. Pavel Chebotarev, Dmitry A. Gubanov
2025	J	`jnl`	Modeling society with a responsible elite. CoRR Yana Yu. Tsodikova, Pavel Chebotarev
2024	J	`jnl`	Majority voting is not good for heaven or hell, with mirrored performance. CoRR Vadim A. Afonkin, Pavel Chebotarev
2023	J	`jnl`	Selection of Centrality Measures Using Self-Consistency and Bridge Axioms. CoRR Pavel Chebotarev
2023	J	`jnl`	Selection of centrality measures using Self-consistency and Bridge axioms. J. Complex Networks Pavel Chebotarev
2023	J	`jnl`	The power of small coalitions under two-tier majority on regular graphs. Discret. Appl. Math. Pavel Chebotarev, David Peleg
2022	J	`jnl`	Dissecting graph measure performance for node clustering in LFR parameter space. CoRR Vladimir Ivashkin, Pavel Chebotarev
2022	J	`jnl`	Extending Utility Functions on Arbitrary Sets. CoRR Pavel Chebotarev
2022	J	`jnl`	The Power of Small Coalitions under Two-Tier Majority on Regular Graphs. CoRR Pavel Chebotarev, David Peleg
2021	—	`conf`	Dissecting Graph Measure Performance for Node Clustering in LFR Parameter Space. COMPLEX NETWORKS Vladimir Ivashkin, Pavel Chebotarev
2021	J	`jnl`	Extending Proximity Measures to Attributed Networks for Community Detection. Complex Syst. Rinat Aynulin, Pavel Chebotarev
2021	J	`jnl`	Measuring Proximity in Attributed Networks for Community Detection. CoRR Rinat Aynulin, Pavel Chebotarev
2020	J	`jnl`	Hitting time quasi-metric and its forest representation. Optim. Lett. Pavel Chebotarev, Elena Deza
2020	J	`jnl`	How to choose the most appropriate centrality measure? CoRR Pavel Chebotarev, Dmitry A. Gubanov
2020	—	`conf`	Measuring Proximity in Attributed Networks for Community Detection. COMPLEX NETWORKS (1) Rinat Aynulin, Pavel Chebotarev
2019	J	`jnl`	Clustering as a means of leader selection in consensus networks. CoRR Natalia Basimova, Pavel Chebotarev
2019	J	`jnl`	Protometrics. Eur. J. Comb. Michel Deza, Pavel Chebotarev
2019	J	`jnl`	Similarities on graphs: Kernels versus proximity measures. Eur. J. Comb. Konstantin Avrachenkov, Pavel Chebotarev, Dmytro Rubanov
2018	J	`jnl`	Comparative Efficiency of Altruism and Egoism as Voting Strategies in Stochastic Environment. CoRR Pavel Chebotarev, Yana Yu. Tsodikova, Anton K. Loginov, Zoya M. Lezina, Vadim A. Afonkin, Vitaly A. Malyshev
2018	J	`jnl`	Second-Order Agents on Ring Digraphs. CoRR Sergey Parsegov, Pavel Chebotarev
2018	J	`jnl`	Two Models of Latent Consensus in Multi-Agent Systems. CoRR Rafig Agaev, Pavel Chebotarev
2017	C	`conf`	Kernels on Graphs as Proximity Measures. WAW Konstantin Avrachenkov, Pavel Chebotarev, Dmytro Rubanov
2016	J	`jnl`	Logarithmic proximity measures outperform plain ones in graph nodes clustering. CoRR Vladimir Ivashkin, Pavel Chebotarev
2015	J	`jnl`	Semi-supervised Learning with Regularized Laplacian. CoRR Konstantin Avrachenkov, Pavel Chebotarev, Alexey Mishenin
2014	J	`jnl`	The Forest Consensus Theorem. IEEE Trans. Autom. Control. Pavel Chebotarev, Rafig Agaev
2013	—	`ch.`	A Topological Interpretation of the Walk Distances. Distance Geometry Pavel Chebotarev, Michel Deza
2013	—	`conf`	Matrices of Forests, Analysis of Networks, and Ranking Problems. ITQM Pavel Chebotarev, Rafig Agaev
2013	J	`jnl`	Matrices of forests, analysis of networks, and ranking problems CoRR Pavel Chebotarev, Rafig Agaev
2013	—	`conf`	Studying New Classes of Graph Metrics. GSI Pavel Chebotarev
2013	J	`jnl`	Studying new classes of graph metrics. CoRR Pavel Chebotarev
2013	J	`jnl`	The forest consensus theorem CoRR Pavel Chebotarev, Rafig Agaev
2012	J	`jnl`	The walk distances in graphs. Discret. Appl. Math. Pavel Chebotarev
2011	J	`jnl`	A Cyclic Representation of Discrete Coordination Procedures CoRR Rafig Agaev, Pavel Chebotarev
2011	J	`jnl`	A class of graph-geodetic distances generalizing the shortest-path and the resistance distances. Discret. Appl. Math. Pavel Chebotarev
2011	J	`jnl`	A topological interpretation of the walk distances CoRR Pavel Chebotarev, Michel Deza
2011	J	`jnl`	Simple expressions for the long walk distance CoRR Pavel Chebotarev, R. B. Bapat, R. Balaji
2011	J	`jnl`	The graph bottleneck identity. Adv. Appl. Math. Pavel Chebotarev
2011	J	`jnl`	The walk distances in graphs CoRR Pavel Chebotarev
2010	J	`jnl`	Comments on "Consensus and Cooperation in Networked Multi-Agent Systems" CoRR Pavel Chebotarev
2010	J	`jnl`	Comments on "Consensus and cooperation in networked multi-agent systems". Proc. IEEE Pavel Chebotarev
2010	J	`jnl`	The graph bottleneck identity CoRR Pavel Chebotarev
2010	J	`jnl`	Which digraphs with ring structure are essentially cyclic? Adv. Appl. Math. Rafig Agaev, Pavel Chebotarev
2009	J	`jnl`	Analytical Expression of the Expected Values of Capital at Voting in the Stochastic Environment CoRR Pavel Chebotarev
2009	J	`jnl`	Coordination in multiagent systems and Laplacian spectra of digraphs CoRR Pavel Chebotarev, Rafig Agaev
2009	J	`jnl`	On graph theoretic results underlying the analysis of consensus in multi-agent systems CoRR Pavel Chebotarev
2009	J	`jnl`	Which Digraphs with Ring Structure are Essentially Cyclic? CoRR Rafig Agaev, Pavel Chebotarev
2008	J	`jnl`	A Class of Graph-Geodetic Distances Generalizing the Shortest-Path and the Resistance Distances. CoRR Pavel Chebotarev
2008	J	`jnl`	Spanning forests and the golden ratio. Discret. Appl. Math. Pavel Chebotarev
2006	J	`jnl`	Characterizations of scoring methods for preference aggregation CoRR Pavel Chebotarev, Elena Shamis
2006	J	`jnl`	From Incomplete Preferences to Ranking via Optimization CoRR Pavel Chebotarev, Elena Shamis
2006	J	`jnl`	Matrix-Forest Theorems CoRR Pavel Chebotarev, Elena Shamis
2006	J	`jnl`	On Proximity Measures for Graph Vertices CoRR Pavel Chebotarev, Elena Shamis
2006	J	`jnl`	Preference fusion when the number of alternatives exceeds two: indirect scoring procedures CoRR Pavel Chebotarev, Elena Shamis
2006	J	`jnl`	Spanning Forests of a Digraph and Their Applications CoRR Rafig Agaev, Pavel Chebotarev
2006	J	`jnl`	The Forest Metric for Graph Vertices CoRR Pavel Chebotarev, Elena Shamis
2006	J	`jnl`	The Matrix of Maximum Out Forests of a Digraph and Its Applications CoRR Rafig Agaev, Pavel Chebotarev
2006	J	`jnl`	The Matrix-Forest Theorem and Measuring Relations in Small Social Groups CoRR Pavel Chebotarev, Elena Shamis
2005	J	`jnl`	Extending Utility Representations of Partial Orders CoRR Pavel Chebotarev
2005	J	`jnl`	Matrices of Forests and the Analysis of Digraphs CoRR Pavel Chebotarev, Rafig Agaev
2005	J	`jnl`	On a Duality between Metrics and Σ-Proximities CoRR Pavel Chebotarev, Elena Shamis
2002	J	`jnl`	Spanning Forests of Digraphs and Limiting Probabilities of Markov Chains. Electron. Notes Discret. Math. Pavel Chebotarev
2002	J	`jnl`	The Forest Metrics for Graph Vertices. Electron. Notes Discret. Math. Pavel Chebotarev, Elena Shamis