Closeness Centralization Measure for Two-mode Data of Prescribed Sizes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Network Science Year : 2016

Closeness Centralization Measure for Two-mode Data of Prescribed Sizes

Abstract

We confirm a conjecture by Everett, Sinclair, and Dankelmann [Some Centrality results new and old, J. Math. Sociology 28 (2004), 215–227] 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.
Fichier principal
Vignette du fichier
kss16.pdf (398.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01289470 , version 1 (16-03-2016)

Identifiers

Cite

Matjaž Krnc, Jean-Sébastien Sereni, Ristě Skrekovski, Zelealem Yilma. Closeness Centralization Measure for Two-mode Data of Prescribed Sizes. Network Science, 2016, 4 (4), pp.474 - 490. ⟨10.1017/nws.2016.14⟩. ⟨hal-01289470⟩
227 View
351 Download

Altmetric

Share

Gmail Facebook X LinkedIn More