Diffusion centrality: a paradigm to maximize spread in social networks

DOI10.1016/J.ARTINT.2016.06.008zbMath1390.91267OpenAlexW2468419702MaRDI QIDQ322073

V. S. Subrahmanian, Sarit Kraus, Cristian Molinaro, Francesca Spezzano, Chanhyun Kang

Publication date: 14 October 2016

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2016.06.008

zbMATH Keywords

social networkslogic programmingdiffusion modelquantitative logic

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Logic programming (68N17)

Related Items (1)

Influence control method on directed weighted signed graphs with deterministic causality

Uses Software

• METIS
• ParMETIS
• SIMPATH

Cites Work

• Unnamed Item
• Qualitative analyses of communicable disease models
• Scalable influence maximization for independent cascade model in large-scale social networks
• Some results on the target set selection problem
• On influence, stable behavior, and the most influential individuals in networks: a game-theoretic approach
• The centrality index of a graph
• Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems
• Routing betweenness centrality
• On the Approximability of Influence in Social Networks
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Does financial connectedness predict crises?
• A general framework for graph sparsification
• Automata, Languages and Programming

This page was built for publication: Diffusion centrality: a paradigm to maximize spread in social networks