Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPavel Chebotarev
Person information
- unicode name: Павел Юрьевич Чеботарев
- affiliation: Russian Academy of Sciences, Institute of Control Sciences, Moscow, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i49]Vadim A. Afonkin, Pavel Chebotarev:
Majority voting is not good for heaven or hell, with mirrored performance. CoRR abs/2401.00592 (2024)- 2023
- [j27]Pavel Chebotarev
:
Selection of centrality measures using Self-consistency and Bridge axioms. J. Complex Networks 11(5) (2023) - [j26]Pavel Chebotarev, David Peleg:
The power of small coalitions under two-tier majority on regular graphs. Discret. Appl. Math. 340: 239-258 (2023) - [j25]Sergey E. Parsegov, Pavel Yu. Chebotarev, Pavel Shcherbakov, Federico Martin Ibanez:
Hierarchical Cyclic Pursuit: Algebraic Curves Containing the Laplacian Spectra. IEEE Trans. Control. Netw. Syst. 10(4): 1720-1731 (2023) - [i48]Pavel Chebotarev:
Selection of Centrality Measures Using Self-Consistency and Bridge Axioms. CoRR abs/2301.00084 (2023) - 2022
- [i47]Vladimir Ivashkin, Pavel Chebotarev:
Dissecting graph measure performance for node clustering in LFR parameter space. CoRR abs/2202.09827 (2022) - [i46]Sergey E. Parsegov, Pavel Yu. Chebotarev, Pavel S. Shcherbakov, Federico Martin Ibanez:
Hierarchical Cyclic Pursuit: Algebraic Curves Containing the Laplacian Spectra. CoRR abs/2209.12178 (2022) - [i45]Pavel Chebotarev, David Peleg:
The Power of Small Coalitions under Two-Tier Majority on Regular Graphs. CoRR abs/2210.03410 (2022) - [i44]Pavel Chebotarev:
Extending Utility Functions on Arbitrary Sets. CoRR abs/2212.03394 (2022) - 2021
- [j24]Rinat Aynulin, Pavel Chebotarev:
Extending Proximity Measures to Attributed Networks for Community Detection. Complex Syst. 30(4): 441-455 (2021) - [c6]Vladimir Ivashkin, Pavel Chebotarev:
Dissecting Graph Measure Performance for Node Clustering in LFR Parameter Space. COMPLEX NETWORKS 2021: 328-341 - [i43]Rinat Aynulin, Pavel Chebotarev:
Measuring Proximity in Attributed Networks for Community Detection. CoRR abs/2111.03089 (2021) - 2020
- [j23]V. M. Maksimov, Pavel Yu. Chebotarev:
Voting Originated Social Dynamics: Quartile Analysis of Stochastic Environment Peculiarities. Autom. Remote. Control. 81(10): 1865-1883 (2020) - [j22]Pavel Chebotarev, Elena Deza:
Hitting time quasi-metric and its forest representation. Optim. Lett. 14(2): 291-307 (2020) - [c5]Rinat Aynulin, Pavel Chebotarev:
Measuring Proximity in Attributed Networks for Community Detection. COMPLEX NETWORKS (1) 2020: 27-37 - [i42]Pavel Chebotarev, Dmitry A. Gubanov:
How to choose the most appropriate centrality measure? CoRR abs/2003.01052 (2020)
2010 – 2019
- 2019
- [j21]Victor S. Kozyakin, Nikolaj A. Kuznetsov, Pavel Yu. Chebotarev:
Consensus in Asynchronous Multiagent Systems. I. Asynchronous Consensus Models. Autom. Remote. Control. 80(4): 593-623 (2019) - [j20]Victor S. Kozyakin, Nikolaj A. Kuznetsov, Pavel Yu. Chebotarev:
Consensus in Asynchronous Multiagent Systems. II. Method of Joint Spectral Radius. Autom. Remote. Control. 80(5): 791-812 (2019) - [j19]Victor S. Kozyakin, Nikolaj A. Kuznetsov, Pavel Yu. Chebotarev:
Consensus in Asynchronous Multiagent Systems. III. Constructive Stability and Stabilizability. Autom. Remote. Control. 80(6): 989-1015 (2019) - [j18]Michel Deza, Pavel Chebotarev:
Protometrics. Eur. J. Comb. 80: 43-46 (2019) - [j17]Konstantin Avrachenkov, Pavel Chebotarev, Dmytro Rubanov:
Similarities on graphs: Kernels versus proximity measures. Eur. J. Comb. 80: 47-56 (2019) - [i41]Natalia Basimova, Pavel Chebotarev:
Clustering as a means of leader selection in consensus networks. CoRR abs/1912.00437 (2019) - 2018
- [j16]Pavel Yu. Chebotarev, Vitaly A. Malyshev, Yana Yu. Tsodikova, Anton K. Loginov, Zoya M. Lezina, Vadim A. Afonkin:
The Optimal Majority Threshold as a Function of the Variation Coefficient of the Environment. Autom. Remote. Control. 79(4): 725-736 (2018) - [j15]Pavel Yu. Chebotarev, Yana Yu. Tsodikova, Anton K. Loginov, Zoya M. Lezina, Vadim A. Afonkin, Vitaly A. Malyshev:
Comparative Efficiency of Altruism and Egoism as Voting Strategies in Stochastic Environment. Autom. Remote. Control. 79(11): 2052-2072 (2018) - [i40]Pavel Yu. Chebotarev, Vitaly A. Malyshev, Yana Yu. Tsodikova, Anton K. Loginov, Zoya M. Lezina, Vadim A. Afonkin:
The Optimal Majority Threshold as a Function of the Variation Coefficient of the Environment. CoRR abs/1801.06897 (2018) - [i39]Pavel Chebotarev, Yana Yu. Tsodikova, Anton K. Loginov, Zoya M. Lezina, Vadim A. Afonkin, Vitaly A. Malyshev:
Comparative Efficiency of Altruism and Egoism as Voting Strategies in Stochastic Environment. CoRR abs/1809.10766 (2018) - [i38]Sergey Parsegov, Pavel Chebotarev:
Second-Order Agents on Ring Digraphs. CoRR abs/1811.09306 (2018) - [i37]Rafig Agaev, Pavel Chebotarev:
Two Models of Latent Consensus in Multi-Agent Systems. CoRR abs/1811.10430 (2018) - 2017
- [j14]Rafig P. Agaev, Pavel Yu. Chebotarev:
Models of latent consensus. Autom. Remote. Control. 78(1): 88-99 (2017) - [j13]Vitaly A. Malyshev, Pavel Yu. Chebotarev:
On optimal group claims at voting in a stochastic environment. Autom. Remote. Control. 78(6): 1087-1100 (2017) - [j12]Konstantin Avrachenkov, Pavel Yu. Chebotarev, Alexey Mishenin:
Semi-supervised learning with regularized Laplacian. Optim. Methods Softw. 32(2): 222-236 (2017) - [c4]Konstantin Avrachenkov, Pavel Chebotarev, Dmytro Rubanov:
Kernels on Graphs as Proximity Measures. WAW 2017: 27-41 - [i36]Vitaly A. Malyshev, Pavel Yu. Chebotarev:
On Optimal Group Claims at Voting in a Stochastic Environment. CoRR abs/1706.05839 (2017) - 2016
- [i35]Vladimir Ivashkin, Pavel Chebotarev:
Logarithmic proximity measures outperform plain ones in graph nodes clustering. CoRR abs/1605.01046 (2016) - [i34]Rafig P. Agaev, Pavel Yu. Chebotarev:
Models of latent consensus. CoRR abs/1612.05201 (2016) - 2015
- [j11]Rafig P. Agaev, Pavel Yu. Chebotarev:
The projection method for continuous-time consensus seeking. Autom. Remote. Control. 76(8): 1436-1445 (2015) - [i33]Rafig P. Agaev, Pavel Yu. Chebotarev:
The projection method for continuous-time consensus seeking. CoRR abs/1507.04177 (2015) - [i32]Konstantin Avrachenkov, Pavel Chebotarev, Alexey Mishenin:
Semi-supervised Learning with Regularized Laplacian. CoRR abs/1508.04906 (2015) - 2014
- [j10]Pavel Chebotarev, Rafig Agaev:
The Forest Consensus Theorem. IEEE Trans. Autom. Control. 59(9): 2475-2479 (2014) - 2013
- [c3]Pavel Chebotarev:
Studying New Classes of Graph Metrics. GSI 2013: 207-214 - [c2]Pavel Chebotarev, Rafig Agaev:
Matrices of Forests, Analysis of Networks, and Ranking Problems. ITQM 2013: 1134-1141 - [c1]Pavel Yu. Chebotarev, Rafig P. Agaev:
The Projection Method for Reaching Consensus in Discrete-Time Multiagent Systems. MIM 2013: 1158-1163 - [p1]Pavel Chebotarev, Michel Deza:
A Topological Interpretation of the Walk Distances. Distance Geometry 2013: 121-135 - [i31]Pavel Chebotarev, Rafig Agaev:
The forest consensus theorem. CoRR abs/1301.1848 (2013) - [i30]Pavel Chebotarev, Rafig Agaev:
Matrices of forests, analysis of networks, and ranking problems. CoRR abs/1305.6441 (2013) - [i29]Pavel Chebotarev:
Studying new classes of graph metrics. CoRR abs/1305.7514 (2013) - [i28]Pavel Yu. Chebotarev, Zoya M. Lezina, Anton K. Loginov, Yana Yu. Tsodikova:
The effectiveness of altruistic lobbying: A model study. CoRR abs/1307.0284 (2013) - 2012
- [j9]Pavel Chebotarev:
The walk distances in graphs. Discret. Appl. Math. 160(10-11): 1484-1500 (2012) - 2011
- [j8]Pavel Chebotarev:
The graph bottleneck identity. Adv. Appl. Math. 47(3): 403-413 (2011) - [j7]Pavel Chebotarev:
A class of graph-geodetic distances generalizing the shortest-path and the resistance distances. Discret. Appl. Math. 159(5): 295-302 (2011) - [i27]Pavel Chebotarev:
The walk distances in graphs. CoRR abs/1103.2059 (2011) - [i26]Pavel Yu. Chebotarev, Anton K. Loginov, Yana Yu. Tsodikova, Zoya M. Lezina, V. I. Borzenko:
Voting in a Stochastic Environment: The Case of Two Groups. CoRR abs/1105.0510 (2011) - [i25]Rafig P. Agaev, Pavel Yu. Chebotarev:
The Projection Method for Reaching Consensus and the Regularized Power Limit of a Stochastic Matrix. CoRR abs/1109.3948 (2011) - [i24]Pavel Chebotarev, Michel Deza:
A topological interpretation of the walk distances. CoRR abs/1111.0284 (2011) - [i23]Pavel Chebotarev, R. B. Bapat, R. Balaji:
Simple expressions for the long walk distance. CoRR abs/1112.0088 (2011) - [i22]Rafig Agaev, Pavel Chebotarev:
A Cyclic Representation of Discrete Coordination Procedures. CoRR abs/1112.0404 (2011) - 2010
- [j6]Rafig Agaev, Pavel Chebotarev:
Which digraphs with ring structure are essentially cyclic? Adv. Appl. Math. 45(2): 232-251 (2010) - [j5]Pavel Chebotarev:
Comments on "Consensus and cooperation in networked multi-agent systems". Proc. IEEE 98(7): 1353-1354 (2010) - [i21]Pavel Chebotarev:
The graph bottleneck identity. CoRR abs/1003.3904 (2010) - [i20]Pavel Yu. Chebotarev, Anton K. Loginov, Yana Yu. Tsodikova, Zoya M. Lezina, V. I. Borzenko:
Analysis of Collectivism and Egoism Phenomena within the Context of Social Welfare. CoRR abs/1006.0741 (2010) - [i19]Pavel Chebotarev:
Comments on "Consensus and Cooperation in Networked Multi-Agent Systems". CoRR abs/1009.6050 (2010)
2000 – 2009
- 2009
- [i18]Pavel Chebotarev, Rafig Agaev:
Coordination in multiagent systems and Laplacian spectra of digraphs. CoRR abs/0902.4098 (2009) - [i17]Pavel Chebotarev:
On graph theoretic results underlying the analysis of consensus in multi-agent systems. CoRR abs/0902.4218 (2009) - [i16]V. I. Borzenko, Zoya M. Lezina, Anton K. Loginov, Yana Yu. Tsodikova, Pavel Yu. Chebotarev:
Strategies of Voting in Stochastic Environment: Egoism and Collectivism. CoRR abs/0902.4460 (2009) - [i15]Pavel Chebotarev:
Analytical Expression of the Expected Values of Capital at Voting in the Stochastic Environment. CoRR abs/0902.4514 (2009) - [i14]Rafig Agaev, Pavel Chebotarev:
Which Digraphs with Ring Structure are Essentially Cyclic? CoRR abs/0910.3113 (2009) - 2008
- [j4]Pavel Chebotarev:
Spanning forests and the golden ratio. Discret. Appl. Math. 156(5): 813-821 (2008) - [i13]Pavel Chebotarev:
A Class of Graph-Geodetic Distances Generalizing the Shortest-Path and the Resistance Distances. CoRR abs/0810.2717 (2008) - 2006
- [i12]Rafig Agaev, Pavel Chebotarev:
The Matrix of Maximum Out Forests of a Digraph and Its Applications. CoRR abs/math/0602059 (2006) - [i11]Rafig Agaev, Pavel Chebotarev:
Spanning Forests of a Digraph and Their Applications. CoRR abs/math/0602061 (2006) - [i10]Pavel Chebotarev, Elena Shamis:
The Matrix-Forest Theorem and Measuring Relations in Small Social Groups. CoRR abs/math/0602070 (2006) - [i9]Pavel Chebotarev, Elena Shamis:
On Proximity Measures for Graph Vertices. CoRR abs/math/0602073 (2006) - [i8]Pavel Chebotarev, Elena Shamis:
Preference fusion when the number of alternatives exceeds two: indirect scoring procedures. CoRR abs/math/0602171 (2006) - [i7]Pavel Chebotarev, Elena Shamis:
Characterizations of scoring methods for preference aggregation. CoRR abs/math/0602522 (2006) - [i6]Pavel Chebotarev, Elena Shamis:
From Incomplete Preferences to Ranking via Optimization. CoRR abs/math/0602552 (2006) - [i5]Pavel Chebotarev, Elena Shamis:
The Forest Metric for Graph Vertices. CoRR abs/math/0602573 (2006) - [i4]Pavel Chebotarev, Elena Shamis:
Matrix-Forest Theorems. CoRR abs/math/0602575 (2006) - 2005
- [i3]Pavel Chebotarev, Rafig Agaev:
Matrices of Forests and the Analysis of Digraphs. CoRR abs/math/0508171 (2005) - [i2]Pavel Chebotarev, Elena Shamis:
On a Duality between Metrics and Σ-Proximities. CoRR abs/math/0508183 (2005) - [i1]Pavel Chebotarev:
Extending Utility Representations of Partial Orders. CoRR abs/math/0508199 (2005) - 2002
- [j3]Pavel Chebotarev, Elena Shamis:
The Forest Metrics for Graph Vertices. Electron. Notes Discret. Math. 11: 98-107 (2002) - [j2]Pavel Chebotarev:
Spanning Forests of Digraphs and Limiting Probabilities of Markov Chains. Electron. Notes Discret. Math. 11: 108-116 (2002)
1990 – 1999
- 1998
- [j1]Pavel Yu. Chebotarev, Elena Shamis:
Characterizations of scoring methodsfor preference aggregation. Ann. Oper. Res. 80: 299-332 (1998)
Coauthor Index
aka: Rafig Agaev
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
