Closeness centralization measure for two-mode data of prescribed sizes
Bibliographic Data
| ID | 6161418 |
|---|---|
| Authors | Matjaž Krnc (0000-0002-4960-8901, University of Primorska, corresponding author), Jean-Sébastien Sereni (Centre National de la Recherche Scientifique), Riste Škrekovski (0000-0001-6851-3214, University of Primorska), Zelealem B Yilma (0000-0003-3928-9748, Carnegie Mellon University Qatar) |
| Year | 2016 |
| Volume | 4 |
| Issue | 4 |
| Pages | 474-490 |
| Publication date | 2016-07-22 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Network Science (JOURNAL) |
| Journal identifiers | ISSN: 2050-1250 • E-ISSN: 2050-1242 |
| Publisher | Cambridge University Press (PUBLISHER • US) |
| DOI | 10.1017/nws.2016.14 |
| OpenAlex | W2307426930 |
| Language | EN |
| References cited | 14 |
We confirm a conjecture by Everett et al. (2004) regarding the problem of maximizing closeness centralization in two-mode data, where the number of data of each type is fixed. Intuitively, our result states that among all networks obtainable via two-mode data, the largest closeness is achieved by simply locally maximizing the closeness of a node. Mathematically, our study concerns bipartite graphs with fixed size bipartitions, and we show that the extremal configuration is a rooted tree of depth 2, where neighbors of the root have an equal or almost equal number of children
Complex Network Analysis Techniques · Graph theory and applications · Stochastic processes and statistical mechanics
The Centrality Index of a Graph
Why social networks are different from other types of networks
Communication Patterns in Task-Oriented Groups
Centrality in social networks conceptual clarification
Integration and radiality
Determining Point-Centrality in Uncontrived Social Networks
Betweenness Centralization for Bipartite Graphs
Some Centrality Results New and Old
Network Analysis
Subgroup centrality measures
On the centrality in a directed graph
| Highly cited | No |
|---|