Fast leader selection for opinion maximization in signed graphs
From MaRDI portal
Cites work
- A Supermodular Optimization Framework for Leader Selection Under Link Noise in Linear Multi-Agent Systems
- Algorithms for Leader Selection in Stochastically Forced Consensus Networks
- Consensus Problems on Networks With Antagonistic Interactions
- Determinant-preserving sparsification of SDDM matrices with applications to counting and sampling spanning trees
- Fully dynamic spectral vertex sparsifiers and applications
- Generalized opinion dynamics model for social trust networks
- Message Passing Optimization of Harmonic Influence Centrality
- Minimizing Convergence Error in Multi-Agent Systems Via Leader Selection: A Supermodular Optimization Approach
- Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
- Opinion dynamics and the evolution of social power in influence networks
- Opinion Dynamics in Social Networks With Hostile Camps: Consensus vs. Polarization
- Opinion dynamics with the increasing peer pressure and prejudice on the signed graph
- Optimizing Leader Influence in Networks Through Selection of Direct Followers
- Optimizing opinions with stubborn agents
- Polarizability, Consensusability, and Neutralizability of Opinion Dynamics on Coopetitive Networks
- Probability Inequalities for Sums of Bounded Random Variables
- Reaching a Consensus
- Social influence and opinions
- Solving SDD linear systems in nearly \(m \log^{1/2} n\) time
- Submodular Optimization for Consensus Networks With Noise-Corrupted Leaders
This page was built for publication: Fast leader selection for opinion maximization in signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6835779)
