Cumulative centrality index: Centrality measures based ranking technique for molecular chemical structural graphs

2022 ◽  
Vol 1247 ◽  
pp. 131354
Author(s):  
Parisutham Nirmala ◽  
Rethnasamy Nadarajan
Keyword(s):  
Centrality Measures ◽  
Centrality Index ◽  
Ranking Technique

Transient Stability Ranking Technique based on System Parameter Estimation and Extended Equal-Area Criterion

2008 ◽  
Vol 128 (1) ◽  
pp. 101-109 ◽  
Author(s):  
Akira Takeuchi ◽  
Takashi Sato ◽  
Kouya Takafuji ◽  
Hideaki Nishiiri ◽  
Kotaro Takasaki ◽  
...  
Keyword(s):  
Parameter Estimation ◽  
System Parameter ◽  
Transient Stability ◽  
Equal Area ◽  
Stability Ranking ◽  
Ranking Technique

Analysis of Oncogene Protein Structure Using Small World Network Concept

2020 ◽  
Vol 15 (7) ◽  
pp. 732-740
Author(s):  
Neetu Kumari ◽  
Anshul Verma
Keyword(s):  
Amino Acids ◽  
Protein Structure ◽  
Degree Distribution ◽  
Protein Structures ◽  
Small World ◽  
Extreme Condition ◽  
Centrality Measures ◽  
Small World Network ◽  
Network Concept ◽  
Oncogene Protein

Background: The basic building block of a body is protein which is a complex system whose structure plays a key role in activation, catalysis, messaging and disease states. Therefore, careful investigation of protein structure is necessary for the diagnosis of diseases and for the drug designing. Protein structures are described at their different levels of complexity: primary (chain), secondary (helical), tertiary (3D), and quaternary structure. Analyzing complex 3D structure of protein is a difficult task but it can be analyzed as a network of interconnection between its component, where amino acids are considered as nodes and interconnection between them are edges. Objective: Many literature works have proven that the small world network concept provides many new opportunities to investigate network of biological systems. The objective of this paper is analyzing the protein structure using small world concept. Methods: Protein is analyzed using small world network concept, specifically where extreme condition is having a degree distribution which follows power law. For the correct verification of the proposed approach, dataset of the Oncogene protein structure is analyzed using Python programming. Results: Protein structure is plotted as network of amino acids (Residue Interaction Graph (RIG)) using distance matrix of nodes with given threshold, then various centrality measures (i.e., degree distribution, Degree-Betweenness correlation, and Betweenness-Closeness correlation) are calculated for 1323 nodes and graphs are plotted. Conclusion: Ultimately, it is concluded that there exist hubs with higher centrality degree but less in number, and they are expected to be robust toward harmful effects of mutations with new functions.

Centrality Measures

2018 ◽  
Author(s):  
Ginestra Bianconi
Keyword(s):  
State Of The Art ◽  
Centrality Measures ◽  
Eigenvector Centrality ◽  
Multilayer Networks ◽  
Comprehensive Description ◽  
Multilayer Network ◽  
Suitable Definition ◽  
Katz Centrality ◽  
Pagerank Centrality

Defining the centrality of nodes and layers in multilayer networks is of fundamental importance for a variety of applications from sociology to biology and finance. This chapter presents the state-of-the-art centrality measures able to characterize the centrality of nodes, the influences of layers or the centrality of replica nodes in multilayer and multiplex networks. These centrality measures include modifications of the eigenvector centrality, Katz centrality, PageRank centrality and Communicability to the multilayer network scenario. The chapter provides a comprehensive description of the research of the field and discusses the main advantages and limitations of the different definitions, allowing the readers that wish to apply these techniques to choose the most suitable definition for his or her case study.

Three Perspectives on Centrality

2020 ◽  
pp. 333-351
Author(s):  
Stephen P. Borgatti ◽  
Martin G. Everett
Keyword(s):  
Centrality Measures ◽  
Graph Invariant ◽  
Propagation Process ◽  
Centrality Measure ◽  
The Third ◽  
First Arrival ◽  
The Difference

This chapter presents three different perspectives on centrality. In part, the motivation is definitional: what counts as a centrality measure and what doesn’t? But the primary purpose is to lay out ways that centrality measures are similar and dissimilar and point to appropriate ways of interpreting different measures. The first perspective the chapter considers is the “walk structure participation” perspective. In this perspective, centrality measures indicate the extent and manner in which a node participates in the walk structure of a graph. A typology is presented that distinguishes measures based on dimensions such as (1) what kinds of walks are considered (e.g., geodesics, paths, trails, or unrestricted walks) and (2) whether the number of walks is counted or the length of walks is assessed, or both. The second perspective the chapter presents is the “induced centrality” perspective, which views a node’s centrality as its contribution to a specific graph invariant—typically some measure of the cohesiveness of the network. Induced centralities are computed by calculating the graph invariant, removing the node in question, and recalculating the graph invariant. The difference is the node’s centrality. The third perspective is the “flow outcomes” perspective. Here the chapter views centralities as estimators of node outcomes in some kind of propagation process. Generic node outcomes include how often a bit of something propagating passes through a node and the time until first arrival of something flowing. The latter perspective leads us to consider the merits of developing custom measures for different research settings versus using off-the-shelf measures that were not necessarily designed for the current purpose.

scholarly journals Topological measures for identifying and predicting the spread of complex contagions

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Douglas Guilbeault ◽  
Damon Centola
Keyword(s):  
Social Networks ◽  
Shortest Path ◽  
Empirical Data ◽  
Path Length ◽  
Centrality Measures ◽  
Social Phenomena ◽  
Node Centrality ◽  
Network Connectedness ◽  
Topological Measures ◽  
Definition Of

AbstractThe standard measure of distance in social networks – average shortest path length – assumes a model of “simple” contagion, in which people only need exposure to influence from one peer to adopt the contagion. However, many social phenomena are “complex” contagions, for which people need exposure to multiple peers before they adopt. Here, we show that the classical measure of path length fails to define network connectedness and node centrality for complex contagions. Centrality measures and seeding strategies based on the classical definition of path length frequently misidentify the network features that are most effective for spreading complex contagions. To address these issues, we derive measures of complex path length and complex centrality, which significantly improve the capacity to identify the network structures and central individuals best suited for spreading complex contagions. We validate our theory using empirical data on the spread of a microfinance program in 43 rural Indian villages.

Influential nodes in planar trusses and meshes using centrality measures

2021 ◽  
Author(s):  
P. Sangeetha ◽  
R. Sundareswaran ◽  
M. Shanmugapriya ◽  
S. Srinidhi ◽  
K. Sowmya
Keyword(s):  
Centrality Measures ◽  
Influential Nodes

scholarly journals Time to Intervene: A Continuous-Time Approach to Network Analysis and Centrality

Psychometrika ◽  
2021 ◽  
Author(s):  
Oisín Ryan ◽  
Ellen L. Hamaker
Keyword(s):  
Network Analysis ◽  
Discrete Time ◽  
Continuous Time ◽  
Centrality Measures ◽  
Time Interval ◽  
Direct Effects ◽  
Network Approach ◽  
Var Models ◽  
Auto Regressive ◽  
Conceptual Shift

AbstractNetwork analysis of ESM data has become popular in clinical psychology. In this approach, discrete-time (DT) vector auto-regressive (VAR) models define the network structure with centrality measures used to identify intervention targets. However, VAR models suffer from time-interval dependency. Continuous-time (CT) models have been suggested as an alternative but require a conceptual shift, implying that DT-VAR parameters reflect total rather than direct effects. In this paper, we propose and illustrate a CT network approach using CT-VAR models. We define a new network representation and develop centrality measures which inform intervention targeting. This methodology is illustrated with an ESM dataset.

Sign in / Sign up

Export Citation Format

Share Document