Matjaž Krnc
Biographic Data
| ID | 4163856 |
|---|---|
| NAME | Matjaž Krnc |
| GIVEN NAMES | Matjaž |
| FAMILY NAME | Krnc |
| SIGNATURE | KRNC M |
| AFFILIATIONS | University of Primorska |
| ORCID | 0000-0002-4960-8901 |
| VERIFIED | Yes |
| TOTAL WORKS | 1 |
| TOTAL CITATIONS | 0 |
| AUTHOR COUNT | 1 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 2016 |
| LATEST PUBLICATION YEAR | 2016 |
| H-INDEX | 0 |
Closeness centralization measure for two-mode data of prescribed sizes
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 th…
No prominent works on this page.
Closeness centralization measure for two-mode data of prescribed sizes
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 th…
Complex Network Analysis Techniques (1 work) · Graph theory and applications (1 work) · Stochastic processes and statistical mechanics (1 work)