PittsburghV1, Hal, Checkpoint, bibRecord, 000125

Closeness Centralization Measure for Two-mode Data of Prescribed Sizes

Identifieur interne : 000125 ( Hal/Checkpoint ); précédent : 000124; suivant : 000126

Closeness Centralization Measure for Two-mode Data of Prescribed Sizes

Auteurs : Matjaž Krnc [Slovénie] ; Jean-Sébastien Sereni [France] ; Rist Skrekovski [Slovénie] ; Zelealem Yilma [Qatar]

Source :

RBID : Hal:hal-01289470

English descriptors

mix :
- centrality, closeness centrality, complex network, graph, network.

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.

Url:

https://hal.inria.fr/hal-01289470

Links toward previous steps (curation, corpus...)

to stream Hal, to step Corpus: 000129
to stream Hal, to step Curation: 000129

Links to Exploration step

Hal:hal-01289470

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Closeness Centralization Measure for Two-mode Data of Prescribed Sizes</title>
<author><name sortKey="Krnc, Matjaz" sort="Krnc, Matjaz" uniqKey="Krnc M" first="Matjaž" last="Krnc">Matjaž Krnc</name>
<affiliation wicri:level="1"><hal:affiliation type="department" xml:id="struct-453355" status="INCOMING"><orgName>Faculty of Mathematics, Natural Sciences and Information Technologies</orgName>
<orgName type="acronym">FAMNIT</orgName>
<desc><address><country key="SI"></country>
</address>
</desc>
<listRelation><relation active="#struct-322016" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-322016" type="direct"><org type="institution" xml:id="struct-322016" status="VALID"><orgName>University of Primorska</orgName>
<desc><address><country key="SI"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Slovénie</country>
</affiliation>
</author>
<author><name sortKey="Sereni, Jean Sebastien" sort="Sereni, Jean Sebastien" uniqKey="Sereni J" first="Jean-Sébastien" last="Sereni">Jean-Sébastien Sereni</name>
<affiliation wicri:level="1"><hal:affiliation type="institution" xml:id="struct-441569" status="VALID">          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>            <address>              <country key="FR"></country>
            </address>
            <ref type="url">http://www.cnrs.fr/</ref>
          </desc>
        </hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Skrekovski, Rist" sort="Skrekovski, Rist" uniqKey="Skrekovski R" first="Rist" last="Skrekovski">Rist Skrekovski</name>
<affiliation wicri:level="1"><hal:affiliation type="department" xml:id="struct-453355" status="INCOMING"><orgName>Faculty of Mathematics, Natural Sciences and Information Technologies</orgName>
<orgName type="acronym">FAMNIT</orgName>
<desc><address><country key="SI"></country>
</address>
</desc>
<listRelation><relation active="#struct-322016" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-322016" type="direct"><org type="institution" xml:id="struct-322016" status="VALID"><orgName>University of Primorska</orgName>
<desc><address><country key="SI"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Slovénie</country>
</affiliation>
</author>
<author><name sortKey="Yilma, Zelealem" sort="Yilma, Zelealem" uniqKey="Yilma Z" first="Zelealem" last="Yilma">Zelealem Yilma</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-50182" status="VALID">          <orgName>Carnegie Mellon University in Qatar</orgName>
          <desc>            <address>              <addrLine>c/o Qatar Foundation P.O. Box 24866 Doha, Qatar</addrLine>
              <country key="QA"></country>
            </address>
            <ref type="url">http://www.qatar.cmu.edu/</ref>
          </desc>
          <listRelation>            <relation active="#struct-67135" type="direct"></relation>
          </listRelation>
        <tutelles><tutelle active="#struct-67135" type="direct"><org type="institution" xml:id="struct-67135" status="VALID">          <orgName>Carnegie Mellon University [Pittsburgh]</orgName>
          <orgName type="acronym">CMU</orgName>
          <desc>            <address>              <addrLine>5000 Forbes Ave,  Pittsburgh, PA 15213</addrLine>
              <country key="US"></country>
            </address>
            <ref type="url">http://www.cmu.edu/</ref>
          </desc>
        </org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Qatar</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-01289470</idno>
<idno type="halId">hal-01289470</idno>
<idno type="halUri">https://hal.inria.fr/hal-01289470</idno>
<idno type="url">https://hal.inria.fr/hal-01289470</idno>
<date when="2016">2016</date>
<idno type="wicri:Area/Hal/Corpus">000129</idno>
<idno type="wicri:Area/Hal/Curation">000129</idno>
<idno type="wicri:Area/Hal/Checkpoint">000125</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">000125</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Closeness Centralization Measure for Two-mode Data of Prescribed Sizes</title>
<author><name sortKey="Krnc, Matjaz" sort="Krnc, Matjaz" uniqKey="Krnc M" first="Matjaž" last="Krnc">Matjaž Krnc</name>
<affiliation wicri:level="1"><hal:affiliation type="department" xml:id="struct-453355" status="INCOMING"><orgName>Faculty of Mathematics, Natural Sciences and Information Technologies</orgName>
<orgName type="acronym">FAMNIT</orgName>
<desc><address><country key="SI"></country>
</address>
</desc>
<listRelation><relation active="#struct-322016" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-322016" type="direct"><org type="institution" xml:id="struct-322016" status="VALID"><orgName>University of Primorska</orgName>
<desc><address><country key="SI"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Slovénie</country>
</affiliation>
</author>
<author><name sortKey="Sereni, Jean Sebastien" sort="Sereni, Jean Sebastien" uniqKey="Sereni J" first="Jean-Sébastien" last="Sereni">Jean-Sébastien Sereni</name>
<affiliation wicri:level="1"><hal:affiliation type="institution" xml:id="struct-441569" status="VALID">          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>            <address>              <country key="FR"></country>
            </address>
            <ref type="url">http://www.cnrs.fr/</ref>
          </desc>
        </hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Skrekovski, Rist" sort="Skrekovski, Rist" uniqKey="Skrekovski R" first="Rist" last="Skrekovski">Rist Skrekovski</name>
<affiliation wicri:level="1"><hal:affiliation type="department" xml:id="struct-453355" status="INCOMING"><orgName>Faculty of Mathematics, Natural Sciences and Information Technologies</orgName>
<orgName type="acronym">FAMNIT</orgName>
<desc><address><country key="SI"></country>
</address>
</desc>
<listRelation><relation active="#struct-322016" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-322016" type="direct"><org type="institution" xml:id="struct-322016" status="VALID"><orgName>University of Primorska</orgName>
<desc><address><country key="SI"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Slovénie</country>
</affiliation>
</author>
<author><name sortKey="Yilma, Zelealem" sort="Yilma, Zelealem" uniqKey="Yilma Z" first="Zelealem" last="Yilma">Zelealem Yilma</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-50182" status="VALID">          <orgName>Carnegie Mellon University in Qatar</orgName>
          <desc>            <address>              <addrLine>c/o Qatar Foundation P.O. Box 24866 Doha, Qatar</addrLine>
              <country key="QA"></country>
            </address>
            <ref type="url">http://www.qatar.cmu.edu/</ref>
          </desc>
          <listRelation>            <relation active="#struct-67135" type="direct"></relation>
          </listRelation>
        <tutelles><tutelle active="#struct-67135" type="direct"><org type="institution" xml:id="struct-67135" status="VALID">          <orgName>Carnegie Mellon University [Pittsburgh]</orgName>
          <orgName type="acronym">CMU</orgName>
          <desc>            <address>              <addrLine>5000 Forbes Ave,  Pittsburgh, PA 15213</addrLine>
              <country key="US"></country>
            </address>
            <ref type="url">http://www.cmu.edu/</ref>
          </desc>
        </org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Qatar</country>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>centrality</term>
<term>closeness centrality</term>
<term>complex network</term>
<term>graph</term>
<term>network</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">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.</div>
</front>
</TEI>
<hal api="V3">          <titleStmt>            <title xml:lang="en">Closeness Centralization Measure for Two-mode Data of Prescribed Sizes</title>
            <author role="aut">              <persName>                <forename type="first">Matjaž</forename>
                <surname>Krnc</surname>
              </persName>
              <idno type="halauthorid">1004732</idno>
              <affiliation ref="#struct-453355"></affiliation>
            </author>
            <author role="aut">              <persName>                <forename type="first">Jean-Sébastien</forename>
                <surname>Sereni</surname>
              </persName>
              <idno type="halauthorid">1311308</idno>
              <affiliation ref="#struct-441569"></affiliation>
              <affiliation ref="#struct-205125"></affiliation>
            </author>
            <author role="crp">              <persName>                <forename type="first">Ristě</forename>
                <surname>Skrekovski</surname>
              </persName>
              <email type="md5">ef6a3b5c6f4971ec8885be16a5f47704</email>
              <email type="domain">gmail.com</email>
              <idno type="halauthorid">1311309</idno>
              <affiliation ref="#struct-453355"></affiliation>
              <affiliation ref="#struct-425634"></affiliation>
            </author>
            <author role="aut">              <persName>                <forename type="first">Zelealem</forename>
                <surname>Yilma</surname>
              </persName>
              <email type="md5">7e80abe6e252659aa26e4cfc1bf9a805</email>
              <email type="domain">liafa.jussieu.fr</email>
              <idno type="halauthorid">643126</idno>
              <affiliation ref="#struct-50182"></affiliation>
            </author>
            <editor role="depositor">              <persName>                <forename>Jean-Sébastien</forename>
                <surname>Sereni</surname>
              </persName>
              <email type="md5">a8e9548eb04383a78be3ae69499ff7d8</email>
              <email type="domain">kam.mff.cuni.cz</email>
            </editor>
          </titleStmt>
          <editionStmt>            <edition n="v1" type="current">              <date type="whenSubmitted">2016-03-16 17:17:04</date>
              <date type="whenModified">2016-09-22 14:33:07</date>
              <date type="whenReleased">2016-03-21 10:31:01</date>
              <date type="whenProduced">2016</date>
              <date type="whenEndEmbargoed">2016-03-16</date>
              <ref type="file" target="https://hal.inria.fr/hal-01289470/document">                <date notBefore="2016-03-16"></date>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.inria.fr/hal-01289470/file/kss16.pdf">                <date notBefore="2016-03-16"></date>
              </ref>
            </edition>
            <respStmt>              <resp>contributor</resp>
              <name key="151838">                <persName>                  <forename>Jean-Sébastien</forename>
                  <surname>Sereni</surname>
                </persName>
                <email type="md5">a8e9548eb04383a78be3ae69499ff7d8</email>
                <email type="domain">kam.mff.cuni.cz</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>            <distributor>CCSD</distributor>
            <idno type="halId">hal-01289470</idno>
            <idno type="halUri">https://hal.inria.fr/hal-01289470</idno>
            <idno type="halBibtex">krnc:hal-01289470</idno>
            <idno type="halRefHtml">Network Science, 2016</idno>
            <idno type="halRef">Network Science, 2016</idno>
          </publicationStmt>
          <seriesStmt>            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INSMI">CNRS-INSMI - INstitut des Sciences Mathématiques et de leurs Interactions</idno>
            <idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
            <idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="LORIA2">Publications du LORIA</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="LORIA-NLPKD" p="LORIA">Department of Natural Language Processing & Knowledge Discovery</idno>
            <idno type="stamp" n="LORIA">Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
          </seriesStmt>
          <notesStmt>            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>            <biblStruct>              <analytic>                <title xml:lang="en">Closeness Centralization Measure for Two-mode Data of Prescribed Sizes</title>
                <author role="aut">                  <persName>                    <forename type="first">Matjaž</forename>
                    <surname>Krnc</surname>
                  </persName>
                  <idno type="halauthorid">1004732</idno>
                  <affiliation ref="#struct-453355"></affiliation>
                </author>
                <author role="aut">                  <persName>                    <forename type="first">Jean-Sébastien</forename>
                    <surname>Sereni</surname>
                  </persName>
                  <idno type="halauthorid">1311308</idno>
                  <affiliation ref="#struct-441569"></affiliation>
                  <affiliation ref="#struct-205125"></affiliation>
                </author>
                <author role="crp">                  <persName>                    <forename type="first">Ristě</forename>
                    <surname>Skrekovski</surname>
                  </persName>
                  <email type="md5">ef6a3b5c6f4971ec8885be16a5f47704</email>
                  <email type="domain">gmail.com</email>
                  <idno type="halauthorid">1311309</idno>
                  <affiliation ref="#struct-453355"></affiliation>
                  <affiliation ref="#struct-425634"></affiliation>
                </author>
                <author role="aut">                  <persName>                    <forename type="first">Zelealem</forename>
                    <surname>Yilma</surname>
                  </persName>
                  <email type="md5">7e80abe6e252659aa26e4cfc1bf9a805</email>
                  <email type="domain">liafa.jussieu.fr</email>
                  <idno type="halauthorid">643126</idno>
                  <affiliation ref="#struct-50182"></affiliation>
                </author>
              </analytic>
              <monogr>                <idno type="halJournalId" status="INCOMING">102877</idno>
                <title level="j">Network Science</title>
                <imprint>                  <date type="datePub">2016</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>            <langUsage>              <language ident="en">English</language>
            </langUsage>
            <textClass>              <keywords scheme="author">                <term xml:lang="en">graph</term>
                <term xml:lang="en">network</term>
                <term xml:lang="en">centrality</term>
                <term xml:lang="en">closeness centrality</term>
                <term xml:lang="en">complex network</term>
              </keywords>
              <classCode scheme="halDomain" n="math.math-co">Mathematics [math]/Combinatorics [math.CO]</classCode>
              <classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
              <classCode scheme="halDomain" n="info.info-si">Computer Science [cs]/Social and Information Networks [cs.SI]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">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.</abstract>
          </profileDesc>
        </hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Amérique/explor/PittsburghV1/Data/Hal/Checkpoint

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000125 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Hal/Checkpoint/biblio.hfd -nk 000125 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Amérique
   |area=    PittsburghV1
   |flux=    Hal
   |étape=   Checkpoint
   |type=    RBID
   |clé=     Hal:hal-01289470
   |texte=   Closeness Centralization Measure for Two-mode Data of Prescribed Sizes
}}

This area was generated with Dilib version V0.6.38.
Data generation: Fri Jun 18 17:37:45 2021. Site generation: Fri Jun 18 18:15:47 2021

	Serveur d'exploration sur Pittsburgh
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur Pittsburgh

Closeness Centralization Measure for Two-mode Data of Prescribed Sizes

Closeness Centralization Measure for Two-mode Data of Prescribed Sizes

Source :

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri