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

  title={Random walks on weighted networks: a survey of local and non-local dynamics},
  author={Alejandro P. Riascos and Jos{\'e} L. Mateos},
  journal={J. Complex Networks},
In this article, we present a survey of different types of random walk models with local and non-local transitions on undirected weighted networks. We present a general approach by defining the dynamics as a discrete-time Markovian process with transition probabilities expressed in terms of a symmetric matrix of weights. In the first part, we describe the matrices of weights that define local random walk dynamics like the normal random walk, biased random walks and preferential navigation… 

Squirrels Can Little Remember: A Random Walk with Jump Reversals Induced by a Discrete-Time Renewal Process

We consider a class of discrete-time random walks with directed unit steps on the integer line. The direction of the steps is reversed at the time instants of events in a discrete-time renewal

Simple model of epidemic dynamics with memory effects.

A modified SIR model with memory for the dynamics of epidemic spreading in a constant population of individuals, which causes persistent oscillations in the number of infected individuals with ongoing epidemic activity preventing the system from relaxation to a steady state solution.

A four compartment epidemic model with retarded transition rates

We study an epidemic model for a constant population by taking into account four compartments of the individuals characterizing their states of health. Each individual is in one of the compartments

Discovering Polarization Niches via Dense Subgraphs with Attractors and Repulsers

This paper builds on recent algorithmic advances in supermodular maximization to provide an iterative greedy algorithm, dubbed Down in the Hollow (dith), that converges fast to a near-optimal solution and is able to equip dith with a practical device that allows to terminate as soon as a solution with a user-specified approximation factor is found, making the algorithm very efficient in practice.

Eigenvalues of transition weight matrix for a family of weighted networks

The obtained results show that the random target access is not affected by the weight; it is only affected by parameters m m and t t .

Optimal exploration of random walks with local bias on networks.

We propose local-biased random walks on general networks where a Markovian walker is defined by different types of biases in each node to establish transitions to its neighbors depending on their

Decay bounds for Bernstein functions of Hermitian matrices with applications to the fractional graph Laplacian

  • M. Schweitzer
  • Mathematics
    ETNA - Electronic Transactions on Numerical Analysis
  • 2022
This paper focuses on the class of Bernstein functions, which contains the fractional powers Aα, α ∈ (0, 1) as an important special case, and derives new decay bounds by exploiting known results for the matrix exponential in conjunction with the Lévy–Khintchine integral representation.



Random walks with long-range steps generated by functions of Laplacian matrices

In this paper, we explore different Markovian random walk strategies on networks with transition probabilities between nodes defined in terms of functions of the Laplacian matrix. We generalize

Mean First Passage Time of Preferential Random Walks on Complex Networks with Applications

This paper investigates, both theoretically and numerically, preferential random walks (PRW) on weighted complex networks. By using two different analytical methods, two exact expressions are derived

Lévy random walks on multiplex networks

This work derives analytical expressions for the mean first passage time and the average time to reach a node on multiplex networks from spectral graph and stochastic matrix theories and finds that in some region of the parameters, a Lévy random walk is the most efficient strategy.

Random Walks on Graphs: a Survey

Dedicated to the marvelous random walk of Paul Erd} os through universities, c ontinents, and mathematics Various aspects of the theory of random walks on graphs are surveyed. In particular,

Biased random walks on multiplex networks

This work introduces biased random walks on multiplex networks and provides analytical solutions for their long-term properties such as the stationary distribution and the entropy rate, and distinguishes between two subclasses of random walks.

Fractional random walk lattice dynamics

We analyze time-discrete and time-continuous ‘fractional’ random walks on undirected regular networks with special focus on cubic periodic lattices in n  =  1, 2, 3,.. dimensions. The fractional

Biased random walks in complex networks: the role of local navigation rules.

  • A. FronczakP. Fronczak
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2009
The biased random-walk process in random uncorrelated networks with arbitrary degree distributions is studied to provide the basis for a theoretical treatment of transport-related problems in complex networks, including quantitative estimation of the critical value of the packet generation rate.

Random walks in weighted networks with a perfect trap: an application of Laplacian spectra.

  • Yuan LinZhongzhi Zhang
  • Mathematics, Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2013
This paper proposes a general framework for the trapping problem on a weighted network with a perfect trap fixed at an arbitrary node, and deduces an explicit expression for average trapping time (ATT) in terms of the eigenvalues and eigenvectors of the Laplacian matrix associated with the weighted graph.

Fractional dynamics on networks: emergence of anomalous diffusion and Lévy flights.

The general fractional diffusion formalism applies to regular, random, and complex networks and can be implemented from the spectral properties of the Laplacian matrix, providing an important tool to analyze anomalous diffusion on networks.