Degree Heterogeneity in a Graph Facilitates Quicker Meeting of Random Walkers

05/22/2020
by   Yusuke Sakumoto, et al.
0

Multiple random walks is a model for movement of several independent random walkers on a graph, and it is applied to various graph algorithms. In order to design an efficient graph algorithm using multiple random walks, it is essential to study theoretical considerations for deeply understanding the characteristics of graph algorithms. The first meeting time is one of the important metrics for the multiple random walks. The first meeting time is defined as the time it takes for multiple random walkers to meet on a same node. The first meeting time is closely related to the rendezvous problem. In various works, the first meeting time of multiple random walk has been analyzed. However, many of these previous works focused on regular graphs. In this paper, we analyze first meeting time of multiple random walks in arbitrary graph, and clarify the effect of graph structures on its expected value. First, we derive the spectral formula for the expected first meeting time of two random walkers using the spectral graph theory. Then, the principal component of the expected first meeting time are examined using the derived spectral formula. The resulting principal component reveals that (a) the expected first meeting time is almost dominated by n/(1+d_ std^2/d_ avg^2) and (b)the expected first meeting time is independent of the beginning nodes of multiple random walks where n is the number of nodes. d_ avg and d_ std are the mean and standard deviation of the weighted degree of each node, respectively. n and d_ avg, and d_ std are related to the statistics of graph structures. According to the analysis result, the variance of coefficient for weighted degrees, d_ std/d_ avg (degree heterogeneity), facilitates quicker the meeting of random walkers.

READ FULL TEXT

page 1

page 2

research
05/22/2020

Graph Degree Heterogeneity Facilitates Random Walker Meetings

Various graph algorithms have been developed with multiple random walks,...
research
05/30/2021

Hitting times for non-backtracking random walks

A non-backtracking random walk on a graph is a random walk where, at eac...
research
12/04/2019

Robotic Surveillance Based on the Meeting Time of Random Walks

This paper analyzes the meeting time between a pair of pursuer and evade...
research
05/20/2019

Random Walks on Hypergraphs with Edge-Dependent Vertex Weights

Hypergraphs are used in machine learning to model higher-order relations...
research
10/05/2021

Exact and Approximate Mean First Passage Times on Trees and other Necklace Structures: a Local Equilibrium Approach

In this work we propose a novel method to calculate mean first-passage t...
research
05/19/2023

Meeting Times of Non-atomic Random Walks

In this paper, we revisit the problem of classical meeting times of rand...
research
05/19/2022

Hippocluster: an efficient, hippocampus-inspired algorithm for graph clustering

Random walks can reveal communities or clusters in networks, because the...

Please sign up or login with your details

Forgot password? Click here to reset