A first hitting time approach to finding effective spreaders in a network
DOI10.1090/conm/759/15267zbMath1458.94003OpenAlexW3113254388MaRDI QIDQ4965258
Publication date: 26 February 2021
Published in: The Golden Anniversary Celebration of the National Association of Mathematicians (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/conm/759/15267
Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Communication theory (94A05) Random walks on graphs (05C81)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- From local averaging to emergent global behaviors: the fundamental role of network interconnections
- Graphs, networks and algorithms.
- Detecting critical nodes in sparse graphs
- On the spectra of nonsymmetric Laplacian matrices
- Forest matrices around the Laplacian matrix
- Characterization of cutoff for reversible Markov chains
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
- Analysis and applications of spectral properties of grounded Laplacian matrices for directed networks
- A graph-theoretic approach on optimizing informed-node selection in multi-agent tracking control
- Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
- On the Smallest Eigenvalue of Grounded Laplacian Matrices
- Minimizing Convergence Error in Multi-Agent Systems Via Leader Selection: A Supermodular Optimization Approach
- Convergence Speed in Distributed Consensus and Averaging
- An analysis of approximations for maximizing submodular set functions—I
- Occupation measures for Markov chains
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Consensus and Cooperation in Networked Multi-Agent Systems
- Optimizing Leader Influence in Networks Through Selection of Direct Followers
- Reaching a Consensus
- Opinion Fluctuations and Disagreement in Social Networks
- On the Structure and Computation of Random Walk Times in Finite Graphs
- Consensus and Information Cascades in Game-Theoretic Imitation Dynamics with Static and Dynamic Network Topologies
- An approximation guarantee of the greedy descent algorithm for minimzing a supermodular set function.
- Approximation for maximizing monotone non-decreasing set functions with a greedy method
This page was built for publication: A first hitting time approach to finding effective spreaders in a network
