Title
On the Escape Probability Estimation in Large Graphs
Abstract
We consider the large graphs as the object of study and deal with the problem of escape probability estimation. Generally, the required characteristic cannot be calculated analytically and even numerically due to the complexity and large size of the investigation object. The purpose of this paper is to offer the effective method for estimating the probability that the random walk on graph first enters a node b before returning into starting node a. Regenerative properties of the random walk allow using an accelerated method for the cycles simulation based on the splitting technique. The results of numerical experiments confirm the advantages of the proposed method.
Year
DOI
Venue
2019
10.23919/FRUCT.2019.8711919
2019 24th Conference of Open Innovations Association (FRUCT)
Keywords
DocType
ISSN
splitting technique,accelerated method,large graphs,random walk,investigation object,escape probability estimation
Conference
2305-7254
ISBN
Citations 
PageRank 
978-1-7281-1429-3
0
0.34
References 
Authors
8
2
Name
Order
Citations
PageRank
Konstantin Avrachenkov11250126.17
Alexandra Borodina200.34