Sticky Seeding in Discrete-Time Reversible-Threshold Networks
When nodes can repeatedly update their behavior (as in agent-based models from computational social science or repeated-game play settings) the problem of optimal network seeding becomes very complex. For a popular spreading-phenomena model of binary-behavior updating based on thresholds of adoption...
Main Author: | Gwen Spencer |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2016-03-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/1241/pdf |
Similar Items
-
Sticky prices or sticky information?
by: Alessio Moro
Published: (2012-04-01) -
Social media in the Global South: A Network Dataset of the Malian Twittersphere
by: Daniel Thilo Schroeder, et al.
Published: (2023-11-01) -
Neural Networks Modeling and Control : Applications for Unknown Nonlinear Delayed Systems in Discrete Time /
by: Rios, Jorge D., author 648981, et al.
Published: (2020) -
A Formal Model for Polarization under Confirmation Bias in Social Networks
by: Mário S. Alvim, et al.
Published: (2023-03-01) -
An optimized thresholding kohonen neural network for cluster analysis /
by: Ehsan Mohebi, 1982-, et al.
Published: (2010)