CoChat

Centralities Based Analysis of Complex Networks

Open access
Scardoni, Giovanni, Lau, Carlo · 2012 · New Frontiers in Graph Theory
Cited by 106

The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.

Abstract

Characterizing, describing, and extracting information from a network is by now one of the main goals of science, since the study of network currently draws the attention of several fields of research, as biology, economics, social science, computer science and so on. The main goal is to analyze networks in order to extract their emergent properties (Bhalla & Iyengar (1999)) and to understand functionality of such complex systems. Two possible analysis approaches can be applied to a complex network: the first based on the study of its topological structure, the second based on the dynamic properties of the system described by the network itself. Since “always structure affects function” (Strogatz (2001)), the topological approach wants to understand networks functionality through the analysis of their structure. For instance, the topological structure of the road network affects critical traffic jam areas, the topology of social networks affects the spread of information and disease and the topology of the power grid affects the robustness and stability of power transmission. Remarkable results have been reached in the topological analysis of networks, concerning the study and characterization of networks structure, and even if far from being complete, several key notions have been introduced. These unifying principles underly the topology of networks belonging to different fields of science. Fundamental are the notions of scale-free network (Barabasi & Albert (1999); Jeong et al. (2000)), cluster (Newman (2006)), network motifs (Milo et al. (2002); Shen-Orr et al. (2002)), small-world property (Watts & Strogatz (1998); Watts (1999); Wagner & Fell (2001)) and centralities. Particularly, centralities have been initially applied to the field of social science (Freeman (1977)) and then to biological networks (Wuchty & Stadler (2003)). Usually, works regarding biological networks rightly consider global properties of the network and when centralities are used, they are often considered from a global point of view, as for example analyzing degree or centralities distribution (Jeong et al. (2000); Wagner & Fell (2001); Wuchty & Stadler (2003); Yamada & Bork (2009); Joy et al. (2005)). A node-oriented approach have been used analyzing attack tolerance of network, where consequences of central nodes deletion are studied (Albert et al. (2000); Crucitti et al. (2004)). But also in this case the analysis have been concentrate on global properties of the network and not on the relevance of the single nodes in the network. Similarly, available software for network analysis is usually oriented to global analysis and characterization of the whole networks. To identify relevant nodes of a biological network, protocols of analysis integrating centralities analysis and lab experimental data are needed and the same for software allowing this kind of analysis. Cytoscape is an excellent visualization and analysis tool with the analysis features greatly enhanced by plug-ins. Plug-in such as NetworkAnalyzer (Assenov et al. (2008)) computes some node centralities but does not allow direct integration with experimental data. Applications such as VisANT 16

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.5772/35846

Cites

6 of 6 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 106

Metadata

Authors
Scardoni, G., & Lau, C.
Venue
New Frontiers in Graph Theory
Publisher
InTech
Published
2012-03-02
OpenAlex
W1517881847
Cited by
106
References
6
FWCI
11.46
Type
book chapter
Language
en
Open access
hybrid

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.