Exhaustive percolation on random networks

dc.creatorSamuelsson, Björn
dc.creatorSocolar, Joshua E. S.
dc.date2006-05-25
dc.date2006-09-27
dc.date.accessioned2026-07-07T07:14:49Z
dc.date.available2026-07-07T07:14:49Z
dc.descriptionWe consider propagation models that describe the spreading of an attribute, called "damage", through the nodes of a random network. In some systems, the average fraction of nodes that remain undamaged vanishes in the large system limit, a phenomenon we refer to as exhaustive percolation. We derive scaling law exponents and exact results for the distribution of the number of undamaged nodes, valid for a broad class of random networks at the exhaustive percolation transition and in the exhaustive percolation regime. This class includes processes that determine the set of frozen nodes in random Boolean networks with indegree distributions that decay sufficiently rapidly with the number of inputs. Connections between our calculational methods and previous studies of percolation beginning from a single initial node are also pointed out. Central to our approach is the observation that key aspects of damage spreading on a random network are fully characterized by a single function specifying the probability that a given node will be damaged as a function of the fraction of damaged nodes. In addition to our analytical investigations of random networks, we present a numerical example of exhaustive percolation on a directed lattice.
dc.description19 pages, 7 figures; corrected errors in eq. (73) and some typos
dc.identifierhttps://arxiv.org/abs/nlin/0605047
dc.identifierhttp://arxiv.org/abs/nlin/0605047
dc.identifierB. Samuelsson and J. E. S. Socolar, Phys. Rev. E 74, 036113 (2006)
dc.identifierdoi:10.1103/PhysRevE.74.036113
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/113039
dc.subjectCellular Automata and Lattice Gases
dc.subjectDisordered Systems and Neural Networks
dc.titleExhaustive percolation on random networks
dc.typetext

Files

Collections