A first hitting time approach to finding effective spreaders in a network
DOI10.1090/CONM/759/15267zbMATH Open1458.94003OpenAlexW3113254388MaRDI QIDQ4965258FDOQ4965258
Authors: Fern Y. Hunt 
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
Recommendations
- Identifying influential spreaders in complex networks through local effective spreading paths
- Identifying influential spreaders in complex networks by considering the impact of the number of shortest paths
- Exploring the optimal network topology for spreading dynamics
- Identifying influential spreaders in artificial complex networks
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Communication theory (94A05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Random walks on graphs (05C81)
Cites Work
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- An approximation guarantee of the greedy descent algorithm for minimzing a supermodular set function.
- Introduction to algorithms.
- Title not available (Why is that?)
- Consensus and Cooperation in Networked Multi-Agent Systems
- Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
- Reaching a Consensus
- Detecting critical nodes in sparse graphs
- Forest matrices around the Laplacian matrix
- Minimizing Convergence Error in Multi-Agent Systems Via Leader Selection: A Supermodular Optimization Approach
- Opinion fluctuations and disagreement in social networks
- An analysis of approximations for maximizing submodular set functions—I
- A graph-theoretic approach on optimizing informed-node selection in multi-agent tracking control
- Title not available (Why is that?)
- On the spectra of nonsymmetric Laplacian matrices
- From local averaging to emergent global behaviors: the fundamental role of network interconnections
- Convergence speed in distributed consensus and averaging
- Occupation measures for Markov chains
- Graphs, networks and algorithms.
- Approximation for maximizing monotone non-decreasing set functions with a greedy method
- Characterization of cutoff for reversible Markov chains
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
- On the Smallest Eigenvalue of Grounded Laplacian Matrices
- Consensus and information cascades in game-theoretic imitation dynamics with static and dynamic network topologies
- Analysis and applications of spectral properties of grounded Laplacian matrices for directed networks
- On the Structure and Computation of Random Walk Times in Finite Graphs
- Optimizing Leader Influence in Networks Through Selection of Direct Followers
This page was built for publication: A first hitting time approach to finding effective spreaders in a network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965258)
