On the Escape Probability Estimation in Large Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

On the Escape Probability Estimation in Large Graphs


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.
Fichier principal
Vignette du fichier
EscapeProb2019paper.pdf (279.95 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02413569 , version 1 (16-12-2019)



Konstantin Avrachenkov, Alexandra Borodina. On the Escape Probability Estimation in Large Graphs. IEEE FRUCT 2019 - 24th Conference of Open Innovations Association FRUCT, Apr 2019, Moscow, Russia. ⟨10.23919/FRUCT.2019.8711919⟩. ⟨hal-02413569⟩
24 View
191 Download



Gmail Mastodon Facebook X LinkedIn More