Minimizing the expected complete influence time of a social network

DOI10.1016/j.ins.2010.03.012zbMath1194.91164OpenAlexW1997561104MaRDI QIDQ985076

Yaodong Ni, Zhi-Qiang Liu, Lei Xie

Publication date: 20 July 2010

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2010.03.012

zbMATH Keywords

greedy algorithmsocial networksstochastic simulationspanning forestcomplete influence

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Related Items (1)

Fuzzy queries processing based on intuitionistic fuzzy social relational networks

Cites Work

• Properties of on-line social systems
• Ergodic theorems for weakly interacting infinite systems and the voter model
• A faster algorithm for betweenness centrality*
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Contagion
• A model for spatial conflict
• Collective dynamics of ‘small-world’ networks
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimizing the expected complete influence time of a social network