Localization of the maximal entropy random walk.

  title={Localization of the maximal entropy random walk.},
  author={Zdzislaw Burda and Jarek Duda and J M Luck and Bartlomiej Waclaw},
  journal={Physical review letters},
  volume={102 16},
We define a new class of random walk processes which maximize entropy. This maximal entropy random walk is equivalent to generic random walk if it takes place on a regular lattice, but it is not if the underlying lattice is irregular. In particular, we consider a lattice with weak dilution. We show that the stationary probability of finding a particle performing maximal entropy random walk localizes in the largest nearly spherical region of the lattice which is free of defects. This… 

Figures from this paper

Large deviations of random walks on random graphs.

A modified, biased random walk is constructed that explains how sudden changes in degree fluctuations, similar to dynamical phase transitions, are related to localization transitions and establishes links between the large deviations of the trajectory entropy and the maximum entropy random walk.

Scaling limits of Maximal Entropy Random Walks on a non-negative integer lattice perturbed at the origin

We investigate random walks on the integer lattice perturbed at the origin which maximize the entropy along the path or equivalently the entropy rate. Compared to usual simple random walks which

From Maximal Entropy Random Walk to quantum thermodynamics

Surprisingly, the natural looking random walk leading to Brownian motion occurs to be often biased in a very subtle way: emphasizing some possibilities by only approximating maximal uncertainty

Extended Maximal Entropy Random Walk

There are mainly used two basic approaches for probabilistic modeling of motion: stochastic in which the object literally makes succeeding random decisions using arbitrarily chosen by us

Random walks on weighted networks: a survey of local and non-local dynamics

A survey of different types of random walk models with local and non-local transitions on undirected weighted networks by defining the dynamics as a discrete-time Markovian process with transition probabilities expressed in terms of a symmetric matrix of weights.

Maximal entropy random walk in community detection

The aim of this paper is to check feasibility of using the maximal-entropy random walk in algorithms finding communities in complex networks, using a stochastic matrix of a random walk, its mean first-passage time matrix, and a matrix of weighted paths count.

Maximal-entropy random walks in complex networks with limited information.

It is demonstrated that an almost maximal-entropy random walk is obtained when the step probabilities are proportional to a power of the degree of the target node, with an exponent α that depends on the degree-degree correlations and is equal to 1 in uncorrelated graphs.

Random walk with memory on complex networks.

The numerical experiments on paradigmatic complex networks verify the validity of the theoretical expressions, and indicate that the flattening of the stationary occupation probability accompanies a nearly optimal random search.

Core-biased random walks in complex networks

It is shown that it is also possible to construct a good approximation to a Maximal Entropy Random Walk by biasing the random walk via the properties of the network's core, which is a mesoscale property of thenetwork.

Core-biased random walks in networks

  • R. Mondragón
  • Mathematics, Computer Science
    J. Complex Networks
  • 2018
It is shown that it is also possible to construct a good approximation to a MERW by biasing the random walk via the properties of the network’s core, and some examples show that the core-biased random walk outperforms the degree- biased random walks.



Critical scaling in standard biased random walks.

A very rich critical phenomenology is revealed in a simple one-dimensional standard model, for appropriate step sizes, at p=p(c), where the distribution of fragment lengths is scale-free, with nontrivial exponents.

Universal record statistics of random walks and Lévy flights.

It is shown that statistics of records for time series generated by random walks are independent of the details of the jump distribution, as long as the latter is continuous and symmetric. In N

Random walks on complex networks.

The random walk centrality C is introduced, which is the ratio between its coordination number and a characteristic relaxation time, and it is shown that it determines essentially the mean first-passage time (MFPT) between two nodes.

Spectra of Random Self Adjoint Operators

This survey contains an exposition of the results obtained in the studying the spectra of certain classes of random operators. It consists of three chapters. In the introductory Chapter I we survey

The long time properties of diffusion in a medium with static traps

We investigate the long time behavior of diffusion controlled absorption by randomly distributed static traps without resorting to perturbative calculations. The main idea is that the long time

Large deviations and Lifshitz singularity of the integrated density of states of random Hamiltonians

We consider the integrated density of states (IDS) ρ∞(λ) of random Hamiltonian Hω=−Δ+Vω, Vω being a random field on ℝd which satisfies a mixing condition. We prove that the probability of large

Density of electronic energy levels in disordered systems

The behavior of the density of electronic energy levels for a simple model of a disordered system is studied in the limit of very low energies. By reformulating the problem as one in Brownian motion,

Glassy dynamics of kinetically constrained models

We review the use of kinetically constrained models (KCMs) for the study of dynamics in glassy systems. The characteristic feature of KCMs is that they have trivial, often non-interacting,