Statistical analysis of random walks on network

Journal Title: Scientific Journal of Astana IT University - Year 2021, Vol 5, Issue 5

Abstract

This paper describes an investigation of analytical formulas for parameters in random walks. Random walks are used to model situations in which an object moves in a sequence of steps in randomly chosen directions. Given a graph and a starting point, we select a neighbor of it at random, and move to this neighbor; then we select a neighbor of this point at random, and move to it etc. It is a fundamental dynamic process that arises in many models in mathematics, physics, informatics and can be used to model random processes inherent to many important applications. Different aspects of the theory of random walks on graphs are surveyed. In particular, estimates on the important parameters of hitting time, commute time, cover time are discussed in various works. In some papers, authors have derived an analytical expression for the distribution of the cover time for a random walk over an arbitrary graph that was tested for small values of n. However, this work will show the simplified analytical expressions for distribution of hitting time, commute time, cover time for bigger values of n. Moreover, this work will present the probability mass function and the cumulative distribution function for hitting time, commute time.

Authors and Affiliations

A. Kalikova

Keywords

Related Articles

MODELLING OF EROSION OF THE AGILE LEADERSHIP PROJECT MANAGER COMPETENCES

The structure and functions of mechanisms of development and erosion of competencies in innovative projects of implementation of information and communication technologies are considered. The factors of development and...

ON THE DEVELOPMENT OF MANAGEMENT MODELS FOR REGIONAL PROGRAMS OF ENVIRONMENTALLY SAFE OPERATION AT CRITICAL TRANSPORT INFRASTRUCTURE FACILITIES

The objects of the critical transport infrastructure are located in all regions of Ukraine, and the question of the safety of these objects is extremely relevant. A functional approach should be used to form an effective...

STUDY OF THE CRYPTOGRAPHIC STRENGTH OF THE S-BOX OBTAINED ON THE BASIS OF EXPONENTIATION MODULO

This article presents one of the main transformations of symmetric block ciphers used to protect confidential information, a new method for obtaining a non-linear S block, and an analysis of the results obtained. The S-b...

DEVELOPMENT OF A DATABASE OF DIGITAL MULTICULTURAL CONTENT AND APPLICATION IN JOURNALISM LESSONS

The development of digital technologies stimulates changes in the field of education, including for students of the educational programs «Digital Journalism» and «Media Technologies». This paper presents the practice o...

MODEL OF POPULATION MIGRATION IN AGGLOMERATIONS WITHIN THE FRAMEWORK OF THE “SMART CITY” PARADIGM

The urban agglomeration is a multitude of united settlements according to economic, labor, cultural, household, and recreational characteristics. Agglomeration is perceived as an integral territorial union; therefore,...

Download PDF file
  • EP ID EP712213
  • DOI 10.37943/AITU.2021.99.34.007
  • Views 47
  • Downloads 0

How To Cite

A. Kalikova (2021). Statistical analysis of random walks on network. Scientific Journal of Astana IT University, 5(5), -. https://europub.co.uk/articles/-A-712213