Contribution to a conference collection:
Centrality Measures Based on Current Flow

No Thumbnail Available
Date
2005
relationships.isEditorOf
Contact
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
ArXiv-ID
International patent number
Link to the license
Project
EU project number
Open Access publication
Restricted until
Title in another language
Research Projects
Organizational Units
Journal Issue
Publication type
Contribution to a conference collection
Publication status
Abstract
We consider variations of two well-known centrality measures, betweenness and closeness, witha different model of information spread. Rather than along shortest paths only, it is assumed that information spreads efficiently like an electrical current. We prove that the current-flow variant of closeness centrality is identical with another known measure, information centrality, and give improved algorithms for computing bothmeasures exactly. Since running times and space requirements are prohibitive for large networks, we also present a randomized approximation scheme for current-flow betweenness.
Summary in another language
Subject (DDC)
004 Computer Science
Keywords
Published in
STACS 2005 / Diekert, Volker; Durand, Bruno (ed.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. - (Lecture Notes in Computer Science ; 3404). - pp. 533-544. - ISBN 978-3-540-24998-6
Conference
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690BRANDES, Ulrik, Daniel FLEISCHER, 2005. Centrality Measures Based on Current Flow. In: DIEKERT, Volker, ed., Bruno DURAND, ed.. STACS 2005. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 533-544. ISBN 978-3-540-24998-6. Available under: doi: 10.1007/978-3-540-31856-9_44
BibTex
@inproceedings{Brandes2005Centr-5680,
  year={2005},
  doi={10.1007/978-3-540-31856-9_44},
  title={Centrality Measures Based on Current Flow},
  number={3404},
  isbn={978-3-540-24998-6},
  publisher={Springer Berlin Heidelberg},
  address={Berlin, Heidelberg},
  series={Lecture Notes in Computer Science},
  booktitle={STACS 2005},
  pages={533--544},
  editor={Diekert, Volker and Durand, Bruno},
  author={Brandes, Ulrik and Fleischer, Daniel}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/5680">
    <dc:format>application/pdf</dc:format>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:rights>terms-of-use</dc:rights>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5680/1/bf_cmbcf_05.pdf"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:18Z</dc:date>
    <dc:language>eng</dc:language>
    <dc:creator>Fleischer, Daniel</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:18Z</dcterms:available>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5680"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Fleischer, Daniel</dc:contributor>
    <dcterms:issued>2005</dcterms:issued>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5680/1/bf_cmbcf_05.pdf"/>
    <dcterms:bibliographicCitation>First publ. in: Proceedings of the 22nd Symposium Theoretical Aspects of Computer Science (STACS ´05) (LNCS 3404), 2005, pp. 533-544</dcterms:bibliographicCitation>
    <dcterms:abstract xml:lang="eng">We consider variations of two well-known centrality measures, betweenness and closeness, witha different model of information spread. Rather than along shortest paths only, it is assumed that information spreads efficiently like an electrical current. We prove that the current-flow variant of closeness centrality is identical with another known measure, information centrality, and give improved algorithms for computing bothmeasures exactly. Since running times and space requirements are prohibitive for large networks, we also present a randomized approximation scheme for current-flow betweenness.</dcterms:abstract>
    <dcterms:title>Centrality Measures Based on Current Flow</dcterms:title>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
  </rdf:Description>
</rdf:RDF>
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Contact
URL of original publication
Test date of URL
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
Yes
Refereed
Link to research data
Description of supplementary data