A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Core-biased random walks in complex networks
[article]

2017
*
arXiv
*
pre-print

A simple strategy to explore a network is to use a random-walk where the walker jumps from one node to an adjacent node at random. It is known that biasing the random jump, the walker can explore every walk of the same length with equal probability, this is known as a Maximal Entropy Random Walk (MERW). To construct a MERW requires the knowledge of the largest eigenvalue and corresponding eigenvector of the adjacency matrix, this requires global knowledge of the network. When this global

arXiv:1709.07715v1
fatcat:uzx75cyv65cgbihc2ir2vaeqpy