The centrality of groups and classes
From MaRDI portal
Publication:4247922
DOI10.1080/0022250X.1999.9990219zbMath0949.91036OpenAlexW2089370556MaRDI QIDQ4247922
Stephen P. Borgatti, Martin G. Everett
Publication date: 3 June 1999
Published in: The Journal of Mathematical Sociology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0022250x.1999.9990219
Related Items (38)
Who You Know vs. What You Know: The Impact of Social Position and Knowledge on Team Performance ⋮ Influence measures in subnetworks using vertex centrality ⋮ Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence ⋮ The Star Degree Centrality Problem: A Decomposition Approach ⋮ Tournament solutions based on cooperative game theory ⋮ Comments on: ``Static and dynamic source locations in undirected networks ⋮ Identifying a Set of Key Members in Social Networks Using SDP-Based Stochastic Search and Integer Programming Algorithms ⋮ Cross-impact of order flow imbalance in equity markets ⋮ Paths and flows for centrality measures in networks ⋮ Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures ⋮ The stochastic pseudo-star degree centrality problem ⋮ Efficient algorithms for game-theoretic betweenness centrality ⋮ Finding the most degree-central walks and paths in a graph: exact and heuristic approaches ⋮ Finding groups with maximum betweenness centrality via integer programming with random path sampling ⋮ A measure for a balanced workload and its extremal values ⋮ Network Essence: PageRank Completion and Centrality-Conforming Markov Chains ⋮ Core/periphery scientific collaboration networks among very similar researchers ⋮ Finding Critical Links for Closeness Centrality ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks ⋮ Centrality metrics and localization in core-periphery networks ⋮ A centrality notion for graphs based on Tukey depth ⋮ Potential-based bounded-cost search and anytime non-parametric A* ⋮ Incremental deployment of network monitors based on Group Betweenness Centrality ⋮ Identifying sets of key players in a social network ⋮ Betweenness Centrality: Extremal Values and Structural Properties ⋮ Finding clique clusters with the highest betweenness centrality ⋮ Detecting a most closeness-central clique in complex networks ⋮ I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs ⋮ Maximum Betweenness Centrality: Approximability and Tractable Cases ⋮ Structural Search and Optimization in Social Networks ⋮ Spectral density of equitable core-periphery graphs ⋮ On network analysis using non-additive integrals: extending the game-theoretic network centrality ⋮ An integer programming approach for finding the most and the least central cliques ⋮ Group centralization of network indices ⋮ Finding groups with maximum betweenness centrality ⋮ Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs ⋮ Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization
Cites Work
This page was built for publication: The centrality of groups and classes
