Description

This book examines the intelligent random walk algorithms based on learning automata: these versions of random walk algorithms gradually obtain required information from the nature of the application to improve their efficiency. The book also describes the corresponding applications of this type of random walk algorithm, particularly as an efficient prediction model for large-scale networks such as peer-to-peer and social networks. The book opens new horizons for designing prediction models and problem-solving methods based on intelligent random walk algorithms, which are used for modeling and simulation in various types of networks, including computer, social and biological networks, and which may be employed a wide range of real-world applications.