Phase transition of the k-majority dynamics in biased communication models
-
Published:2023-03-15
Issue:2
Volume:36
Page:107-135
-
ISSN:0178-2770
-
Container-title:Distributed Computing
-
language:en
-
Short-container-title:Distrib. Comput.
Author:
Cruciani EmilioORCID, Mimun Hlafo AlfieORCID, Quattropani MatteoORCID, Rizzo SaraORCID
Abstract
AbstractConsider a graph where each of the n nodes is either in state $$\mathcal {R}$$
R
or $$\mathcal {B}$$
B
. Herein, we analyze the synchronousk-Majoritydynamics, where in each discrete-time round nodes simultaneously sample k neighbors uniformly at random with replacement and adopt the majority state among those of the nodes in the sample (breaking ties uniformly at random). Differently from previous work, we study the robustness of the k-Majority in maintaining a$$\mathcal {R}$$
R
majority, when the dynamics is subject to two forms of bias toward state $$\mathcal {B}$$
B
. The bias models an external agent that attempts to subvert the initial majority by altering the communication between nodes, with a probability of success p in each round: in the first form of bias, the agent tries to alter the communication links by transmitting state $$\mathcal {B}$$
B
; in the second form of bias, the agent tries to corrupt nodes directly by making them update to $$\mathcal {B}$$
B
. Our main result shows a sharp phase transition in both forms of bias. By considering initial configurations in which every node has probability $$q \in (\frac{1}{2},1]$$
q
∈
(
1
2
,
1
]
of being in state $$\mathcal {R}$$
R
, we prove that for every $$k\ge 3$$
k
≥
3
there exists a critical value $$p_{k,q}^\star $$
p
k
,
q
⋆
such that, with high probability, the external agent is able to subvert the initial majority either in $$n^{\omega (1)}$$
n
ω
(
1
)
rounds, if $$p<p_{k,q}^\star $$
p
<
p
k
,
q
⋆
, or in O(1) rounds, if $$p>p_{k,q}^\star $$
p
>
p
k
,
q
⋆
. When $$k<3$$
k
<
3
, instead, no phase transition phenomenon is observed and the disruption happens in O(1) rounds for $$p>0$$
p
>
0
.
Funder
Paris Lodron University of Salzburg
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference58 articles.
1. Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. Distrib. Comput. 21(2), 87–102 (2008) 2. Amir, G., Baldasso, R., Beilin, N.: Majority dynamics and the median process: connections, convergence and some new conjectures. Stoch. Process. Appl. 155, 437–458 (2023) 3. Anagnostopoulos, A., Becchetti, L., Cruciani, E., Pasquale, F., Rizzo, S.: Biased opinion dynamics: when the devil is in the details. Inf. Sci. 593, 49–63 (2022) 4. Abdullah, M.A., Bode, M., Fountoulakis, N.: Local majority dynamics on preferential attachment graphs. In: Gleich, D.F., Komjáthy, J., Litvak, N. (eds.) Algorithms and Models for the Web Graph—12th International Workshop, WAW 2015, Eindhoven, The Netherlands, December 10–11, 2015, Proceedings, vol. 9479 of Lecture Notes in Computer Science, pp. 95–106. Springer (2015) 5. Abdullah, M.A., Draief, M.: Global majority consensus by local majority polling on graphs of a given degree sequence. Discret. Appl. Math. 180, 1–10 (2015)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Malware Detection By Distributed Systems with Partial Centralization;2023 IEEE 12th International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS);2023-09-07
|
|