Identifying sets of key players in a social network

DOI10.1007/S10588-006-7084-XzbMATH Open1198.91180OpenAlexW2111347279MaRDI QIDQ159769FDOQ159769

Authors: Stephen P. Borgatti, Stephen P. Borgatti 

Publication date: April 2006

Published in: Computational and Mathematical Organization Theory, Computational \& Mathematical Organization Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10588-006-7084-x

Recommendations

• Identifying Key Nodes in Social Networks Using Multi-Criteria Decision-Making Tools
• Identifying stable network structures and sets of key players using a \(W\)-covering perspective
• Identifying a set of key members in social networks using SDP-based stochastic search and integer programming algorithms

zbMATH Keywords

social networkscentralitycohesion

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Cites Work

• Title not available (Why is that?)
• An Efficient Heuristic Procedure for Partitioning Graphs
• Future paths for integer programming and links to artificial intelligence
• Title not available (Why is that?)
• The centrality of groups and classes

Cited In (65)

• A comparison of centrality measures and their role in controlling the spread in epidemic networks
• Axiomatic characterization of PageRank
• Finding the most degree-central walks and paths in a graph: exact and heuristic approaches
• The firebreak problem
• On the distance between random events on a network
• Analysis of network interventions with an application to hospital-acquired infections
• Strong connectivity in directed graphs under failures, with applications
• Detection of key figures in social networks by combining harmonic modularity with community structure-regulated network embedding
• A survey on optimization studies of group centrality metrics
• Gendered networks and communicability in medieval historical narratives
• The general ownership structure of the European aerospace industry a statistical and network analysis
• EIA-CNDP: an exact iterative algorithm for critical node detection problem
• Detecting critical node structures on graphs: a mathematical programming approach
• influenceR
• Complexity among combinatorial problems from epidemics
• Solving the Distance-Based Critical Node Problem
• Efficient methods for the distance-based critical node detection problem in complex networks
• Identification of node centrality based on Laplacian energy of networks
• Hybrid constructive heuristics for the critical node problem
• Component-cardinality-constrained critical node problem in graphs
• A genetic algorithm for a class of critical node problems
• What distinguish one from its peers in social networks?
• An integer programming framework for critical elements detection in graphs
• Complexity of the critical node problem over trees
• Critical node detection problem for complex network in undirected weighted networks
• Key leaders in social networks
• Identifying a set of key members in social networks using SDP-based stochastic search and integer programming algorithms
• A \(k\)-shell decomposition method for weighted networks
• Detecting critical nodes in sparse graphs
• Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
• Energy disruptive centrality with an application to criminal network
• Tackling information asymmetry in networks: a new entropy-based ranking index
• Least cost influence propagation in (social) networks
• Critical node/edge detection problems on trees
• An optimal approach for the critical node problem using semidefinite programming
• Analysis of complex network performance and heuristic node removal strategies
• Group centralization of network indices
• Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
• Improved formulations for minimum connectivity network interdiction problems
• Regularity of dynamic opinion games
• Selected topics in critical element detection
• Exact interdiction models and algorithms for disconnecting networks via node deletions
• The critical node problem based on connectivity index and properties of components on trees
• Compressive sensing of high betweenness centrality nodes in networks
• Identifying Key Nodes in Social Networks Using Multi-Criteria Decision-Making Tools
• Network interdiction via a critical disruption path: branch-and-price algorithms
• Bound and exact methods for assessing link vulnerability in complex networks
• A new method for centrality measurement using generalized fuzzy graphs
• Structural search and optimization in social networks
• Optimizing node infiltrations in complex networks by a local search based heuristic
• Finding critical links for closeness centrality
• Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
• Exact identification of critical nodes in sparse networks via new compact formulations
• VNS solutions for the critical node problem
• The connected critical node problem
• Key player policies when contextual effects matter
• A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality
• Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures
• The bi-objective critical node detection problem
• Vulnerability and controllability of networks of networks
• The critical node detection problem in networks: a survey
• Lattices in social networks with influence
• Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results
• Identifying stable network structures and sets of key players using a \(W\)-covering perspective

This page was built for publication: Identifying sets of key players in a social network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q159769)