Login / Signup

Deterministic random walk model in NetLogo and the identification of asymmetric saturation time in random graph.

Ayan ChatterjeeQingtao CaoAmirhossein SajadiBabak Ravandi
Published in: Appl. Netw. Sci. (2023)
Keyphrases
  • random walk
  • probabilistic model
  • transition probabilities
  • markov chain
  • learning algorithm
  • special case
  • markov random walk
  • social networks
  • similarity measure
  • computational complexity
  • link prediction