Identifying Complex Networks by Random Walks
classification
⚛️ physics.comp-ph
cond-mat.dis-nn
keywords
randomcomplexfreenetworksscalewalksagentsautonomous
read the original abstract
The possibility to identify the nature (e.g. random or scale free) of complex networks while performing respective random walks is investigated with respect to autonomous agents based on Bayesian decision theory and humans navigating through a graphic-interactive interface. The results indicate that the type of the network (choice between random and scale free models) can be correctly estimated in most cases.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.