Algorithm 1 Calculating the PageRank of nodes in the ACMN.

Input: $\mathcal{M}=\left\{G^{\mathbf{T}},G^{\mathbf{H}},G^{\mathbf{K}}\right\}$

Output: Multiplex PageRank of nodes in $\mathcal{M}$

1: Calculate the largest eigenvalue of each layer.

2: Arrange the layers in descending order of their eigenvalues as a larger eigenvalue indicates faster information dissemination [37].

3: Calculate the PageRank of the 1st layer using Equation (5).

4: Calculate the PageRank of the 2nd layer with respect to the 1st layer using Equation (6).

5: Calculate the PageRank of the 3rd layer with respect to the 2nd layer according to Equation (6).

6: Return: The PageRank of the 3rd layer is the PageRank of the ACMN.