The Maximum Label Propagation Algorithm on Sparse Random Graphs

DOI10.4230/LIPICS.APPROX-RANDOM.2019.58MaRDI QIDQ5875518zbMATH OpenOpenAlexFDO

Authors Charlotte Knierim, Johannes Lengler, Pascal Pfister, Ulysse Schaller, Angelika Steger

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.58

zbMATH Keywords

community detectionconsensusdistributed algorithmsrandom graphslabel propagation algorithms

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites work

• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• A polylogarithmic gossip algorithm for plurality consensus
• Contagious sets in random graphs
• Distributed community detection in dynamic graphs
• Fast consensus for voting on general expander graphs
• Finding overlapping communities in networks by label propagation
• Ignore or comply? On breaking symmetry in consensus
• Nearly-tight analysis for 2-choice and 3-majority consensus dynamics
• On periodical behaviour in societies with symmetric influences
• On the Analysis of a Label Propagation Algorithm for Community Detection
• Opinion exchange dynamics
• Simple dynamics for plurality consensus
• Stabilizing Consensus with Many Opinions

Cited in

(2)

• Random graphs: combinatorics, complex networks and disordered systems. Abstracts from the workshop held March 26--31, 2023
• Probabilistic Relaxation Labeling by Fokker-Planck Diffusion on a Graph

This page was built for publication: The Maximum Label Propagation Algorithm on Sparse Random Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875518)