Book Image

Gephi Cookbook

Book Image

Gephi Cookbook

Overview of this book

Table of Contents (18 chapters)
Gephi Cookbook
Credits
About the Author
Acknowledgments
About the Reviewers
www.PacktPub.com
Preface
Index

Finding a graph's PageRank


Just like the HITS algorithm, the PageRank algorithm is a ranking algorithm for the nodes in a graph. It was developed by the founders of Google, Larry Page and Sergey Brin, while they were at Stanford. Later on, Google used this algorithm for ranking webpages in their search results. The PageRank algorithm works on the assumption that a node that receives more links is likely to be an important node in the network. This recipe explains what PageRank actually is and how Gephi could be used to readily compute the PageRank of nodes in a graph.

How to do it…

The following steps describe the process of finding the PageRank of a graph by making use of the capabilities offered by Gephi:

  1. Load the directed version of the Les Misérables network into Gephi.

  2. In the Settings panel, under the Network Overview tab, click on the Run button placed against PageRank.

  3. This opens up the PageRank settings window as shown in the following screenshot:

  4. Choose which version, Directed or UnDirected...