The presence of hidden incoming edges but observable outgoing edges poses a challenge to characterize large directed graphs through crawling, as existing sampling methods cannot cope with hidden ...

We study the mixing rate of non-backtracking random walks on graphs by looking at non-backtracking walks as walks on the directed edges of a graph. A result known as Ihara’s Theorem relates the ...

Ray, G. , & Yu, T. . (Accepted). Quantitative Russo-Seymour-Welsh for random walk on random graphs and decorrelation of UST. Journal of Theoretical Probability ...

The paper uses relationships between random walks, combinatorial potential theory, trees, and electric circuits to generate multi-label segmentations in images. The proposed segmentation algorithm is ...

The Tangle is the moniker used to describe IOTA’s directed acyclic graph (DAG ... is achieved by leveraging an optimized form of random walks, primarily the weighted random walk. Importantly, ...

The presence of hidden incoming edges but observable outgoing edges poses a challenge to characterize large directed graphs through crawling, as existing sampling methods cannot cope with hidden ...