Transmission of packets on a hierarchical network: Statistics and explosive percolation
arXiv:1108.2854 · doi:10.1103/PhysRevE.86.026104
Abstract
We analyze an idealized model for the transmission or flow of particles, or discrete packets of information, in a weight bearing branching hierarchical 2-D networks, and its variants. The capacities add hierarchically down the clusters. Each node can accommodate a limited number of packets, depending on its capacity and the packets hop from node to node, following the links between the nodes. The statistical properties of this system are given by the Maxwell - Boltzmann distribution. We obtain analytical expressions for the mean occupation numbers as functions of capacity, for different network topologies. The analytical results are shown to be in agreement with the numerical simulations. The traffic flow in these models can be represented by the site percolation problem. It is seen that the percolation transitions in the 2-D model and in its variant lattices are continuous transitions, whereas the transition is found to be explosive (discontinuous) for the V- lattice, the critical case of the 2-D lattice. We discuss the implications of our analysis.
24 pages, 41 figures
References in corpus (11)
- "Explosive Percolation" Transition is Actually Continuous
- Congestion and centrality in traffic flow on complex networks
- Explosive percolation in scale-free networks
- Explosive percolation via control of the largest cluster
- Strongly discontinuous explosive percolation with multiple giant components
- Modeling river delta formation
- Congestion and decongestion in a communication network
- Distributive routing & congestion control in wireless multihop ad hoc communication networks
- The Gradient Mechanism in a Communication Network
- Asymmetric Simple Exclusion Process on a Cayley Tree
- Avalanche transmission and critical behavior in load bearing hierarchical networks
Cited by in corpus (4)
- Explosive Percolation: Unusual Transitions of a Simple Model
- Structure and stability of online chat networks built on emotion-carrying links
- Unraveling the structure of treelike networks from first-passage times of lazy random walkers
- Explosive Synchronization in Multilayer Dynamically Dissimilar Networks