scholarly journals A Graph-Based Extension for the Set-Based Model Implementing Algorithms Based on Important Nodes

2020 ◽  
pp. 143-154
Author(s):  
Nikitas-Rigas Kalogeropoulos ◽  
Ioannis Doukas ◽  
Christos Makris ◽  
Andreas Kanavos
Keyword(s):  
Important Nodes

Identifying important nodes for temporal networks based on the ASAM model

2021 ◽  
pp. 126455
Author(s):  
Jiu-lei Jiang ◽  
Hui Fang ◽  
Sheng-qing Li ◽  
Wei-min Li
Keyword(s):  
Temporal Networks ◽  
Important Nodes

scholarly journals Searching Algorithm of Dormant Node in Wireless Sensor Networks

2017 ◽  
Vol 13 (05) ◽  
pp. 122 ◽  
Author(s):  
Bo Feng ◽  
Wei Tang ◽  
Guofa Guo
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Sensor Network ◽  
Delaunay Triangulation ◽  
Base Station ◽  
Wireless Sensor ◽  
Effective Mechanism ◽  
Dormant State ◽  
Important Nodes

In wireless sensor networks, the nodes around the base station have higher energy consumption due to the forwarding task of all the detected data. In order to balance the energy consumption of the nodes around the base station, a reasonable and effective mechanism of node rotation dormancy is put forward. In this way, a large number of redundant nodes in the network are in a dormant state, so as to reduce the load of important nodes around the base station. The problems of the redundant nodes in the sensor network are analyzed, and a new method is proposed to distinguish the redundant nodes based on local Delaunay triangulation and multi node election dormancy mechanism. The experimental results showed that this method could effectively distinguish the redundant nodes in the network; at the same time, through the multi round election mechanism, parts of redundant nodes are made dormant. In summary, they can reduce the network energy consumption on the condition of guaranteeing the original coverage.

scholarly journals Disease genes and intracellular protein networks

2003 ◽  
Vol 15 (3) ◽  
pp. 223-227 ◽  
Author(s):  
S. Bortoluzzi ◽  
C. Romualdi ◽  
A. Bisognin ◽  
G. A. Danieli
Keyword(s):  
Protein Network ◽  
Cdna Libraries ◽  
Protein Networks ◽  
Disease Genes ◽  
Intracellular Protein ◽  
Scale Free ◽  
Specific Distribution ◽  
Human Genes ◽  
Genome Level ◽  
Important Nodes

By a computational approach we reconstructed genomic transcriptional profiles of 19 different adult human tissues, based on information on activity of 27,924 genes obtained from unbiased UniGene cDNA libraries. In each considered tissue, a small number of genes resulted highly expressed or “tissue specific.” Distribution of gene expression levels in a tissue appears to follow a power law, thus suggesting a correspondence between transcriptional profile and “scale-free” topology of protein networks. The expression of 737 genes involved in Mendelian diseases was analyzed, compared with a large reference set of known human genes. Disease genes resulted significantly more expressed than expected. The possible correspondence of their products to important nodes of intracellular protein network is suggested. Auto-organization of the protein network, its stability in time in the differentiated state, and relationships with the degree of genetic variability at genome level are discussed.

scholarly journals Identifying important nodes from content-associated heterogeneous graph by LeaderRank

2021 ◽  
Vol 2113 (1) ◽  
pp. 012082
Author(s):  
Yulong Dai ◽  
Qiyou Shen ◽  
Xiangqian Xu ◽  
Jun Yang
Keyword(s):  
Real World ◽  
Experimental Analysis ◽  
Differential Information ◽  
World Systems ◽  
Ranking Problem ◽  
Data Set ◽  
Importance Ranking ◽  
Basic Concepts ◽  
Important Nodes ◽  
Graph Nodes

Abstract Most real-world systems consist of a large number of interacting entities of many types. However, most of the current researches on systems are based on the assumption that the type of node or link in the network is unique. In other words, the network is homogeneous, containing the same type of nodes and links. Based on this assumption, differential information between nodes and edges is ignored. This paper firstly introduces the research background, challenges and significance of this research. Secondly, the basic concepts of the model are introduced. Thirdly, a novel type-sensitive LeaderRank algorithm is proposed and combined with distance rule to solve the importance ranking problem of content-associated heterogeneous graph nodes. Finally, the writer influence data set is used for experimental analysis to further prove the validity of the model.

scholarly journals Identification of Important Nodes in Directed Biological Networks: A Network Motif Approach

PLoS ONE ◽  
2014 ◽  
Vol 9 (8) ◽  
pp. e106132 ◽  
Author(s):  
Pei Wang ◽  
Jinhu Lü ◽  
Xinghuo Yu
Keyword(s):  
Biological Networks ◽  
Network Motif ◽  
Important Nodes

SHOMAN: An Efficient Method for Finding the Important Nodes in a Network

2021 ◽  
Vol 19 (1) ◽  
pp. 1
Author(s):  
Omprakash Sah ◽  
Shivam Bathla ◽  
Anurag Singh
Keyword(s):  
Efficient Method ◽  
Important Nodes
Sign in / Sign up

Export Citation Format

Share Document