Optimizing spread dynamics on graphs by message passing
From MaRDI portal
Publication:3301689
DOI10.1088/1742-5468/2013/09/P09011zbMath1456.82420arXiv1203.1426WikidataQ61444405 ScholiaQ61444405MaRDI QIDQ3301689
Riccardo Zecchina, Luca Dall'Asta, Fabrizio Altarelli, Alfredo Braunstein
Publication date: 11 August 2020
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.1426
Related Items (13)
A closure for the master equation starting from the dynamic cavity method ⋮ Structure-oriented prediction in complex networks ⋮ Uncovering the non-equilibrium stationary properties in sparse Boolean networks ⋮ Statistical mechanics of the minimum dominating set problem ⋮ An exact method for influence maximization based on deterministic linear threshold model ⋮ Hierarchical cycle-tree packing model for optimal \(K\)-core attack ⋮ Spreading dynamics in complex networks ⋮ The patient-zero problem with noisy observations ⋮ Rewiring the network. What helps an innovation to diffuse? ⋮ A Max-Sum algorithm for training discrete neural networks ⋮ The large deviations of the whitening process in random constraint satisfaction problems ⋮ A spin glass approach to the directed feedback vertex set problem ⋮ Minimal contagious sets in random regular graphs
Cites Work
- Unnamed Item
- Combinatorial model and bounds for target set selection
- Network models and financial stability
- The complexity of influence maximization problem in the deterministic linear threshold model
- Systemic Risk in Financial Systems
- Authoritative sources in a hyperlinked environment
- Dynamical Processes on Complex Networks
- Contagion in financial networks
- Information, Physics, and Computation
- An analysis of approximations for maximizing submodular set functions—I
- A simple model of global cascades on random networks
- Algorithmic Game Theory
This page was built for publication: Optimizing spread dynamics on graphs by message passing
