Figure - PMC

Skip to main content

An official website of the United States government

Here's how you know

Here's how you know

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

View full-text article in PMC

. 2016 Dec 14;6:38865. doi: 10.1038/srep38865

Search in PMC
Search in PubMed
View in NLM Catalog
Add to search

Copyright © 2016, The Author(s)

This work is licensed under a Creative Commons Attribution 4.0 International License. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder to reproduce the material. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

PMC Copyright notice

The red nodes are target nodes and others are non-target nodes. (a) The nodes with numbers are the first-order neighbors of the targets. All irrelevant nodes and edges are marked in dashed lines. The numbers on the nodes are obtained by computing f A. (b) The nodes with numbers are the second-order neighbors of the targets. All possible paths with length 2 are considered and the numbers on the nodes are obtained by computing f A². (c) The nodes with numbers are the third-order neighbors of the targets. All possible paths with length 3 are considered and the numbers on the nodes are obtained by computing ²f A³. (d) The aggregated RLP score of non-target nodes are shown in this figure. The orange, blue and green nodes have maximum RLP, degree and k-core values, respectively.

Inline graphic — The red nodes are target nodes and others are non-target nodes. (a) The nodes with numbers are the first-order neighbors of the targets. All irrelevant nodes and edges are marked in dashed lines. The numbers on the nodes are obtained by computing f A. (b) The nodes with numbers are the second-order neighbors of the targets. All possible paths with length 2 are considered and the numbers on the nodes are obtained by computing f A². (c) The nodes with numbers are the third-order neighbors of the targets. All possible paths with length 3 are considered and the numbers on the nodes are obtained by computing ²f A³. (d) The aggregated RLP score of non-target nodes are shown in this figure. The orange, blue and green nodes have maximum RLP, degree and k-core values, respectively.