Zobrazeno 1 - 10
of 147
pro vyhledávání: '"Chebotarev, Pavel"'
Autor:
Afonkin, Vadim, Chebotarev, Pavel
Within the ViSE (Voting in Stochastic Environment) model, we study the effectiveness of majority voting in various environments. By the pit of losses paradox, majority decisions in apparently hostile environments systematically reduce the capital of
Externí odkaz:
http://arxiv.org/abs/2401.00592
Autor:
Chebotarev, Pavel
Publikováno v:
Journal of Complex Networks, Volume 11, Issue 5, October 2023, cnad035
We consider several families of network centrality measures induced by graph kernels, which include some well-known measures and many new ones. The Self-consistency and Bridge axioms, which appeared earlier in the literature, are closely related to c
Externí odkaz:
http://arxiv.org/abs/2301.00084
Autor:
Chebotarev, Pavel
We consider the problem of extending a function $f^{}_P$ defined on a subset $P$ of an arbitrary set $X$ to $X$ strictly monotonically with respect to a preorder $\succcurlyeq$ defined on $X$, without imposing continuity constraints. We show that whe
Externí odkaz:
http://arxiv.org/abs/2212.03394
Autor:
Chebotarev, Pavel, Peleg, David
Publikováno v:
Discrete Applied Mathematics 340 (2023) 239--258
In this paper, we study the following problem. Consider a setting where a proposal is offered to the vertices of a given network $G$, and the vertices must conduct a vote and decide whether to accept the proposal or reject it. Each vertex $v$ has its
Externí odkaz:
http://arxiv.org/abs/2210.03410
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 cyclic pursuit topology. We show that the spectra of the corresponding Lapl
Externí odkaz:
http://arxiv.org/abs/2209.12178
Autor:
Ivashkin, Vladimir, Chebotarev, Pavel
Publikováno v:
International Conference on Complex Networks and Their Applications, pp. 328-341. Springer, Cham, 2021
Graph measures that express closeness or distance between nodes can be employed for graph nodes clustering using metric clustering algorithms. There are numerous measures applicable to this task, and which one performs better is an open question. We
Externí odkaz:
http://arxiv.org/abs/2202.09827
Autor:
Aynulin, Rinat, Chebotarev, Pavel
Publikováno v:
Studies in Computational Intelligence 943 (2021) 27-37
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 without attributes. If node attributes are taken into account, however
Externí odkaz:
http://arxiv.org/abs/2111.03089
Autor:
Chebotarev, Pavel, Gubanov, Dmitry
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 unique concept of node importance. Among over 400 proposed indices, se
Externí odkaz:
http://arxiv.org/abs/2003.01052
Autor:
Basimova, Natalia, Chebotarev, Pavel
In the leader-follower approach, one or more agents are selected as leaders who do not change their states or have autonomous dynamics and can influence other agents, while the other agents, called followers, perform a simple protocol based on the st
Externí odkaz:
http://arxiv.org/abs/1912.00437
Autor:
Chebotarev, Pavel, Peleg, David
Publikováno v:
In Discrete Applied Mathematics 15 December 2023 340:239-258