Expanders in models of social networks

DOI10.1007/978-3-032-11835-6_22MaRDI QIDQ7294439zbMATH OpenFDO

Authors Marc Kaufmann, Johannes Lengler, Ulysse Schaller, Konstantin Sturm

Publication date 10 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-11835-6_22

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond
• Expander graphs and their applications
• Expander graphs in pure and applied mathematics
• Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs
• Geometric inhomogeneous random graphs
• Greedy routing and the algorithmic small-world phenomenon
• High degree vertices and spread of infections in spatially modelled social networks
• Minimizing congestion in general networks
• Nearly-tight analysis for 2-choice and 3-majority consensus dynamics
• Not all interventions are equal for the height of the second peak
• On the external validity of average-case analyses of graph algorithms
• Polynomial growth in degree-dependent first passage percolation on spatial random graphs
• Quasi-majority functional voting on expander graphs
• Scale-free percolation
• Ultra-fast rumor spreading in social networks

This page was built for publication: Expanders in models of social networks

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