Skip to content

Instantly share code, notes, and snippets.

Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save wolfram77/e5ac7b1981c03d77f681806d2a36fede to your computer and use it in GitHub Desktop.
Save wolfram77/e5ac7b1981c03d77f681806d2a36fede to your computer and use it in GitHub Desktop.
An Improved PageRank Algorithm for Multilayer Networks : NOTES

Highlighted notes on:
An Improved PageRank Algorithm for Multilayer Networks.
While doing research work with Prof. Kishore Kothapalli.

The authors use a layer-layer weight to provide an additional factor to PR which they then use in the 1st step of SpreadMax algorithm to show that their modified pagerank is better than standard PR in selecting key nodes. I didnt properly understand this.

Applications of networks: Social networks, Air traffic systems, Transportation networks, Citation networks, Biological systems (infection spreading).

Multilayer networks can be thought of as a large graph subdivided into multiple groups (layers). This probably makes it easier to assign common weights to a particular group of nodes, edges.

Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment