A first hitting time approach to finding effective spreaders in a network
From MaRDI portal
Publication:4965258
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)
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
Cites work
- scientific article; zbMATH DE number 5454133 (Why is no real title available?)
- scientific article; zbMATH DE number 3514781 (Why is no real title available?)
- A graph-theoretic approach on optimizing informed-node selection in multi-agent tracking control
- An analysis of approximations for maximizing submodular set functions—I
- An approximation guarantee of the greedy descent algorithm for minimzing a supermodular set function.
- Analysis and applications of spectral properties of grounded Laplacian matrices for directed networks
- Approximation for maximizing monotone non-decreasing set functions with a greedy method
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Characterization of cutoff for reversible Markov chains
- Consensus and Cooperation in Networked Multi-Agent Systems
- Consensus and information cascades in game-theoretic imitation dynamics with static and dynamic network topologies
- Convergence speed in distributed consensus and averaging
- Detecting critical nodes in sparse graphs
- Forest matrices around the Laplacian matrix
- From local averaging to emergent global behaviors: the fundamental role of network interconnections
- Graphs, networks and algorithms.
- Introduction to algorithms.
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- 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
- Occupation measures for Markov chains
- On the Smallest Eigenvalue of Grounded Laplacian Matrices
- On the Structure and Computation of Random Walk Times in Finite Graphs
- On the spectra of nonsymmetric Laplacian matrices
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
- Opinion fluctuations and disagreement in social networks
- Optimizing Leader Influence in Networks Through Selection of Direct Followers
- Reaching a Consensus
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)
