How to schedule a cascade in an arbitrary graph

DOI10.1137/130936580MaRDI QIDQ5112587zbMATH OpenOpenAlexFDO

Authors Flavio Chierichetti, Alessandro Panconesi, Jon M. Kleinberg

Publication date 31 May 2020

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://wiki.epfl.ch/edicpublic/documents/Candidacy%20exam/Kleinberg_2012_Cascades.pdf

zbMATH Keywords

favorable decisionssocial network

Mathematics Subject Classification ID

Applications of graph theory (05C90) Deterministic scheduling theory in operations research (90B35) Decision theory (91B06) Social networks; opinion dynamics (91D30)

Recommendations

• Maximizing social influence in nearly optimal time
• Optimizing spread dynamics on graphs by message passing
• Scheduling a cascade with opposing influences
• Automata, Languages and Programming
• scientific article; zbMATH DE number 6474901

Cited in

(4)

• Multi-issue social learning
• Scheduling a cascade with opposing influences
• Optimizing spread dynamics on graphs by message passing
• Information cascades on arbitrary topologies

This page was built for publication: How to schedule a cascade in an arbitrary graph

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