Person:276766: Difference between revisions

From MaRDI portal
Person:276766
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Pavel Yu. Chebotarev to Pavel Yu. Chebotarev: Duplicate
 
(One intermediate revision by the same user not shown)
(No difference)

Latest revision as of 14:01, 7 December 2023

Available identifiers

zbMath Open chebotarev.pavel-yuMaRDI QIDQ276766

List of research outcomes





PublicationDate of PublicationType
Selection of centrality measures using self-consistency and bridge axioms2024-11-08Paper
The power of small coalitions under two-tier majority on regular graphs2023-09-14Paper
Selection of Centrality Measures Using Self-Consistency and Bridge Axioms2022-12-30Paper
Kernels on Graphs as Proximity Measures2022-11-04Paper
Dissecting graph measure performance for node clustering in LFR parameter space2022-10-25Paper
Extending Proximity Measures to Attributed Networks for Community Detection2022-04-07Paper
Voting originated social dynamics: quartile analysis of stochastic environment peculiarities2021-01-09Paper
Hitting time quasi-metric and its forest representation2020-04-27Paper
How to choose the most appropriate centrality measure? A decision tree approach2020-03-02Paper
Consensus in asynchronous multiagent systems. I: Asynchronous consensus models2020-01-27Paper
Consensus in asynchronous multiagent systems. III: Constructive stability and stabilizability2020-01-27Paper
Consensus in asynchronous multiagent systems. II: Method of joint spectral radius2019-08-22Paper
Protometrics2019-07-10Paper
Similarities on graphs: kernels versus proximity measures2019-07-10Paper
Comparative efficiency of altruism and egoism as voting strategies in stochastic environment2019-02-05Paper
The optimal majority threshold as a function of the variation coefficient of the environment2018-10-17Paper
Do Logarithmic Proximity Measures Outperform Plain Ones in Graph Clustering?2018-02-14Paper
On optimal group claims at voting in a stochastic environment2017-08-31Paper
Models of latent consensus2017-07-07Paper
Semi-supervised learning with regularized Laplacian2017-06-21Paper
The Forest Consensus Theorem2017-05-16Paper
The projection method for continuous-time consensus seeking2016-05-04Paper
A cyclic representation of discrete coordination procedures2015-03-13Paper
Studying New Classes of Graph Metrics2014-04-16Paper
Simple expressions for the long walk distance2014-01-21Paper
The projection method for reaching consensus and the regularized power limit of a stochastic matrix2013-08-02Paper
A Topological Interpretation of the Walk Distances2013-07-29Paper
Matrices of forests, analysis of networks, and ranking problems2013-05-28Paper
The walk distances in graphs2012-06-18Paper
Voting in a stochastic environment: the case of two groups2011-11-25Paper
Addendum to: ``On determining the eigenprojection and components of a matrix2011-11-24Paper
The graph bottleneck identity2011-10-10Paper
A class of graph-geodetic distances generalizing the shortest-path and the resistance distances2011-03-10Paper
Analysis of collectivism and egoism phenomena within the context of social welfare2011-01-03Paper
Which digraphs with ring structure are essentially cyclic?2010-07-13Paper
Coordination in multiagent systems and Laplacian spectra of digraphs2009-06-30Paper
A Graph Bottleneck Inequality2008-10-15Paper
Spanning forests and the golden ratio2008-03-18Paper
Strategies of voting in stochastic environment: egoism and collectivism2007-10-23Paper
Analytical expression of the expected values of capital at voting in the stochastic environment2007-10-23Paper
A graph theoretic interpretation of the mean first passage times2007-01-12Paper
https://portal.mardi4nfdi.de/entity/Q57085612005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q57085622005-11-18Paper
Laplace spectra of orgraphs and their applications2005-08-08Paper
Spanning forests of a digraph and their applications2005-06-17Paper
On determining the eigenprojection and components of a matrix2005-06-17Paper
On the spectra of nonsymmetric Laplacian matrices2005-04-21Paper
On proximity measures for graph vertices2004-10-19Paper
Erratum: ``On the duality of metrics and \(\Sigma\)-proximities2004-10-19Paper
On a duality between metrics and \(\Sigma\)-proximities2004-10-19Paper
The matrix of maximum out forests of a digraph and its applications2004-10-18Paper
The forest metrics of a graph and their properties2004-10-18Paper
Forest matrices around the Laplacian matrix2003-02-05Paper
https://portal.mardi4nfdi.de/entity/Q45463562002-08-20Paper
Preference fusion when the number of alternatives exceeds two: Indirect scoring procedures2001-03-07Paper
The matrix-forest theorem and measuring relations in small social groups1999-07-04Paper
Characterizations of scoring methods for preference aggregation1999-03-02Paper
https://portal.mardi4nfdi.de/entity/Q43630091997-11-13Paper
Aggregation of preferences by the generalized row sum method1997-09-17Paper
Generalization of the row sum method for incomplete paired comparisons1989-01-01Paper
Some properties of paths in the dynamic voting problem1986-01-01Paper

Research outcomes over time

This page was built for person: Pavel Yu. Chebotarev