Statistical analysis of random walks on network

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...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autor principal:	A. Kalikova
Formato:	article
Lenguaje:	EN
Publicado:	Astana IT University 2021
Materias:	random work, hitting time, commute time, cover time Information technology T58.5-58.64
Acceso en línea:	https://doaj.org/article/e714425fe51b40f3b8ab077e6228071e
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:e714425fe51b40f3b8ab077e6228071e
record_format	dspace
spelling	oai:doaj.org-article:e714425fe51b40f3b8ab077e6228071e2021-12-02T13:00:20ZStatistical analysis of random walks on network2707-90312707-904Xhttps://doaj.org/article/e714425fe51b40f3b8ab077e6228071e2021-03-01T00:00:00Zhttp://ojs.astanait.edu.kz/index.php/sjaitu/article/view/49https://doaj.org/toc/2707-9031https://doaj.org/toc/2707-904XThis 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.A. KalikovaAstana IT Universityarticlerandom work, hitting time, commute time, cover timeInformation technologyT58.5-58.64ENScientific Journal of Astana IT University, Vol 0, Iss 5, Pp 77-83 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	random work, hitting time, commute time, cover time Information technology T58.5-58.64
spellingShingle	random work, hitting time, commute time, cover time Information technology T58.5-58.64 A. Kalikova Statistical analysis of random walks on network
description	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.
format	article
author	A. Kalikova
author_facet	A. Kalikova
author_sort	A. Kalikova
title	Statistical analysis of random walks on network
title_short	Statistical analysis of random walks on network
title_full	Statistical analysis of random walks on network
title_fullStr	Statistical analysis of random walks on network
title_full_unstemmed	Statistical analysis of random walks on network
title_sort	statistical analysis of random walks on network
publisher	Astana IT University
publishDate	2021
url	https://doaj.org/article/e714425fe51b40f3b8ab077e6228071e
work_keys_str_mv	AT akalikova statisticalanalysisofrandomwalksonnetwork
_version_	1718393538020900864

Statistical analysis of random walks on network

Ejemplares similares