Network models: growth, dynamics, and failure

This paper reports on preliminary explorations, both empirical and analytical, of probabilistic models of large-scale networks. We rst examine the structure of networks that grow by the addition of nodes and lines, using a class of connection rules motivated by considerations of distance and prior connectivity. Second, we examine the dynamic behavior of the binary in uence model | a particular form of a more general model of networks in which each node has a status (for instance: normal, or failed) that behaves as a Markov chain, but with transitions that are in uenced bythepresent status of each neighboring node. Some interesting in uence model examples are analyzed, including one displaying a power-law relation between the frequency of a failure event and its extensiveness.