Random Walk Models of Network Formation and Sequential Monte Carlo Methods for Graphs release_o45us2q4lrbn5cgdtslaz2xnha

by Benjamin Bloem-Reddy, Peter Orbanz

Released as a article .

2018  

Abstract

We introduce a class of generative network models that insert edges by connecting the starting and terminal vertices of a random walk on the network graph. Within the taxonomy of statistical network models, this class is distinguished by permitting the location of a new edge to explicitly depend on the structure of the graph, but being nonetheless statistically and computationally tractable. In the limit of infinite walk length, the model converges to an extension of the preferential attachment model---in this sense, it can be motivated alternatively by asking what preferential attachment is an approximation to. Theoretical properties, including the limiting degree sequence, are studied analytically. If the entire history of the graph is observed, parameters can be estimated by maximum likelihood. If only the final graph is available, its history can be imputed using MCMC. We develop a class of sequential Monte Carlo algorithms that are more generally applicable to sequential network models, and may be of interest in their own right. The model parameters can be recovered from a single graph generated by the model. Applications to data clarify the role of the random walk length as a length scale of interactions within the graph.
In text/plain format

Archived Files and Locations

application/pdf  3.1 MB
file_wsbculbi25abjhah2bzluymjy4
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   accepted
Date   2018-07-07
Version   v2
Language   en ?
arXiv  1612.06404v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: b2ec91fe-f660-446a-9c43-1ab458e09018
API URL: JSON