Advanced Centrality Concepts
Identifieur interne : 001214 ( Istex/Corpus ); précédent : 001213; suivant : 001215Advanced Centrality Concepts
Auteurs : Dirk Koschützki ; Katharina Anna Lehmann ; Dagmar Tenfelde-Podehl ; Oliver ZlotowskiSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2005.
Abstract
Abstract: The sheer number of different centrality indices introduced in the literature, or even only the ones in Chapter 3, is daunting. Frequently, a new definition is motivated by the previous ones failing to capture the notion of centrality of a vertex in a new application. In this chapter we will discuss the connections, similarities and differences of centralities. The goal of this chapter is to present an overview of such connections, thus providing some kind of map of the existing centrality indices. For that we focus on formal descriptions that hold for all networks. However, this approach has its limits.
Url:
DOI: 10.1007/978-3-540-31955-9_5
Links to Exploration step
ISTEX:91036A74EE54B8F6B1271DBCB5E13C4477800821Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Advanced Centrality Concepts</title><author><name sortKey="Koschutzki, Dirk" sort="Koschutzki, Dirk" uniqKey="Koschutzki D" first="Dirk" last="Koschützki">Dirk Koschützki</name><affiliation><mods:affiliation>IPK Gatersleben, Corrensstraße 3, 06466, Gatersleben, Germany</mods:affiliation></affiliation></author><author><name sortKey="Lehmann, Katharina Anna" sort="Lehmann, Katharina Anna" uniqKey="Lehmann K" first="Katharina Anna" last="Lehmann">Katharina Anna Lehmann</name><affiliation><mods:affiliation>Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 14, C108, 72076, Tübingen, Germany</mods:affiliation></affiliation></author><author><name sortKey="Tenfelde Podehl, Dagmar" sort="Tenfelde Podehl, Dagmar" uniqKey="Tenfelde Podehl D" first="Dagmar" last="Tenfelde-Podehl">Dagmar Tenfelde-Podehl</name><affiliation><mods:affiliation>Department of Mathematics, Technische Universität Kaiserslautern, 67653, Kaiserslautern, Germany</mods:affiliation></affiliation></author><author><name sortKey="Zlotowski, Oliver" sort="Zlotowski, Oliver" uniqKey="Zlotowski O" first="Oliver" last="Zlotowski">Oliver Zlotowski</name><affiliation><mods:affiliation>Algorithms and Data Structures, Univeristät Trier, 54296, Trier, Germany</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:91036A74EE54B8F6B1271DBCB5E13C4477800821</idno><date when="2005" year="2005">2005</date><idno type="doi">10.1007/978-3-540-31955-9_5</idno><idno type="url">https://api.istex.fr/document/91036A74EE54B8F6B1271DBCB5E13C4477800821/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001214</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001214</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Advanced Centrality Concepts</title><author><name sortKey="Koschutzki, Dirk" sort="Koschutzki, Dirk" uniqKey="Koschutzki D" first="Dirk" last="Koschützki">Dirk Koschützki</name><affiliation><mods:affiliation>IPK Gatersleben, Corrensstraße 3, 06466, Gatersleben, Germany</mods:affiliation></affiliation></author><author><name sortKey="Lehmann, Katharina Anna" sort="Lehmann, Katharina Anna" uniqKey="Lehmann K" first="Katharina Anna" last="Lehmann">Katharina Anna Lehmann</name><affiliation><mods:affiliation>Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 14, C108, 72076, Tübingen, Germany</mods:affiliation></affiliation></author><author><name sortKey="Tenfelde Podehl, Dagmar" sort="Tenfelde Podehl, Dagmar" uniqKey="Tenfelde Podehl D" first="Dagmar" last="Tenfelde-Podehl">Dagmar Tenfelde-Podehl</name><affiliation><mods:affiliation>Department of Mathematics, Technische Universität Kaiserslautern, 67653, Kaiserslautern, Germany</mods:affiliation></affiliation></author><author><name sortKey="Zlotowski, Oliver" sort="Zlotowski, Oliver" uniqKey="Zlotowski O" first="Oliver" last="Zlotowski">Oliver Zlotowski</name><affiliation><mods:affiliation>Algorithms and Data Structures, Univeristät Trier, 54296, Trier, Germany</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2005</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">91036A74EE54B8F6B1271DBCB5E13C4477800821</idno><idno type="DOI">10.1007/978-3-540-31955-9_5</idno><idno type="ChapterID">5</idno><idno type="ChapterID">Chap5</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The sheer number of different centrality indices introduced in the literature, or even only the ones in Chapter 3, is daunting. Frequently, a new definition is motivated by the previous ones failing to capture the notion of centrality of a vertex in a new application. In this chapter we will discuss the connections, similarities and differences of centralities. The goal of this chapter is to present an overview of such connections, thus providing some kind of map of the existing centrality indices. For that we focus on formal descriptions that hold for all networks. However, this approach has its limits.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Dirk Koschützki</name><affiliations><json:string>IPK Gatersleben, Corrensstraße 3, 06466, Gatersleben, Germany</json:string></affiliations></json:item><json:item><name>Katharina Anna Lehmann</name><affiliations><json:string>Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 14, C108, 72076, Tübingen, Germany</json:string></affiliations></json:item><json:item><name>Dagmar Tenfelde-Podehl</name><affiliations><json:string>Department of Mathematics, Technische Universität Kaiserslautern, 67653, Kaiserslautern, Germany</json:string></affiliations></json:item><json:item><name>Oliver Zlotowski</name><affiliations><json:string>Algorithms and Data Structures, Univeristät Trier, 54296, Trier, Germany</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: The sheer number of different centrality indices introduced in the literature, or even only the ones in Chapter 3, is daunting. Frequently, a new definition is motivated by the previous ones failing to capture the notion of centrality of a vertex in a new application. In this chapter we will discuss the connections, similarities and differences of centralities. The goal of this chapter is to present an overview of such connections, thus providing some kind of map of the existing centrality indices. For that we focus on formal descriptions that hold for all networks. However, this approach has its limits.</abstract><qualityIndicators><score>6.212</score><pdfVersion>1.3</pdfVersion><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>621</abstractCharCount><pdfWordCount>10651</pdfWordCount><pdfCharCount>54311</pdfCharCount><pdfPageCount>29</pdfPageCount><abstractWordCount>101</abstractWordCount></qualityIndicators><title>Advanced Centrality Concepts</title><chapterId><json:string>5</json:string><json:string>Chap5</json:string></chapterId><genre><json:string>research-article</json:string></genre><serie><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>New York University, NY, USA</json:string></affiliations></json:item><json:item><name>Dough Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbruecken, Germany</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2005</copyrightDate></serie><host><editor><json:item><name>Ulrik Brandes</name><affiliations><json:string>Department of Computer & Information Science, University of Konstanz,</json:string><json:string>E-mail: ulrik.brandes@uni-konstanz.de</json:string></affiliations></json:item><json:item><name>Thomas Erlebach</name><affiliations><json:string>Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK</json:string><json:string>E-mail: t.erlebach@mcs.le.ac.uk</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Discrete Mathematics in Computer Science</value></json:item><json:item><value>Computer Communication Networks</value></json:item><json:item><value>Data Structures</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Algorithms</value></json:item><json:item><value>Communications Engineering, Networks</value></json:item></subject><isbn><json:string>978-3-540-24979-5</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Network Analysis</title><bookId><json:string>978-3-540-31955-9</json:string></bookId><volume>3418</volume><pages><last>111</last><first>83</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-540-31955-9</json:string></eisbn><copyrightDate>2005</copyrightDate><doi><json:string>10.1007/b106453</json:string></doi></host><publicationDate>2005</publicationDate><copyrightDate>2005</copyrightDate><doi><json:string>10.1007/978-3-540-31955-9_5</json:string></doi><id>91036A74EE54B8F6B1271DBCB5E13C4477800821</id><score>0.39581126</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/91036A74EE54B8F6B1271DBCB5E13C4477800821/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/91036A74EE54B8F6B1271DBCB5E13C4477800821/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/91036A74EE54B8F6B1271DBCB5E13C4477800821/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Advanced Centrality Concepts</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag Berlin Heidelberg, 2005</p></availability><date>2005</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Advanced Centrality Concepts</title><author xml:id="author-1"><persName><forename type="first">Dirk</forename><surname>Koschützki</surname></persName><affiliation>IPK Gatersleben, Corrensstraße 3, 06466, Gatersleben, Germany</affiliation></author><author xml:id="author-2"><persName><forename type="first">Katharina</forename><surname>Lehmann</surname></persName><affiliation>Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 14, C108, 72076, Tübingen, Germany</affiliation></author><author xml:id="author-3"><persName><forename type="first">Dagmar</forename><surname>Tenfelde-Podehl</surname></persName><affiliation>Department of Mathematics, Technische Universität Kaiserslautern, 67653, Kaiserslautern, Germany</affiliation></author><author xml:id="author-4"><persName><forename type="first">Oliver</forename><surname>Zlotowski</surname></persName><affiliation>Algorithms and Data Structures, Univeristät Trier, 54296, Trier, Germany</affiliation></author></analytic><monogr><title level="m">Network Analysis</title><title level="m" type="sub">Methodological Foundations</title><idno type="pISBN">978-3-540-24979-5</idno><idno type="eISBN">978-3-540-31955-9</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/b106453</idno><idno type="book-ID">978-3-540-31955-9</idno><idno type="book-title-ID">116778</idno><idno type="book-sequence-number">3418</idno><idno type="book-volume-number">3418</idno><idno type="book-chapter-count">15</idno><editor><persName><forename type="first">Ulrik</forename><surname>Brandes</surname></persName><email>ulrik.brandes@uni-konstanz.de</email><affiliation>Department of Computer & Information Science, University of Konstanz</affiliation></editor><editor><persName><forename type="first">Thomas</forename><surname>Erlebach</surname></persName><email>t.erlebach@mcs.le.ac.uk</email><affiliation>Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2005"></date><biblScope unit="volume">3418</biblScope><biblScope unit="page" from="83">83</biblScope><biblScope unit="page" to="111">111</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>New York University, NY, USA</affiliation></editor><editor><persName><forename type="first">Dough</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbruecken, Germany</affiliation></editor><biblScope><date>2005</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series><idno type="istex">91036A74EE54B8F6B1271DBCB5E13C4477800821</idno><idno type="DOI">10.1007/978-3-540-31955-9_5</idno><idno type="ChapterID">5</idno><idno type="ChapterID">Chap5</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2005</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: The sheer number of different centrality indices introduced in the literature, or even only the ones in Chapter 3, is daunting. Frequently, a new definition is motivated by the previous ones failing to capture the notion of centrality of a vertex in a new application. In this chapter we will discuss the connections, similarities and differences of centralities. The goal of this chapter is to present an overview of such connections, thus providing some kind of map of the existing centrality indices. For that we focus on formal descriptions that hold for all networks. However, this approach has its limits.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><item><term>Computer Science</term></item><label>I17028</label><item><term>Discrete Mathematics in Computer Science</term></item><label>I13022</label><item><term>Computer Communication Networks</term></item><label>I15017</label><item><term>Data Structures</term></item><label>I16021</label><item><term>Algorithm Analysis and Problem Complexity</term></item><label>M14018</label><item><term>Algorithms</term></item><label>T24035</label><item><term>Communications Engineering, Networks</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2005">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/91036A74EE54B8F6B1271DBCB5E13C4477800821/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo TocLevels="0" SeriesType="Series"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Dough</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>CA</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><City>MA</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>New York University</OrgName><OrgAddress><City>NY</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbruecken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo Language="En" NumberingStyle="ContentOnly" NumberingDepth="2" OutputMedium="All" TocLevels="0" ContainsESM="No" BookProductType="Graduate/advanced undergraduate textbook" MediaType="eBook"><BookID>978-3-540-31955-9</BookID><BookTitle>Network Analysis</BookTitle><BookSubTitle>Methodological Foundations</BookSubTitle><BookVolumeNumber>3418</BookVolumeNumber><BookSequenceNumber>3418</BookSequenceNumber><BookDOI>10.1007/b106453</BookDOI><BookTitleID>116778</BookTitleID><BookPrintISBN>978-3-540-24979-5</BookPrintISBN><BookElectronicISBN>978-3-540-31955-9</BookElectronicISBN><BookChapterCount>15</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2005</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Type="Primary" Code="I">Computer Science</BookSubject><BookSubject Type="Secondary" Priority="1" Code="I17028">Discrete Mathematics in Computer Science</BookSubject><BookSubject Type="Secondary" Priority="2" Code="I13022">Computer Communication Networks</BookSubject><BookSubject Type="Secondary" Priority="3" Code="I15017">Data Structures</BookSubject><BookSubject Type="Secondary" Priority="4" Code="I16021">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Type="Secondary" Priority="5" Code="M14018">Algorithms</BookSubject><BookSubject Type="Secondary" Priority="6" Code="T24035">Communications Engineering, Networks</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Ulrik</GivenName><FamilyName>Brandes</FamilyName></EditorName><Contact><Email>ulrik.brandes@uni-konstanz.de</Email></Contact></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>Thomas</GivenName><FamilyName>Erlebach</FamilyName></EditorName><Contact><Email>t.erlebach@mcs.le.ac.uk</Email></Contact></Editor><Affiliation ID="Aff16"><OrgDivision>Department of Computer & Information Science</OrgDivision><OrgName>University of Konstanz</OrgName><OrgAddress><Country> </Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>University of Leicester</OrgName><OrgAddress><Street>University Road</Street><Postcode>LE1 7RH</Postcode><City>Leicester</City><Country>UK</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part2"><PartInfo TocLevels="0"><PartID>2</PartID><PartSequenceNumber>2</PartSequenceNumber><PartTitle>Part I Elements</PartTitle><PartChapterCount>3</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Network Analysis</BookTitle></PartContext></PartInfo><Chapter ID="Chap5" Language="En"><ChapterInfo ChapterType="OriginalPaper" NumberingStyle="ContentOnly" NumberingDepth="2" TocLevels="0" ContainsESM="No"><ChapterID>5</ChapterID><ChapterDOI>10.1007/978-3-540-31955-9_5</ChapterDOI><ChapterSequenceNumber>5</ChapterSequenceNumber><ChapterTitle Language="En">Advanced Centrality Concepts</ChapterTitle><ChapterFirstPage>83</ChapterFirstPage><ChapterLastPage>111</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2005</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>2</PartID><BookID>978-3-540-31955-9</BookID><BookTitle>Network Analysis</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff18"><AuthorName DisplayOrder="Western"><GivenName>Dirk</GivenName><FamilyName>Koschützki</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff19"><AuthorName DisplayOrder="Western"><GivenName>Katharina</GivenName><GivenName>Anna</GivenName><FamilyName>Lehmann</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff20"><AuthorName DisplayOrder="Western"><GivenName>Dagmar</GivenName><FamilyName>Tenfelde-Podehl</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff21"><AuthorName DisplayOrder="Western"><GivenName>Oliver</GivenName><FamilyName>Zlotowski</FamilyName></AuthorName></Author><Affiliation ID="Aff18"><OrgName>IPK Gatersleben</OrgName><OrgAddress><Street>Corrensstraße 3</Street><Postcode>06466</Postcode><City>Gatersleben</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff19"><OrgDivision>Wilhelm-Schickard-Institut für Informatik</OrgDivision><OrgName>Universität Tübingen</OrgName><OrgAddress><Street>Sand 14, C108</Street><Postcode>72076</Postcode><City>Tübingen</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff20"><OrgDivision>Department of Mathematics</OrgDivision><OrgName>Technische Universität Kaiserslautern</OrgName><OrgAddress><Postcode>67653</Postcode><City>Kaiserslautern</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff21"><OrgDivision>Algorithms and Data Structures</OrgDivision><OrgName>Univeristät Trier</OrgName><OrgAddress><Postcode>54296</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>The sheer number of different centrality indices introduced in the literature, or even only the ones in Chapter 3, is daunting. Frequently, a new definition is motivated by the previous ones failing to capture the notion of centrality of a vertex in a new application. In this chapter we will discuss the connections, similarities and differences of centralities. The goal of this chapter is to present an overview of such connections, thus providing some kind of map of the existing centrality indices. For that we focus on formal descriptions that hold for all networks. However, this approach has its limits.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Advanced Centrality Concepts</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Advanced Centrality Concepts</title></titleInfo><name type="personal"><namePart type="given">Dirk</namePart><namePart type="family">Koschützki</namePart><affiliation>IPK Gatersleben, Corrensstraße 3, 06466, Gatersleben, Germany</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Katharina</namePart><namePart type="given">Anna</namePart><namePart type="family">Lehmann</namePart><affiliation>Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 14, C108, 72076, Tübingen, Germany</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Dagmar</namePart><namePart type="family">Tenfelde-Podehl</namePart><affiliation>Department of Mathematics, Technische Universität Kaiserslautern, 67653, Kaiserslautern, Germany</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Oliver</namePart><namePart type="family">Zlotowski</namePart><affiliation>Algorithms and Data Structures, Univeristät Trier, 54296, Trier, Germany</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2005</dateIssued><copyrightDate encoding="w3cdtf">2005</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: The sheer number of different centrality indices introduced in the literature, or even only the ones in Chapter 3, is daunting. Frequently, a new definition is motivated by the previous ones failing to capture the notion of centrality of a vertex in a new application. In this chapter we will discuss the connections, similarities and differences of centralities. The goal of this chapter is to present an overview of such connections, thus providing some kind of map of the existing centrality indices. For that we focus on formal descriptions that hold for all networks. However, this approach has its limits.</abstract><relatedItem type="host"><titleInfo><title>Network Analysis</title><subTitle>Methodological Foundations</subTitle></titleInfo><name type="personal"><namePart type="given">Ulrik</namePart><namePart type="family">Brandes</namePart><affiliation>Department of Computer & Information Science, University of Konstanz</affiliation><affiliation>E-mail: ulrik.brandes@uni-konstanz.de</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Thomas</namePart><namePart type="family">Erlebach</namePart><affiliation>Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK</affiliation><affiliation>E-mail: t.erlebach@mcs.le.ac.uk</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Graduate/advanced undergraduate textbook"></genre><originInfo><copyrightDate encoding="w3cdtf">2005</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I17028">Discrete Mathematics in Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I13022">Computer Communication Networks</topic><topic authority="SpringerSubjectCodes" authorityURI="I15017">Data Structures</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="M14018">Algorithms</topic><topic authority="SpringerSubjectCodes" authorityURI="T24035">Communications Engineering, Networks</topic></subject><identifier type="DOI">10.1007/b106453</identifier><identifier type="ISBN">978-3-540-24979-5</identifier><identifier type="eISBN">978-3-540-31955-9</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">116778</identifier><identifier type="BookID">978-3-540-31955-9</identifier><identifier type="BookChapterCount">15</identifier><identifier type="BookVolumeNumber">3418</identifier><identifier type="BookSequenceNumber">3418</identifier><identifier type="PartChapterCount">3</identifier><part><date>2005</date><detail type="part"><title>Part I Elements</title></detail><detail type="volume"><number>3418</number><caption>vol.</caption></detail><extent unit="pages"><start>83</start><end>111</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2005</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>New York University, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Dough</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbruecken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2005</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2005</recordOrigin></recordInfo></relatedItem><identifier type="istex">91036A74EE54B8F6B1271DBCB5E13C4477800821</identifier><identifier type="DOI">10.1007/978-3-540-31955-9_5</identifier><identifier type="ChapterID">5</identifier><identifier type="ChapterID">Chap5</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2005</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2005</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001214 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001214 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:91036A74EE54B8F6B1271DBCB5E13C4477800821
|texte= Advanced Centrality Concepts
}}
| This area was generated with Dilib version V0.6.31. |  |