Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/28324
Title: | Comparative Study of Random Walks with One-Step Memory on Complex Networks | Authors: | Mirchev, Miroslav Basnarkov, Lasko Mishkovski, Igor |
Keywords: | Random walk Complex network Graph Graph search |
Issue Date: | 30-Mar-2023 | Publisher: | Springer, Cham | Series/Report no.: | Springer Proceedings in Complexity; | Conference: | CompleNet 2023 | Abstract: | We investigate searching efficiency of different kinds of random walk on complex networks which rely on local information and one-step memory. For the studied navigation strategies we obtained theoretical and numerical values for the graph mean first passage times as an indicator for the searching efficiency. The experiments with generated and real networks show that biasing based on inverse degree, persistence and local two-hop paths can lead to smaller searching times. Moreover, these biasing approaches can be combined to achieve a more robust random search strategy. Our findings can be applied in the modeling and solution of various real-world problems. | URI: | http://hdl.handle.net/20.500.12188/28324 | DOI: | 10.1007/978-3-031-28276-8_2 |
Appears in Collections: | Faculty of Computer Science and Engineering: Conference papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Random_walk_with_memory_Complenet2023 (4).pdf | 749.63 kB | Adobe PDF | View/Open |
Page view(s)
48
checked on Oct 12, 2024
Download(s)
8
checked on Oct 12, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.