Centrality Measures Based on Current Flow

Publikationstyp: Beitrag zu einer Konferenz
URI (zitierfähiger Link): http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-77670
Autor/innen: Brandes, Ulrik; Fleischer, Daniel
Erscheinungsjahr: 2005
Erschienen in: STACS 2005 / Diekert, Volker; Durand, Bruno (Hrsg.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. - (Lecture Notes in Computer Science ; 3404). - S. 533-544. - ISBN 978-3-540-24998-6
DOI (zitierfähiger Link): https://dx.doi.org/10.1007/978-3-540-31856-9_44
Zusammenfassung:
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.
Fachgebiet (DDC): 004 Informatik
Link zur Lizenz: Deposit-Lizenz
Universitätsbibliographie: Ja

Zitieren

Dateien zu dieser Ressource

[PDF]
Name: bf_cmbcf_05.pdf
Größe: 220.7Kb
Format: PDF
Öffnen
Prüfsumme: MD5:7ca8d3fc67335f1a574fa507957bcc1a

BRANDES, 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

@inproceedings{Brandes2005Centr-5680, title={Centrality Measures Based on Current Flow}, year={2005}, doi={10.1007/978-3-540-31856-9_44}, number={3404}, isbn={978-3-540-24998-6}, address={Berlin, Heidelberg}, publisher={Springer 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 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/5680"> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103416863-3868037-7"/> <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> <dc:language>eng</dc:language> <dc:contributor>Fleischer, Daniel</dc:contributor> <dc:rights>deposit-license</dc:rights> <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:format>application/pdf</dc:format> <dc:contributor>Brandes, Ulrik</dc:contributor> <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> <dc:creator>Brandes, Ulrik</dc:creator> <dcterms:issued>2005</dcterms:issued> <dcterms:title>Centrality Measures Based on Current Flow</dcterms:title> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:18Z</dc:date> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5680"/> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

bf_cmbcf_05.pdf 339

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto