Using deterministic self-avoiding walks as a small-world metric on Watts-Strogatz networks

DOI10.1016/J.PHYSA.2023.128713arXiv2301.08956MaRDI QIDQ6156436FDOQ6156436

Authors: João V. B. S. Merenda, Odemir Martinez Bruno 

Publication date: 13 June 2023

Published in: Physica A (Search for Journal in Brave)

Abstract: The Watts-Strogatz model (WS) has been demonstrated to effectively describe real-world networks due to its ability to reproduce the small-world properties commonly observed in a variety of systems, including social networks, computer networks, biochemical reactions, and neural networks. As the presence of small-world properties is a prevalent characteristic in many real-world networks, the measurement of "small-worldness" has become a crucial metric in the field of network science, leading to the development of various methods for its assessment over the past two decades. In contrast, the deterministic tourist walk (DTW) method has emerged as a prominent technique for texture analysis and network classification. In this paper, we propose the use of a modified version of the DTW method to classify networks into three categories: regular networks, random networks, and small-world networks. Additionally, we construct a small-world metric, denoted by the coefficient $chi$, from the DTW method. Results indicate that the proposed method demonstrates excellent performance in the task of network classification, achieving over $90\mathrm{\%}$ accuracy. Furthermore, the results obtained using the coefficient $chi$ on real-world networks provide evidence that the proposed method effectively serves as a satisfactory small-world metric.

Full work available at URL: https://arxiv.org/abs/2301.08956

zbMATH Keywords

pattern recognitioncomplex networkssmall-world networksWatts-Strogatz modelpartially self-avoiding walk

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites Work

• Pattern recognition and machine learning.
• Collective dynamics of `small-world' networks
• Hierarchical characterization of complex networks
• Texture analysis and classification using deterministic tourist walk
• Complex network classification using partially self-avoiding deterministic walks

This page was built for publication: Using deterministic self-avoiding walks as a small-world metric on Watts-Strogatz networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6156436)