Identifying Complex Networks by Random Walks
Filipi Nascimento Silva, Luciano da Fontoura Costa
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.
Create a lesson
Related papers
Automatic generation of exchange-correlation response kernels
Susi Lehtola
A unified gas-kinetic wave-particle method for multiscale gas-mixture flow with an elementary chemical reaction
Cao Junzhe, Wei Yufeng, Long Wenpei et al.
Energy Yield and Lifetime Climate Classification via Machine Learning for Optimizing Photovoltaic Module Design and Materials
Youri Blom, Sofia Dutto, Alexandru Costache et al.
Rapidly Convergent Finite-Element Domain Decomposition Method With Two-Channel Transmission Conditions
Furkan Şık, Fernando L. Teixeira, Balasubramaniam Shanker
A sharp-diffuse interface model for intermittent and isolated topological transitions
Raaghav Ramani
Macroparticles with different weights relax to different temperatures in Particle-In-Cell simulations
Remi Lehe, Arianna Formenti, Justin R. Angus et al.