Sensitivity and reliability in incomplete networks: Centrality metrics to community scoring functions

Soumya Sarkar, Suhansanu Kumar, Sanjukta Bhowmick, Animesh Mukherjee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

In this paper we evaluate the effect of noise on community scoring and centrality-based parameters with respect to two different aspects of network analysis: (i) sensitivity, that is how the parameter value changes as edges are removed and (ii) reliability in the context of message spreading, that is how the time taken to broadcast a message changes as edges are removed. Our experiments on synthetic and real-world networks and three different noise models demonstrate that for both the aspects over all networks and all noise models, permanence qualifies as the most effective metric. For the sensitivity experiments closeness centrality is a close second. For the message spreading experiments, closeness and betweenness centrality based initiator selection closely competes with permanence. This is because permanence has a dual characteristic where the cumulative permanence over all vertices is sensitive to noise but the ids of the top-rank vertices, which are used to find seeds during message spreading remain relatively stable under noise.

Original languageEnglish (US)
Title of host publicationProceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016
EditorsRavi Kumar, James Caverlee, Hanghang Tong
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages69-72
Number of pages4
ISBN (Electronic)9781509028467
DOIs
StatePublished - Nov 21 2016
Event2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016 - San Francisco, United States
Duration: Aug 18 2016Aug 21 2016

Publication series

NameProceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016

Other

Other2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016
CountryUnited States
CitySan Francisco
Period8/18/168/21/16

Fingerprint

community
Experiments
Electric network analysis
experiment
Seed
value change
network analysis
broadcast
time

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Sociology and Political Science
  • Communication

Cite this

Sarkar, S., Kumar, S., Bhowmick, S., & Mukherjee, A. (2016). Sensitivity and reliability in incomplete networks: Centrality metrics to community scoring functions. In R. Kumar, J. Caverlee, & H. Tong (Eds.), Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016 (pp. 69-72). [7752215] (Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ASONAM.2016.7752215

Sensitivity and reliability in incomplete networks : Centrality metrics to community scoring functions. / Sarkar, Soumya; Kumar, Suhansanu; Bhowmick, Sanjukta; Mukherjee, Animesh.

Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016. ed. / Ravi Kumar; James Caverlee; Hanghang Tong. Institute of Electrical and Electronics Engineers Inc., 2016. p. 69-72 7752215 (Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sarkar, S, Kumar, S, Bhowmick, S & Mukherjee, A 2016, Sensitivity and reliability in incomplete networks: Centrality metrics to community scoring functions. in R Kumar, J Caverlee & H Tong (eds), Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016., 7752215, Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016, Institute of Electrical and Electronics Engineers Inc., pp. 69-72, 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016, San Francisco, United States, 8/18/16. https://doi.org/10.1109/ASONAM.2016.7752215
Sarkar S, Kumar S, Bhowmick S, Mukherjee A. Sensitivity and reliability in incomplete networks: Centrality metrics to community scoring functions. In Kumar R, Caverlee J, Tong H, editors, Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016. Institute of Electrical and Electronics Engineers Inc. 2016. p. 69-72. 7752215. (Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016). https://doi.org/10.1109/ASONAM.2016.7752215
Sarkar, Soumya ; Kumar, Suhansanu ; Bhowmick, Sanjukta ; Mukherjee, Animesh. / Sensitivity and reliability in incomplete networks : Centrality metrics to community scoring functions. Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016. editor / Ravi Kumar ; James Caverlee ; Hanghang Tong. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 69-72 (Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016).
@inproceedings{2471a21c570549fb91c056e50ea3a224,
title = "Sensitivity and reliability in incomplete networks: Centrality metrics to community scoring functions",
abstract = "In this paper we evaluate the effect of noise on community scoring and centrality-based parameters with respect to two different aspects of network analysis: (i) sensitivity, that is how the parameter value changes as edges are removed and (ii) reliability in the context of message spreading, that is how the time taken to broadcast a message changes as edges are removed. Our experiments on synthetic and real-world networks and three different noise models demonstrate that for both the aspects over all networks and all noise models, permanence qualifies as the most effective metric. For the sensitivity experiments closeness centrality is a close second. For the message spreading experiments, closeness and betweenness centrality based initiator selection closely competes with permanence. This is because permanence has a dual characteristic where the cumulative permanence over all vertices is sensitive to noise but the ids of the top-rank vertices, which are used to find seeds during message spreading remain relatively stable under noise.",
author = "Soumya Sarkar and Suhansanu Kumar and Sanjukta Bhowmick and Animesh Mukherjee",
year = "2016",
month = "11",
day = "21",
doi = "10.1109/ASONAM.2016.7752215",
language = "English (US)",
series = "Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "69--72",
editor = "Ravi Kumar and James Caverlee and Hanghang Tong",
booktitle = "Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016",

}

TY - GEN

T1 - Sensitivity and reliability in incomplete networks

T2 - Centrality metrics to community scoring functions

AU - Sarkar, Soumya

AU - Kumar, Suhansanu

AU - Bhowmick, Sanjukta

AU - Mukherjee, Animesh

PY - 2016/11/21

Y1 - 2016/11/21

N2 - In this paper we evaluate the effect of noise on community scoring and centrality-based parameters with respect to two different aspects of network analysis: (i) sensitivity, that is how the parameter value changes as edges are removed and (ii) reliability in the context of message spreading, that is how the time taken to broadcast a message changes as edges are removed. Our experiments on synthetic and real-world networks and three different noise models demonstrate that for both the aspects over all networks and all noise models, permanence qualifies as the most effective metric. For the sensitivity experiments closeness centrality is a close second. For the message spreading experiments, closeness and betweenness centrality based initiator selection closely competes with permanence. This is because permanence has a dual characteristic where the cumulative permanence over all vertices is sensitive to noise but the ids of the top-rank vertices, which are used to find seeds during message spreading remain relatively stable under noise.

AB - In this paper we evaluate the effect of noise on community scoring and centrality-based parameters with respect to two different aspects of network analysis: (i) sensitivity, that is how the parameter value changes as edges are removed and (ii) reliability in the context of message spreading, that is how the time taken to broadcast a message changes as edges are removed. Our experiments on synthetic and real-world networks and three different noise models demonstrate that for both the aspects over all networks and all noise models, permanence qualifies as the most effective metric. For the sensitivity experiments closeness centrality is a close second. For the message spreading experiments, closeness and betweenness centrality based initiator selection closely competes with permanence. This is because permanence has a dual characteristic where the cumulative permanence over all vertices is sensitive to noise but the ids of the top-rank vertices, which are used to find seeds during message spreading remain relatively stable under noise.

UR - http://www.scopus.com/inward/record.url?scp=85006741527&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85006741527&partnerID=8YFLogxK

U2 - 10.1109/ASONAM.2016.7752215

DO - 10.1109/ASONAM.2016.7752215

M3 - Conference contribution

AN - SCOPUS:85006741527

T3 - Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016

SP - 69

EP - 72

BT - Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016

A2 - Kumar, Ravi

A2 - Caverlee, James

A2 - Tong, Hanghang

PB - Institute of Electrical and Electronics Engineers Inc.

ER -