Modeling social networks using a random walk on a torus

Abstract: This work explores a dynamic graphical model that can be used to model social networks. The model generates graphs using an array of random walks on a torus and a mapping from (T2)" to the space of graphs with n vertices. Using methods from stochastic dynamics, we show that global properties of the system such as the vertex degree distribution converge toward limiting distributions.