Diffusion centrality: a paradigm to maximize spread in social networks
From MaRDI portal
Recommendations
Cites work
- A centrality measure for networks with community structure based on a generalization of the Owen value
- A general framework for graph sparsification
- Automata, Languages and Programming
- Does financial connectedness predict crises?
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- On influence, stable behavior, and the most influential individuals in networks: a game-theoretic approach
- On the approximability of influence in social networks
- Qualitative analyses of communicable disease models
- Routing betweenness centrality
- Scalable influence maximization for independent cascade model in large-scale social networks
- Some results on the target set selection problem
- The centrality index of a graph
- Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems
Cited in
(6)- Discrete preference games with logic-based agents: formal framework, complexity, and islands of tractability
- Influence control method on directed weighted signed graphs with deterministic causality
- Measuring the flow of information among cities using the diffusion power
- Non-conservative diffusion and its application to social network analysis
- Branching processes reveal influential nodes in social networks
- Diffusion and targeting centrality
This page was built for publication: Diffusion centrality: a paradigm to maximize spread in social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322073)