Connectivity strategies to enhance the capacity of weight-bearing networks

The connectivity properties of a weight-bearing network are exploited to enhance it's capacity. We study a 2-d network of sites where the weight-bearing capacity of a given site depends on the capacities of the sites connected to it in the layers above. The network consists of clusters viz. a set of sites connected with each other with the largest such collection of sites being denoted as the maximal cluster. New connections are made between sites in successive layers using two distinct strategies. The key element of our strategies consists of adding as many disjoint clusters as possible to the sites on the trunk $T$ of the maximal cluster. The new networks can bear much higher weights than the original networks and have much lower failure rates. The first strategy leads to a greater enhancement of stability whereas the second leads to a greater enhancement of capacity compared to the original networks. The original network used here is a typical example of the branching hierarchical class. However the application of strategies similar to ours can yield useful results in other types of networks as well.Comment: 17 pages, 3 EPS files, 5 PS files, Phys. Rev. E (to appear

Nonequilibrium phase transitions in models of adsorption and desorption

The nonequilibrium phase transition in a system of diffusing, coagulating particles in the presence of a steady input and evaporation of particles is studied. The system undergoes a transition from a phase in which the average number of particles is finite to one in which it grows linearly in time. The exponents characterizing the mass distribution near the critical point are calculated in all dimensions.Comment: 10 pages, 2 figures (To appear in Phys. Rev. E

Scale-free network on a vertical plane

A scale-free network is grown in the Euclidean space with a global directional bias. On a vertical plane, nodes are introduced at unit rate at randomly selected points and a node is allowed to be connected only to the subset of nodes which are below it using the attachment probability: $\pi_i(t) \sim k_i(t)\ell^{\alpha}$. Our numerical results indicate that the directed scale-free network for $\alpha=0$ belongs to a different universality class compared to the isotropic scale-free network. For $\alpha < \alpha_c$ the degree distribution is stretched exponential in general which takes a pure exponential form in the limit of $\alpha \to -\infty$. The link length distribution is calculated analytically for all values of $\alpha$.Comment: 4 pages, 4 figure

Kang-Redner Anomaly in Cluster-Cluster Aggregation

The large time, small mass, asymptotic behavior of the average mass distribution \pb is studied in a $d$-dimensional system of diffusing aggregating particles for $1\leq d \leq 2$. By means of both a renormalization group computation as well as a direct re-summation of leading terms in the small reaction-rate expansion of the average mass distribution, it is shown that \pb \sim \frac{1}{t^d} (\frac{m^{1/d}}{\sqrt{t}})^{e_{KR}} for $m \ll t^{d/2}$, where $e_{KR}=\epsilon +O(\epsilon ^2)$ and $\epsilon =2-d$. In two dimensions, it is shown that \pb \sim \frac{\ln(m) \ln(t)}{t^2} for $m \ll t/ \ln(t)$. Numerical simulations in two dimensions supporting the analytical results are also presented.Comment: 11 pages, 6 figures, Revtex