REVIEW 2 cited by
Consensus on Dynamic Stochastic Block Models: Fast Convergence and Phase Transitions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We introduce two models of consensus following a majority rule on time-evolving stochastic block models (SBM), in which the network evolution is Markovian or non-Markovian. Under the majority rule, in each round, each agent simultaneously updates their opinion according to the majority of their neighbors. Our network has a community structure and randomly evolves with time. In contrast to the classic setting, the dynamics is not purely deterministic, and reflects the structure of SBM by resampling the connections at each step, making agents with the same opinion more likely to connect than those with different opinions. In the Markovian model, connections between agents are resampled at each step according to the SBM law and each agent updates their opinion via the majority rule. We prove a power-of-one type result, i.e., any initial bias leads to a non-trivial advantage of winning in the end, uniformly in the size of the network. In the non-Markovian model, a connection between two agents is resampled according to the SBM law only when at least one of them changes opinion and is otherwise kept the same. We identify the phase-transition threshold, up to the second-order leading term, between halting and fast convergence to consensus. We also give sufficient initial-lead conditions for consensus to occur within one, two, or three rounds.
Forward citations
Cited by 2 Pith papers
-
Majority Dynamics on Resampled Sparse Erd\H{o}s--R\'enyi Graphs: Gaussian Winner Selection and Pace to Unanimity
For majority dynamics on resampled sparse Erdős-Rényi graphs, the first update performs a Gaussian coin flip that decides the winner, and unanimity follows within (1+o(1)) log N / log log N rounds.
-
Majority Dynamics on Assortative Sparse Stochastic Block Models
In assortative sparse SBMs, the weighted advantage b|B|−a|R| sets constant, N^{o(1)}, or N^{I_0+o(1)} time to majority-dynamics unanimity, with matching lower bounds away from the a/b threshold.
Discussion (0). Continue with ORCID to comment.