poster

Extensions of closeness centrality?

Authors:

Rong Yang,

Leyla ZhuhadarAuthors Info & Claims

ACMSE '11: Proceedings of the 49th annual ACM Southeast Conference

Pages 304 - 305

https://doi.org/10.1145/2016039.2016119

Published: 24 March 2011 Publication History

Get Access

Abstract

The concept of vertex centrality has long been studied in order to help understand the structure and dynamics of complex networks. It has found wide applicability in practical as well as theoretical areas. Closeness centrality is one of the fundamental approaches to centrality, but one difficulty with using it is that it degenerates for disconnected graphs. Some alternate versions of closeness centrality have been proposed which rectify this problem. This paper points out that these are not true extensions of closeness centrality in the sense that they do not rank the vertices of connected graphs in the same way that closeness centrality does.

References

[1]

Bonacich, P. Technique for analyzing overlapping memberships. Sociological Methodology 4 (1972), 176--185.

Crossref

Google Scholar

[2]

Bonacich, P. Power and centrality: A family of measures. American Journal of Sociology 92, 5 (1987), 1170--1182.

Crossref

Google Scholar

[3]

Brin, S., and Page, L. The anatomy of a large scale hyper-textual web search engine, in proc. of 7th WWW Conference, 1998.

Digital Library

Google Scholar

[4]

Dangalchev, C. Residual closeness in networks. Physica A: Statistical Mechanics and its Applications 365, 2 (2006), 556--564.

Crossref

Google Scholar

[5]

Freeman, L. Centrality in social networks conceptual clarification. Social networks 1, 3 (1979), 215--239.

Google Scholar

[6]

Girvan, M., and Newman, M. Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America 99, 12 (2002), 7821.

Crossref

Google Scholar

[7]

Latora, V., and Marchiori, M. Efficient behavior of small-world networks. Physical Review Letters 87, 19 (2001), 198701.

Crossref

Google Scholar

[8]

Newman, M. A measure of betweenness centrality based on random walks. Social networks 27, 1 (2005), 39--54.

Google Scholar

Cited By

View all

Nushi EPopescu VSanchez Martin JIvanov SCzeizler EPetre I(2022)Network Modelling Methods for Precision MedicineSystems Biology Modelling and Analysis10.1002/9781119716600.ch10(363-423)Online publication date: 18-Nov-2022
https://doi.org/10.1002/9781119716600.ch10
Kas MCarley KCarley LRokne JFaloutsos C(2013)Incremental closeness centrality for dynamically changing social networksProceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining10.1145/2492517.2500270(1250-1258)Online publication date: 25-Aug-2013
https://dl.acm.org/doi/10.1145/2492517.2500270

Index Terms

Extensions of closeness centrality?

Recommendations

Computing top-k Closeness Centrality Faster in Unweighted Graphs

Given a connected graph G=(V,E), where V denotes the set of nodes and E the set of edges of the graph, the length (that is, the number of edges) of the shortest path between two nodes v and w is denoted by d(v,w). The closeness centrality of a vertex v ...
Computing classic closeness centrality, at scale
COSN '14: Proceedings of the second ACM conference on Online social networks

Closeness centrality, first considered by Bavelas (1948), is an importance measure of a node in a network which is based on the distances from the node to all other nodes. The classic definition, proposed by Bavelas (1950), Beauchamp (1965), and ...
Use of Centrality Metrics to Determine Connected Dominating Sets for Real-World Network Graphs
ITNG '15: Proceedings of the 2015 12th International Conference on Information Technology - New Generations

The high-level contribution of this paper is to demonstrate the use of centrality metrics to determine connected dominating sets (CDS) in large complex graphs representing a variety of real-world networks. We consider the following centrality metrics: ...

Comments

Information & Contributors

Information

Published In

ACMSE '11: Proceedings of the 49th annual ACM Southeast Conference

March 2011

399 pages

ISBN:9781450306867

DOI:10.1145/2016039

Conference Chair:
Victor Clincy
Kennesaw State University
,
General Chairs:
Ken Hoganson
Kennesaw State University
,
Jose Garrido
Kennesaw State University
,
Program Chair:
Venu Dasigi
Southern Polytechnic State University

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 March 2011

Check for updates

Author Tags

Qualifiers

Poster

Conference

ACM SE '11

Sponsor:

ACM SE '11: ACM Southeast Regional Conference

March 24 - 26, 2011

Georgia, Kennesaw

Acceptance Rates

Overall Acceptance Rate 502 of 1,023 submissions, 49%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
181
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Nushi EPopescu VSanchez Martin JIvanov SCzeizler EPetre I(2022)Network Modelling Methods for Precision MedicineSystems Biology Modelling and Analysis10.1002/9781119716600.ch10(363-423)Online publication date: 18-Nov-2022
https://doi.org/10.1002/9781119716600.ch10
Kas MCarley KCarley LRokne JFaloutsos C(2013)Incremental closeness centrality for dynamically changing social networksProceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining10.1145/2492517.2500270(1250-1258)Online publication date: 25-Aug-2013
https://dl.acm.org/doi/10.1145/2492517.2500270

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Computing top-k Closeness Centrality Faster in Unweighted Graphs

Computing classic closeness centrality, at scale

Use of Centrality Metrics to Determine Connected Dominating Sets for Real-World Network Graphs

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations