A first hitting time approach to finding effective spreaders in a network (Q4965258): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1090/conm/759/15267 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1090/conm/759/15267 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3113254388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Opinion Fluctuations and Disagreement in Social Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectra of nonsymmetric Laplacian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting critical nodes in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of cutoff for reversible Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3546603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forest matrices around the Laplacian matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Convergence Error in Multi-Agent Systems Via Leader Selection: A Supermodular Optimization Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure and Computation of Random Walk Times in Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From local averaging to emergent global behaviors: the fundamental role of network interconnections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching a Consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus and Information Cascades in Game-Theoretic Imitation Dynamics with Static and Dynamic Network Topologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation guarantee of the greedy descent algorithm for minimzing a supermodular set function. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs, networks and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4094202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Leader Influence in Networks Through Selection of Direct Followers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best Algorithms for Approximating the Maximum of a Submodular Set Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus and Cooperation in Networked Multi-Agent Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Smallest Eigenvalue of Grounded Laplacian Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Occupation measures for Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph-theoretic approach on optimizing informed-node selection in multi-agent tracking control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Speed in Distributed Consensus and Averaging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation for maximizing monotone non-decreasing set functions with a greedy method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and applications of spectral properties of grounded Laplacian matrices for directed networks / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1090/CONM/759/15267 / rank
 
Normal rank

Latest revision as of 15:27, 30 December 2024

scientific article; zbMATH DE number 7316030
Language Label Description Also known as
English
A first hitting time approach to finding effective spreaders in a network
scientific article; zbMATH DE number 7316030

    Statements

    A first hitting time approach to finding effective spreaders in a network (English)
    0 references
    0 references
    26 February 2021
    0 references
    consensus process
    0 references
    first hitting time
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references