Minimizing the expected complete influence time of a social network
type: Item
instance of: scholarly article
title: Minimizing the expected complete influence time of a social network
zbMATH Open document ID: 1194.91164
author: Yaodong Ni
author: Lei Xie
author: Zhiqiang Liu
published in: Information Sciences
publication date: 2010-07-20T00:00:00Z
Mathematics Subject Classification ID: 91D30
zbMATH DE Number: 5758546
zbMATH Keywords: social networks
zbMATH Keywords: complete influence
zbMATH Keywords: spanning forest
zbMATH Keywords: stochastic simulation
zbMATH Keywords: greedy algorithm
MaRDI profile type: Publication
full work available at URL: j.ins.2010.03.012
OpenAlex ID: W1997561104
cites work: Statistical mechanics of complex networks
cites work: Emergence of Scaling in Random Networks
cites work: On the spread of viruses on the Internet
cites work: A faster algorithm for betweenness centrality*
cites work: Q3579502
cites work: A model for spatial conflict
cites work: Introduction to algorithms
cites work: Q3267900
cites work: Properties of on-line social systems
cites work: Ergodic theorems for weakly interacting infinite systems and the voter model
cites work: Q2941641
cites work: Automata, Languages and Programming
cites work: Q4848559
cites work: Contagion
cites work: Q3549607
cites work: Collective dynamics of ‘small-world’ networks
DOI: 10.1016/J.INS.2010.03.012
Recommended article: On the Approximability of Influence in Social Networks
Recommended article: Influence Maximization with Latency Requirements on Social Networks
Recommended article: Maximizing Social Influence in Nearly Optimal Time
Recommended article: Influence diffusion in social networks under time window constraints
Recommended article: Influence Diffusion in Social Networks under Time Window Constraints
Recommended article: Least cost influence propagation in (social) networks
Recommended article: Least-Cost Influence Maximization on Social Networks
description: scientific article; zbMATH DE number 5758546