Maximal entropy random walk. 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 (average entropy production) by assuming uniform probability distribution among all paths in a given graph.

MERW is used in various fields of science. A direct application is choosing probabilities to maximize transmission rate through a constrained channel, analogously to Fibonacci coding. Its properties also made it useful for example in analysis of complex networks, like link prediction, community detection,
robust transport over networks and centrality measures. Also in image analysis, for example for detecting visual saliency regions, object localization, tampering detection or tractography problem.

Additionally, it recreates some properties of quantum mechanics, suggesting a way to repair the discrepancy between diffusion models and quantum predictions, like Anderson localization.

Basic model 

Consider a graph with  vertices, defined by an adjacency matrix :  if there is an edge from vertex  to , 0 otherwise. For simplicity assume it is an undirected graph, which corresponds to a symmetric ; however, MERW can also be generalized for directed and weighted graphs (for example Boltzmann distribution among paths instead of uniform).

We would like to choose a random walk as a Markov process on this graph: for every vertex  and its outgoing edge to , choose probability  of the walker randomly using this edge after visiting . Formally, find a stochastic matrix  (containing the transition probabilities of a Markov chain) such that
  for all  and
  for all .
Assuming this graph is connected and not periodic, ergodic theory says that evolution of this stochastic process leads to some stationary probability distribution  such that .

Using Shannon entropy for every vertex and averaging over probability of visiting this vertex (to be able to use its entropy), we get the following formula for average entropy production (entropy rate) of the stochastic process:

This definition turns out to be equivalent to the asymptotic average entropy (per length) of the probability distribution in the space of paths for this stochastic process.

In the standard random walk, referred to here as generic random walk (GRW), we naturally choose that each outgoing edge is equally probable:
.
For a symmetric  it leads to a stationary probability distribution  with
.
It locally maximizes entropy production (uncertainty) for every vertex, but usually leads to a suboptimal averaged global entropy rate .

MERW chooses the stochastic matrix which maximizes , or equivalently assumes uniform probability distribution among all paths in a given graph. Its formula is obtained by first calculating the dominant eigenvalue  and corresponding eigenvector  of the adjacency matrix, i.e. the largest  with corresponding  such that . Then stochastic matrix and stationary probability distribution are given by

for which every possible path of length  from the -th to -th vertex has probability
.
Its entropy rate is  and the stationary probability distribution  is
.

In contrast to GRW, the MERW transition probabilities generally depend on the structure of the entire graph (are nonlocal). Hence, they should not be imagined as directly applied by the walker – if random-looking decisions are made based on the local situation, like a person would make, the GRW approach is more appropriate. MERW is based on the principle of maximum entropy, making it the safest assumption when we don't have any additional knowledge about the system. For example, it would be appropriate for modelling our knowledge about an object performing some complex dynamics – not necessarily random, like a particle.

Sketch of derivation 
Assume for simplicity that the considered graph is indirected, connected and aperiodic, allowing to conclude from the Perron–Frobenius theorem that the dominant eigenvector is unique. Hence  can be asymptotically () approximated by  (or  in bra–ket notation).

MERW requires uniform distribution along paths. The number  of paths with length  and vertex  in the center is
,
hence for all ,
.

Analogously calculating probability distribution for two succeeding vertices, one obtains that the probability of being at the -th vertex and next at the -th vertex is
.
Dividing by the probability of being at the -th vertex, i.e. , gives for the conditional probability  of the -th vertex being next after the -th vertex
.

Weighted MERW: Boltzmann path ensemble 
We have assumed that  for MERW corresponding to uniform ensemble among paths. However, the above derivation works for real nonnegative . Parametrizing  and asking for probability of length  path , we get:

As in Boltzmann distribution of paths for energy defined as sum of  over given path. For example, it allows to calculate probability distribution of patterns in Ising model.

Examples 

Let us first look at a simple nontrivial situation: Fibonacci coding, where we want to transmit a message as a sequence of 0s and 1s, but not using two successive 1s: after a 1 there has to be a 0. To maximize the amount of information transmitted in such sequence, we should assume uniform probability distribution in the space of all possible sequences fulfilling this constraint. To practically use such long sequences, after 1 we have to use 0, but there remains a freedom of choosing the probability of 0 after 0. Let us denote this probability by , then entropy coding would allow encoding a message using this chosen probability distribution. The stationary probability distribution of symbols for a given  turns out to be . Hence, entropy production is , which is maximized for , known as the golden ratio. In contrast, standard random walk would choose suboptimal . While choosing larger  reduces the amount of information produced after 0, it also reduces frequency of 1, after which we cannot write any information.

A more complex example is the defected one-dimensional cyclic lattice: let say 1000 nodes connected in a ring, for which all nodes but the defects have a self-loop (edge to itself). In standard random walk (GRW) the stationary probability distribution would have defect probability being 2/3 of probability of the non-defect vertices – there is nearly no localization, also analogously for standard diffusion, which is infinitesimal limit of GRW. For MERW we have to first find the dominant eigenvector of the adjacency matrix – maximizing  in:

for all positions , where  for defects, 0 otherwise. Substituting  and multiplying the equation by −1 we get:

where  is minimized now, becoming the analog of energy. The formula inside the bracket is discrete Laplace operator, making this equation a discrete analogue of stationary Schrodinger equation. As in quantum mechanics, MERW predicts that the probability distribution should lead exactly to the one of quantum ground state:  with its strongly localized density (in contrast to standard diffusion). Taking the infinitesimal limit, we can get standard continuous stationary (time-independent) Schrodinger equation ( for ) here.

See also
 Principle of maximum entropy
 Eigenvector centrality
 Markov chain
 Anderson localization

References

External links 
 Gábor Simonyi, Y. Lin, Z. Zhang,  "Mean first-passage time for maximal-entropy random walks in complex networks". Scientific Reports, 2014.
  Electron Conductance Models Using Maximal Entropy Random Walks Wolfram Demonstration Project

Network theory
Diffusion
Information theory
Quantum mechanics