Pavel Chebotarev

Elena Deza

Optim. Lett., 2020

How to choose the most appropriate centrality measure?

[BibT_eX]

[DOI]

Dmitry A. Gubanov

CoRR, 2020

Voting Originated Social Dynamics: Quartile Analysis of Stochastic Environment Peculiarities.

[BibT_eX]

[DOI]

V. M. Maksimov

Autom. Remote. Control., 2020

Measuring Proximity in Attributed Networks for Community Detection.

[BibT_eX]

[DOI]

Rinat Aynulin

Proceedings of the Complex Networks & Their Applications IX, 2020

2019

Protometrics.

[BibT_eX]

[DOI]

Michel Deza

Eur. J. Comb., 2019

Similarities on graphs: Kernels versus proximity measures.

[BibT_eX]

[DOI]

Konstantin Avrachenkov

Dmytro Rubanov

Eur. J. Comb., 2019

Clustering as a means of leader selection in consensus networks.

[BibT_eX]

[DOI]

Natalia Basimova

CoRR, 2019

Consensus in Asynchronous Multiagent Systems. III. Constructive Stability and Stabilizability.

[BibT_eX]

[DOI]

Victor S. Kozyakin

Nikolaj A. Kuznetsov

Autom. Remote. Control., 2019

Consensus in Asynchronous Multiagent Systems. II. Method of Joint Spectral Radius.

[BibT_eX]

[DOI]

Victor S. Kozyakin

Nikolaj A. Kuznetsov

Autom. Remote. Control., 2019

Consensus in Asynchronous Multiagent Systems. I. Asynchronous Consensus Models.

[BibT_eX]

[DOI]

Victor S. Kozyakin

Nikolaj A. Kuznetsov

Autom. Remote. Control., 2019

2018

Two Models of Latent Consensus in Multi-Agent Systems.

[BibT_eX]

[DOI]

CoRR, 2018

Second-Order Agents on Ring Digraphs.

[BibT_eX]

[DOI]

Sergey Parsegov

CoRR, 2018

Comparative Efficiency of Altruism and Egoism as Voting Strategies in Stochastic Environment.

[BibT_eX]

[DOI]

Autom. Remote. Control., 2018

The Optimal Majority Threshold as a Function of the Variation Coefficient of the Environment.

[BibT_eX]

[DOI]

Autom. Remote. Control., 2018

2017

Semi-supervised learning with regularized Laplacian.

[BibT_eX]

[DOI]

Konstantin Avrachenkov

Alexey Mishenin

Optim. Methods Softw., 2017

On optimal group claims at voting in a stochastic environment.

[BibT_eX]

[DOI]

Vitaly A. Malyshev

Autom. Remote. Control., 2017

Models of latent consensus.

[BibT_eX]

[DOI]

Autom. Remote. Control., 2017

Kernels on Graphs as Proximity Measures.

[BibT_eX]

[DOI]

Konstantin Avrachenkov

Dmytro Rubanov

Proceedings of the Algorithms and Models for the Web Graph - 14th International Workshop, 2017

2016

Logarithmic proximity measures outperform plain ones in graph nodes clustering.

[BibT_eX]

[DOI]

Vladimir Ivashkin

CoRR, 2016

2015

The projection method for continuous-time consensus seeking.

[BibT_eX]

[DOI]

Autom. Remote. Control., 2015

2014

The Forest Consensus Theorem.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2014

2013

The effectiveness of altruistic lobbying: A model study.

[BibT_eX]

[DOI]

CoRR, 2013

The Projection Method for Reaching Consensus in Discrete-Time Multiagent Systems.

[BibT_eX]

[DOI]

Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

Matrices of Forests, Analysis of Networks, and Ranking Problems.

[BibT_eX]

[DOI]

Proceedings of the First International Conference on Information Technology and Quantitative Management, 2013

Studying New Classes of Graph Metrics.

[BibT_eX]

[DOI]

Proceedings of the Geometric Science of Information - First International Conference, 2013

A Topological Interpretation of the Walk Distances.

[BibT_eX]

[DOI]

Michel Deza

Proceedings of the Distance Geometry: Theory, Methods, and Applications, 2013

2012

The walk distances in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

A class of graph-geodetic distances generalizing the shortest-path and the resistance distances.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

A Cyclic Representation of Discrete Coordination Procedures

[BibT_eX]

[DOI]

CoRR, 2011

Simple expressions for the long walk distance

[BibT_eX]

[DOI]

R. B. Bapat

R. Balaji

CoRR, 2011

A topological interpretation of the walk distances

[BibT_eX]

[DOI]

Michel Deza

CoRR, 2011

The Projection Method for Reaching Consensus and the Regularized Power Limit of a Stochastic Matrix

[BibT_eX]

[DOI]

CoRR, 2011

Voting in a Stochastic Environment: The Case of Two Groups

[BibT_eX]

[DOI]

CoRR, 2011

The graph bottleneck identity.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2011

2010

Comments on "Consensus and cooperation in networked multi-agent systems".

[BibT_eX]

[DOI]

Proc. IEEE, 2010

Analysis of Collectivism and Egoism Phenomena within the Context of Social Welfare

[BibT_eX]

[DOI]

CoRR, 2010

Which digraphs with ring structure are essentially cyclic?

[BibT_eX]

[DOI]

Adv. Appl. Math., 2010

2009

Analytical Expression of the Expected Values of Capital at Voting in the Stochastic Environment

[BibT_eX]

[DOI]

CoRR, 2009

Strategies of Voting in Stochastic Environment: Egoism and Collectivism

[BibT_eX]

[DOI]

CoRR, 2009

On graph theoretic results underlying the analysis of consensus in multi-agent systems

[BibT_eX]

[DOI]

CoRR, 2009

Coordination in multiagent systems and Laplacian spectra of digraphs

[BibT_eX]

[DOI]

CoRR, 2009

2008

Spanning forests and the golden ratio.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2006

Matrix-Forest Theorems

[BibT_eX]

[DOI]

CoRR, 2006

The Forest Metric for Graph Vertices

[BibT_eX]

[DOI]

CoRR, 2006

From Incomplete Preferences to Ranking via Optimization

[BibT_eX]

[DOI]

CoRR, 2006

Characterizations of scoring methods for preference aggregation

[BibT_eX]

[DOI]

CoRR, 2006

Preference fusion when the number of alternatives exceeds two: indirect scoring procedures

[BibT_eX]

[DOI]

CoRR, 2006

On Proximity Measures for Graph Vertices

[BibT_eX]

[DOI]

CoRR, 2006

The Matrix-Forest Theorem and Measuring Relations in Small Social Groups

[BibT_eX]

[DOI]

CoRR, 2006

Spanning Forests of a Digraph and Their Applications

[BibT_eX]

[DOI]

CoRR, 2006

The Matrix of Maximum Out Forests of a Digraph and Its Applications

[BibT_eX]

[DOI]

CoRR, 2006

2005

Extending Utility Representations of Partial Orders

[BibT_eX]

[DOI]

CoRR, 2005

On a Duality between Metrics and Σ-Proximities

[BibT_eX]

[DOI]

CoRR, 2005

Matrices of Forests and the Analysis of Digraphs

[BibT_eX]

[DOI]

CoRR, 2005

2002

The Forest Metrics for Graph Vertices.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2002

Spanning Forests of Digraphs and Limiting Probabilities of Markov Chains.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2002

1998

Characterizations of scoring methodsfor preference aggregation.

[BibT_eX]

[DOI]