2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/99331We present a simple mechanism for generating undirected scale-free networks using random walkers, where the network growth is determined by choosing parent vertices by sequential random walks. We show that this mechanism produces scale-free networks with degree exponent gamma=3 and clustering coefficients depending on random walk length. The mechanism can be interpreted in terms of preferential attachment without explicit knowledge of node degrees.10 pages, 3 figuresStatistical MechanicsDisordered Systems and Neural Networkstext