Maximal entropy random walk
id:
maximal-entropy-random-walk-277-11270207
title:
Maximal entropy random walk
text:
Maximal entropy random walk (MERW) is a popular type of biased random walk on a graph, in which transition probabilities are chosen accordingly to the principle of maximum entropy, which says that the probability distribution which best represents the current state of knowledge is the one with largest entropy. While standard random walk chooses for every vertex uniform probability distribution among its outgoing edges, locally maximizing entropy rate, MERW maximizes it globally by assuming unifo
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Maximal_entropy_random_walk
date created:
date modified:
2023-11-28T23:25:25Z
main entity:
{"identifier":"Q30591435","url":"https://www.wikidata.org/entity/Q30591435"}
image:
fields total:
13
integrity:
13