1. //
  2. Start
  3. //
  4. Publications
  5. Comparing the Sensitivity of Social Netw...
  6. Output formats
  7. //

Comparing the Sensitivity of Social Networks, Web Graphs, and Random Graphs with Respect to Vertex Removal

Research output: Contributions to collected editions/works › Article in conference proceedings › Research › peer-review

Standard

Comparing the Sensitivity of Social Networks, Web Graphs, and Random Graphs with Respect to Vertex Removal. / Martin, Christoph; Niemeyer, Peter.
2015 11th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS). ed. / Kokou Yetongnon; Albert Dipanda; Richard Chbeir. IEEE - Institute of Electrical and Electronics Engineers Inc., 2016. p. 460-467 7400603 (Proceedings - 11th International Conference on Signal-Image Technology and Internet-Based Systems, SITIS 2015).

Research output: Contributions to collected editions/works › Article in conference proceedings › Research › peer-review

Harvard

Martin, C & Niemeyer, P 2016, Comparing the Sensitivity of Social Networks, Web Graphs, and Random Graphs with Respect to Vertex Removal. in K Yetongnon, A Dipanda & R Chbeir (eds), 2015 11th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)., 7400603, Proceedings - 11th International Conference on Signal-Image Technology and Internet-Based Systems, SITIS 2015, IEEE - Institute of Electrical and Electronics Engineers Inc., pp. 460-467, International Conference on Signal-Image Technology & Internet-Based Systems 2015, Bangkok, Thailand, 23.11.15. https://doi.org/10.1109/SITIS.2015.22

APA

Martin, C., & Niemeyer, P. (2016). Comparing the Sensitivity of Social Networks, Web Graphs, and Random Graphs with Respect to Vertex Removal. In K. Yetongnon, A. Dipanda, & R. Chbeir (Eds.), 2015 11th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS) (pp. 460-467). Article 7400603 (Proceedings - 11th International Conference on Signal-Image Technology and Internet-Based Systems, SITIS 2015). IEEE - Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SITIS.2015.22

Vancouver

Martin C, Niemeyer P. Comparing the Sensitivity of Social Networks, Web Graphs, and Random Graphs with Respect to Vertex Removal. In Yetongnon K, Dipanda A, Chbeir R, editors, 2015 11th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS). IEEE - Institute of Electrical and Electronics Engineers Inc. 2016. p. 460-467. 7400603. (Proceedings - 11th International Conference on Signal-Image Technology and Internet-Based Systems, SITIS 2015). doi: 10.1109/SITIS.2015.22

Bibtex

@inbook{be01e75fb3ec434f8df293a5a0362136,
title = "Comparing the Sensitivity of Social Networks, Web Graphs, and Random Graphs with Respect to Vertex Removal",
abstract = "The sensitivity of networks to the removal of vertices has been studied extensively over the last 15 years. A common approach to measuring this sensitivity is (i) successively removing vertices following a specific removal strategy and (ii) comparing the original and the modified network using a specific comparison method. In this paper we apply a wide range of removal strategies and comparison methods in order to study the sensitivity of medium-sized networks from the real world and randomly generated networks. In the first part of our study we observe that social networks and web graphs differ in sensitivity. When removing vertices, social networks are robust, web graphs are not. This effect is consistent with the work of Boldi et al. who analyzed very large social networks and web graphs. For randomly generated networks we find that their sensitivity depends significantly on the comparison method. The choice of removal strategy has surprisingly marginal impact on the sensitivity for removal strategies derived from common centrality measures. However, the removal strategy has a strong impact when removing the vertices in random order.",
keywords = "Business informatics, centrality measure, complex networks, random graphs, robustness analysis",
author = "Christoph Martin and Peter Niemeyer",
year = "2016",
month = feb,
day = "5",
doi = "10.1109/SITIS.2015.22",
language = "English",
series = "Proceedings - 11th International Conference on Signal-Image Technology and Internet-Based Systems, SITIS 2015",
publisher = "IEEE - Institute of Electrical and Electronics Engineers Inc.",
pages = "460--467",
editor = "Kokou Yetongnon and Albert Dipanda and Richard Chbeir",
booktitle = "2015 11th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
address = "United States",
note = " International Conference on Signal-Image Technology & Internet-Based Systems 2015, SITIS 2015 ; Conference date: 23-11-2015 Through 27-11-2015",
url = "http://www.sitis-conf.org/past-conferences/www.sitis-conf.org-2015/index.php.html",

}

RIS

TY - CHAP

T1 - Comparing the Sensitivity of Social Networks, Web Graphs, and Random Graphs with Respect to Vertex Removal

AU - Martin, Christoph

AU - Niemeyer, Peter

N1 - Conference code: 11

PY - 2016/2/5

Y1 - 2016/2/5

N2 - The sensitivity of networks to the removal of vertices has been studied extensively over the last 15 years. A common approach to measuring this sensitivity is (i) successively removing vertices following a specific removal strategy and (ii) comparing the original and the modified network using a specific comparison method. In this paper we apply a wide range of removal strategies and comparison methods in order to study the sensitivity of medium-sized networks from the real world and randomly generated networks. In the first part of our study we observe that social networks and web graphs differ in sensitivity. When removing vertices, social networks are robust, web graphs are not. This effect is consistent with the work of Boldi et al. who analyzed very large social networks and web graphs. For randomly generated networks we find that their sensitivity depends significantly on the comparison method. The choice of removal strategy has surprisingly marginal impact on the sensitivity for removal strategies derived from common centrality measures. However, the removal strategy has a strong impact when removing the vertices in random order.

AB - The sensitivity of networks to the removal of vertices has been studied extensively over the last 15 years. A common approach to measuring this sensitivity is (i) successively removing vertices following a specific removal strategy and (ii) comparing the original and the modified network using a specific comparison method. In this paper we apply a wide range of removal strategies and comparison methods in order to study the sensitivity of medium-sized networks from the real world and randomly generated networks. In the first part of our study we observe that social networks and web graphs differ in sensitivity. When removing vertices, social networks are robust, web graphs are not. This effect is consistent with the work of Boldi et al. who analyzed very large social networks and web graphs. For randomly generated networks we find that their sensitivity depends significantly on the comparison method. The choice of removal strategy has surprisingly marginal impact on the sensitivity for removal strategies derived from common centrality measures. However, the removal strategy has a strong impact when removing the vertices in random order.

KW - Business informatics

KW - centrality measure

KW - complex networks

KW - random graphs

KW - robustness analysis

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

U2 - 10.1109/SITIS.2015.22

DO - 10.1109/SITIS.2015.22

M3 - Article in conference proceedings

T3 - Proceedings - 11th International Conference on Signal-Image Technology and Internet-Based Systems, SITIS 2015

SP - 460

EP - 467

BT - 2015 11th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)

A2 - Yetongnon, Kokou

A2 - Dipanda, Albert

A2 - Chbeir, Richard

PB - IEEE - Institute of Electrical and Electronics Engineers Inc.

T2 - International Conference on Signal-Image Technology & Internet-Based Systems 2015

Y2 - 23 November 2015 through 27 November 2015

ER -

Other publications by the same author(s)

On the impact of network size and average degree on the robustness of centrality measures

Martin, C. & Niemeyer, P., 20.10.2021, In: Network Science. 9, S1, p. S61-S82 22 p.

Research output: Journal contributions › Journal articles › Research › peer-review

The Role of Network Size for the Robustness of Centrality Measures

Martin, C. & Niemeyer, P., 01.01.2020, Complex Networks and Their Applications VIII: Volume 1 Proceedings of the Eighth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2019. Cherifi, H., Gaito, S., Mendes, J. F., Moro, E. & Rocha, L. M. (eds.). Cham: Springer Schweiz, Vol. 1. p. 40-51 12 p. (Studies in Computational Intelligence; vol. 881).

Research output: Contributions to collected editions/works › Article in conference proceedings › Research › peer-review

Influence of measurement errors on networks: Estimating the robustness of centrality measures

Martin, C. & Niemeyer, P., 01.06.2019, In: Network Science. 7, 2, p. 180-195 16 p.

Research output: Journal contributions › Journal articles › Research › peer-review

Multikonferenz Wirtschaftsinformatik 2018: Data driven X — Turning Data into Value

Drews, P. (Editor), Funk, B. (Editor), Niemeyer, P. (Editor) & Xie, L. (Editor), 14.03.2018, Lüneburg: Institut für Wirtschaftsinformatik. 2094 p.

Research output: Books and anthologies › Conference proceedings › Research

The impact of partially missing communities on the reliability of centrality measures

Martin, C., 2018, Complex Networks & Their Applications VI: Proceedings of Complex Networks 2017 (The 6th International Conference on Complex Networks and Their Applications). Springer Verlag, Vol. 1. p. 41-52 12 p. (Studies in Computational Intelligence; vol. 689).

Research output: Contributions to collected editions/works › Article in conference proceedings › Research › peer-review

DOI

Recently viewed

Publications

  1. A Quadrant Approach of Camera Calibration Method for Depth Estimation Using a Stereo Vision System
  2. Analysis and Implementation of a Resistance Temperature Estimator Based on Bi-Polynomial Least Squares Method and Discrete Kalman Filter
  3. Analyzing User Journey Data In Digital Health: Predicting Dropout From A Digital CBT-I Intervention
  4. The Use of Factorization and Multimode Parametric Spectra in Estimating Frequency and Spectral Parameters of Signal
  5. Structure and dynamics laboratory testing of an indirectly controlled full variable valve train for camless engines
  6. Implementing ERP systems in multinational projects
  7. OKBQA framework towards an open collaboration for development of natural language question-answering systems over knowledge bases
  8. Agency and structure in a sociotechnical transition
  9. Quality Assurance Methods and the Open Source Model
  10. NH4+ ad-/desorption in sequencing batch reactors
  11. Is too much help an obstacle? Effects of interactivity and cognitive style on learning with dynamic versus non-dynamic visualizations with narrative explanations
  12. Facing complexity through informed simplifications
  13. Hierarchical trait filtering at different spatial scales determines beetle assemblages in deadwood
  14. Accounting and Modeling as Design Metaphors for CEMIS
  15. A guided simulated annealing search for solving the pick-up and delivery problem with time windows and capacity constraints
  16. A Lean Convolutional Neural Network for Vehicle Classification
  17. HAWK - hybrid question answering using linked data
  18. Modelling and implementation of an Order2Cash Process in distributed systems
  19. Factor structure and measurement invariance of the Students’ Self-report Checklist of Social and Learning Behaviour (SSL)
  20. Interactive Media as Fields of Transduction
  21. Using data mining techniques to investigate the correlation between surface cracks and flange lengths in deep drawn sheet metals
  22. From entity to process
  23. Geometric structures for the parameterization of non-interacting dynamics for multi-body mechanisms
  24. Predicate‐based model of problem‐solving for robotic actions planning
  25. Vergütung, variable
  26. Mechanism of dynamic recrystallization and evolution of texture in the hot working domains of the processing map for Mg-4Al-2Ba-2Ca Alloy
  27. A cascade controller structure using an internal PID controller for a hybrid piezo-hydraulic actuator in camless internal combustion engines
  28. Editorial: Machine Learning and Data Mining in Materials Science
  29. Computing regression statistics from grouped data
  30. Quantum Computing and the Analog/Digital Distinction
  31. The representative turn in EU studies
  32. Temporal dynamics of conflict monitoring and the effects of one or two conflict sources on error-(related) negativity
  33. Users’ handedness and performance when controlling integrated input devices
  34. Differences in adjustment flexibility between regular and temporary agency work
  35. Modelling, explaining, enacting and getting feedback: How can the acquisition of core practices in teacher education be optimally fostered?
  36. Petri net based EMIS-mappers for flexible manufacturing systems
  37. An Overview of Electro Hydraulic Full Variable Valve Train Systems to Reduce Emissions in Internal Combustion Engines
  38. Reciprocal Relationships Between Dispositional Optimism and Work Experiences
  39. A dialectical perspective on innovation: Conflicting demands, multiple pathways, and ambidexterity
  40. A Lyapunov Approach to Set the Parameters of a PI-Controller to Minimise Velocity Oscillations in a Permanent Magnet Synchronous Motor Using Chopper Control for Electrical Vehicles
  41. Assessment of cognitive load in multimedia learning using dual-task methodology