NETWORKS & SYSTEMS

PageRank iteration

uses random walk and jump distribution to find the steady-state weight of network nodes.

r=αPr+(1−α)vr=\alpha Pr+(1-\alpha)v

symbols, variables and units

P: column random transfer matrix; r, v: probability vector; α∈(0,1): damping coefficient.

applicable conditions and boundaries

needs to deal with dangling nodes so that the column sum is 1; sorting depends on the network and jump distribution.

formula source code

The following is a copyable LaTeX expression.

r=\alpha Pr+(1-\alpha)v

Reference and Extended Learning

MIT OpenCourseWare · Network Science ↗

is organized according to model definition and assumptions. Please check actual conditions and original literature before engineering, research and clinical use.

PageRankgraph algorithm

Same subject formula

Go to Free Science Tool Library ↗