The centrality of groups and classes
From MaRDI portal
Publication:4247922
DOI10.1080/0022250X.1999.9990219zbMATH Open0949.91036OpenAlexW2089370556MaRDI QIDQ4247922FDOQ4247922
Authors: 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
Recommendations
Cites Work
Cited In (46)
- Detecting critical node structures on graphs: a mathematical programming approach
- A measure for a balanced workload and its extremal values
- 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
- Finding groups with maximum betweenness centrality
- Maximum betweenness centrality: approximability and tractable cases
- Network essence: PageRank completion and centrality-conforming Markov chains
- Identifying a set of key members in social networks using SDP-based stochastic search and integer programming algorithms
- Incremental deployment of network monitors based on Group Betweenness Centrality
- Finding the most degree-central walks and paths in a graph: exact and heuristic approaches
- Core/periphery scientific collaboration networks among very similar researchers
- Finding clique clusters with the highest betweenness centrality
- Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence
- The stochastic pseudo-star degree centrality problem
- A centrality notion for graphs based on Tukey depth
- Influence of the user importance measure on the group evolution discovery
- Betweenness Centrality: Extremal Values and Structural Properties
- Centrality in organizational networks
- Social networks: prestige, centrality, and influence (invited paper)
- Potential-based bounded-cost search and anytime non-parametric A*
- The star degree centrality problem: a decomposition approach
- Group centralization of network indices
- Who You Know vs. What You Know: The Impact of Social Position and Knowledge on Team Performance
- Finding groups with maximum betweenness centrality via integer programming with random path sampling
- Centrality metrics and localization in core-periphery networks
- Comments on: ``Static and dynamic source locations in undirected networks
- Influence measures in subnetworks using vertex centrality
- Efficient algorithms for game-theoretic betweenness centrality
- Structural search and optimization in social networks
- Finding critical links for closeness centrality
- Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks
- An integer programming approach for finding the most and the least central cliques
- The parameterized complexity of maximum betweenness centrality
- Detecting a most closeness-central clique in complex networks
- Spectral density of equitable core-periphery graphs
- A survey on optimization studies of group centrality metrics
- Cross-impact of order flow imbalance in equity markets
- Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures
- Paths and flows for centrality measures in networks
- Social centrality using network hierarchy and community structure
- Central industries in the Ecuadorian input-output network. An application of social network analysis
- Identifying sets of key players in a social network
- Optimal influence under observational learning
- On network analysis using non-additive integrals: extending the game-theoretic network centrality
- Tournament solutions based on cooperative game theory
- I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs
This page was built for publication: The centrality of groups and classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247922)