From NetLogo Modeling of Deterministic Random Walk to the Identification of Asymmetric Saturation Time in Random Graphs

by   Ayan Chatterjee, et al.

Interactive programming environments are powerful tools for promoting innovative network thinking, teaching complexity science, and exploring emergent phenomena. This paper reports on our recent development of the deterministic random walk model in NetLogo, a leading platform for computational thinking, eco-system thinking, and multi-agent cross-platform programming environment. The deterministic random walk is foundational to modeling dynamical processes on complex networks. Inspired by the temporal visualizations offered in NetLogo, we investigated the relationship between network topology and diffusion saturation time for the deterministic random walk model. Our analysis uncovers that in Erdos-Renyi graphs, the saturation time exhibits an asymmetric pattern with a considerable probability of occurrence. This behavior occurs when the hubs, defined as nodes with relatively higher number of connections, emerge in Erdos-Renyi graphs. Yet, our analysis yields that the Barabasi-Albert model hubs stabilize the the convergence time of the deterministic random walk model. These findings strongly suggest that depending on the dynamical process running on complex networks, complementing characteristics other than the degree need to be taken into account for considering a node as a hub. We have made our development open-source, available to the public at no cost at


page 5

page 6

page 11


Mixing time of random walk on dynamical random cluster

We study the mixing time of a random walker who moves inside a dynamical...

Random Walk Fundamental Tensor and its Applications to Network Analysis

We first present a comprehensive review of various random walk metrics u...

Weighted Jump in Random Walk Graph Sampling

Random walk based sampling methods have been widely used in graph sampli...

Cooperative motion in one dimension

We prove distributional convergence for a family of random processes on ...

Frequency patterns of semantic change: Corpus-based evidence of a near-critical dynamics in language change

It is generally believed that, when a linguistic item acquires a new mea...

Random walk patterns to identify weighted motifs

Over the last two decades, network theory has shown to be a fruitful par...

A Divergence Proof for Latuszynski's Counter-Example Approaching Infinity with Probability "Near" One

This note is a technical supplement to the following paper: latuszynski2...

Please sign up or login with your details

Forgot password? Click here to reset