Nonetheless, we point out that many of the known results on random walks automatically generalize to the AgentNets setting. For example, Dasgupta et al. and Chierichetti et al. [1]}, [2]} defined a random walk access model where an algorithm begins from a seed vertex \(v\)  and has very limited access to the graph: it can (i) move to a uniform random neighbor, (ii) query the degree of the current node, and (iii) query whether two already discovered nodes are adjacent. Several algorithms have been developed and studied in this model, e.g. for counting triangles in the graph efficiently [3]}. Since an AgentNet can execute all of these fundamental steps, it is also able to simulate any of the algorithms that were developed for this model.
