{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T21:10:57Z","timestamp":1659215457312},"reference-count":16,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2016,7,22]],"date-time":"2016-07-22T00:00:00Z","timestamp":1469145600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Net Sci"],"published-print":{"date-parts":[[2016,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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.<\/jats:p>","DOI":"10.1017\/nws.2016.14","type":"journal-article","created":{"date-parts":[[2016,7,22]],"date-time":"2016-07-22T10:38:31Z","timestamp":1469183911000},"page":"474-490","source":"Crossref","is-referenced-by-count":1,"title":["Closeness centralization measure for two-mode data of prescribed sizes"],"prefix":"10.1017","volume":"4","author":[{"given":"MATJA\u017d","family":"KRNC","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JEAN-S\u00c9BASTIEN","family":"SERENI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"RISTE","family":"\u0160KREKOVSKI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ZELEALEM B.","family":"YILMA","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2016,7,22]]},"reference":[{"key":"S205012421600014X_ref11","doi-asserted-by":"publisher","DOI":"10.2307\/2786472"},{"key":"S205012421600014X_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"S205012421600014X_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31955-9_3"},{"key":"S205012421600014X_ref2","doi-asserted-by":"publisher","DOI":"10.1002\/bs.3830100205"},{"key":"S205012421600014X_ref7","doi-asserted-by":"publisher","DOI":"10.1080\/00222500490516671"},{"key":"S205012421600014X_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(97)00007-5"},{"key":"S205012421600014X_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0049-089X(73)90010-0"},{"key":"S205012421600014X_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/nws.2014.15"},{"key":"S205012421600014X_ref12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.036122"},{"key":"S205012421600014X_ref15","doi-asserted-by":"publisher","DOI":"10.1080\/00222500590889730"},{"key":"S205012421600014X_ref1","doi-asserted-by":"publisher","DOI":"10.1121\/1.1906679"},{"key":"S205012421600014X_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289527"},{"key":"S205012421600014X_ref6","volume-title":"Deep south","author":"Davis","year":"1969"},{"key":"S205012421600014X_ref10","unstructured":"Krnc M. , Sereni J.-S. , \u0160krekovski R. , & Yilma Z. B. (2015). Eccentricity of networks with structural constraints. Submitted for publication."},{"key":"S205012421600014X_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/b106453"},{"key":"S205012421600014X_ref4","doi-asserted-by":"publisher","DOI":"10.1145\/146802.146826"}],"container-title":["Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S205012421600014X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T20:06:04Z","timestamp":1555617964000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S205012421600014X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,22]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["S205012421600014X"],"URL":"https:\/\/doi.org\/10.1017\/nws.2016.14","relation":{},"ISSN":["2050-1242","2050-1250"],"issn-type":[{"value":"2050-1242","type":"print"},{"value":"2050-1250","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,22]]}}}