Maximal-entropy random walks in complex networks with limited information

Sinatra, R. (2011). Maximal-entropy random walks in complex networks with limited information.

Type

Unclassified

Intellectual base

Unclassified

Year

2011

DOI

10.1103/physreve.83.030103

Link

https://doi.org/10.1103/physreve.83.030103

Cited by

1 citation across 1 artifact.

Domain-specific

• Biased random walk on a graph
  • Bias must be distinguished from directed edges and nonreversible dynamics, normalization depends on current neighbors, zero weights can destroy irreducibility and stationary distributions change with weight symmetry and temporal dependence.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:2ae27065dc2d · see in the full table