Stars, neighborhood inclusion and network centrality
| Type of Publication: | Contribution to a conference collection |
| Publication status: | Published |
| Author: | Schoch, David; Brandes, Ulrik |
| Year of publication: | 2015 |
| Conference: | SIAM Workshop on network Science, May 16, 2015 - May 17, 2015, Snowbird, Utah, USA |
| URL of original publication: | http://algo.uni-konstanz.de/publications/sb-sninc-15.pdf |
| Summary: |
The numerous network centrality indices proposed in the literature have little in common but the operational quan- ti cation of an intuition that nodes in better positions are more central, where \position" is relative to a par- ticular conceptualization. We propose to discriminate centrality indices from other indices by focusing on a min- imal requirement for \better" instead. Formally, we posit that a centrality ranking must preserve the neighborhood- inclusion preorder, and discuss advantages of such an approach
|
| Subject (DDC): | 004 Computer Science |
| Bibliography of Konstanz: | Yes |
Cite This
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||
SCHOCH, David, Ulrik BRANDES, 2015. Stars, neighborhood inclusion and network centrality. SIAM Workshop on network Science. Snowbird, Utah, USA, May 16, 2015 - May 17, 2015
@inproceedings{Schoch2015Stars-37044, title={Stars, neighborhood inclusion and network centrality}, url={http://algo.uni-konstanz.de/publications/sb-sninc-15.pdf}, year={2015}, author={Schoch, David and Brandes, Ulrik} }
<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/rdf/resource/123456789/37044"> <dc:contributor>Brandes, Ulrik</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/37044"/> <dc:contributor>Schoch, David</dc:contributor> <dc:creator>Schoch, David</dc:creator> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-02-02T08:18:54Z</dc:date> <dc:creator>Brandes, Ulrik</dc:creator> <dcterms:title>Stars, neighborhood inclusion and network centrality</dcterms:title> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-02-02T08:18:54Z</dcterms:available> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:language>eng</dc:language> <dcterms:issued>2015</dcterms:issued> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:abstract xml:lang="eng">The numerous network centrality indices proposed in the literature have little in common but the operational quan- ti cation of an intuition that nodes in better positions are more central, where \position" is relative to a par- ticular conceptualization. We propose to discriminate centrality indices from other indices by focusing on a min- imal requirement for \better" instead. Formally, we posit that a centrality ranking must preserve the neighborhood- inclusion preorder, and discuss advantages of such an approach</dcterms:abstract> </rdf:Description> </rdf:RDF>
This item appears in the following Collection(s)
Search KOPS
Browse
My Account
