相关论文: Exact Solution for Statics and Dynamics of Maximal…

We focus on the study of dynamics of two kinds of random walk: generic random walk (GRW) and maximal entropy random walk (MERW) on two model networks: Cayley trees and ladder graphs. The stationary probability distribution for MERW is given…

We use maximal entropy random walk (MERW) to study the trapping problem in dendrimers modeled by Cayley trees with a deep trap fixed at the central node. We derive an explicit expression for the mean first passage time from any node to the…

We review various features of the statistics of random paths on graphs. The relationship between path statistics and Quantum Mechanics (QM) leads to two canonical ways of defining random walk on a graph, which have different statistics and…

The Maximal Entropy Random Walk (MERW) is a natural process on a finite graph, introduced a few years ago with motivations from theoretical physics. The construction of this process relies on Perron-Frobenius theory for adjacency matrices.…

We introduce and develop the concept of Maximal Entropy Random Walks (MERWs) on Weighted Bratteli Diagrams (WBDs), maximizing entropy production along paths as a natural criterion for choosing random walks on networks. Initially defined for…

In this article, we establish solid foundations for the study of Maximal Entropy Random Walks (MERWs) on infinite graphs. We introduce a generalized definition that extends the original concept, along with rigorous tools for handling this…

We define the Uniform Random Walk (URW) on a connected, locally finite graph as the weak limit of the uniform walk of length $n$ starting at a fixed vertex. When the limit exists, it is necessarily Markovian and is independent of the…

Maximum entropy random walks (MERWs) are maximally dispersing and play a key role in optimizing information spreading in various contexts. However, building MERWs comes at the cost of knowing beforehand the global structure of the network,…

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…

We show that the entanglement between the internal (spin) and external (position) degrees of freedom of a qubit in a random (dynamically disordered) one-dimensional discrete time quantum random walk (QRW) achieves its maximal possible value…

Relaxed random walk (RRW) models of trait evolution introduce branch-specific rate multipliers to modulate the variance of a standard Brownian diffusion process along a phylogeny and more accurately model overdispersed biological data.…

Using the continuous-time random walk (CTRW) approach, we study the phenomenon of relaxation of two-state systems whose elements evolve according to a dichotomous process. Two characteristics of relaxation, the probability density function…

The purpose of this paper is to investigate the asymptotic behavior of the multi-dimensional elephant random walk (MERW). It is a non-Markovian random walk which has a complete memory of its entire history. A wide range of literature is…

We describe particles in a potential by a special diffusion process, the maximal entropy random walk (MERW) on a lattice. Since MERW originates in a variational problem, it shares the linear algebra of Hilbert spaces with quantum mechanics.…

The goal of this paper is to investigate the asymptotic behavior of the multidimensional elephant random walk with stops (MERWS). In contrast with the standard elephant random walk, the elephant is allowed to stay on his own position. We…

We perform an in-depth study for mean first-passage time (MFPT)---a primary quantity for random walks with numerous applications---of maximal-entropy random walks (MERW) performed in complex networks. For MERW in a general network, we…

In this work, we discuss the smoothly amnesia-reinforced multidimensional elephant random walk (MARW). The scaling limit of the MARW is shown to exist in the diffusive, critical and superdiffusive regimes. We also establish the almost sure…

Random walks in random environments (RWRE) model transport in quenched disorder, incorporating spatial heterogeneity, trapping, random drift, and random geometry. This paper summarizes discrete and continuous time formulations, identifies…

Random walks on dynamic graphs have received increasingly more attention from different academic communities over the last decade. Despite the relatively large literature, little is known about random walks that construct the graph where…

We consider random walks on a tree $G=(V,E)$ with stationary distribution $\pi_v = \mathrm{deg}(v)/2|E|$ for $v \in V$. Let the hitting time $H(v,w)$ denote the expected number of steps required for the random walk started at vertex $v$ to…