The distribution of path lengths of self avoiding walks on Erdős–Rényi networks

DOI10.1088/1751-8113/49/28/285002zbMath1345.90024arXiv1603.06613OpenAlexW2309357898WikidataQ56171868 ScholiaQ56171868MaRDI QIDQ3188392

O. Biham, Ido Tishby, Eytan Katzav

Publication date: 19 August 2016

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.06613

zbMATH Keywords

random walkdegree distributionself-avoiding walkrandom networksErdős-Rényi networkattrition lengthlast-hitting time

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Stochastic network models in operations research (90B15) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Related Items (9)

Analytical results for the distribution of cover times of random walks on random regular graphs ⋮ The interpolation between random walk and self-avoiding walk by avoiding marked sites ⋮ A new method for quantifying network cyclic structure to improve community detection ⋮ The distribution of first hitting times of randomwalks on Erdős–Rényi networks ⋮ The distribution of first hitting times of random walks on directed Erdős–Rényi networks ⋮ Maximal entropy random walk on heterogenous network for miRNA-disease association prediction ⋮ Knowledge acquisition: a complex networks approach ⋮ On a function modeling an l-step self avoiding walk ⋮ The distribution of first hitting times of non-backtracking random walks on Erdős–Rényi networks

Uses Software

• DLMF

This page was built for publication: The distribution of path lengths of self avoiding walks on Erdős–Rényi networks