Efficient Immunization Strategies for Computer Networks and Populations

We present an effective immunization strategy for computer networks and populations with broad and, in particular, scale-free degree distributions. The proposed strategy, acquaintance immunization, calls for the immunization of random acquaintances of random nodes (individuals). The strategy requires no knowledge of the node degrees or any other global knowledge, as do targeted immunization strategies. We study analytically the critical threshold for complete immunization. We also study the strategy with respect to the susceptible-infected-removed epidemiological model. We show that the immunization threshold is dramatically reduced with the suggested strategy, for all studied cases.Comment: Revtex, 5 pages, 4 ps fig

Filling a silo with a mixture of grains: Friction-induced segregation

We study the filling process of a two-dimensional silo with inelastic particles by simulation of a granular media lattice gas (GMLG) model. We calculate the surface shape and flow profiles for a monodisperse system and we introduce a novel generalization of the GMLG model for a binary mixture of particles of different friction properties where, for the first time, we measure the segregation process on the surface. The results are in good agreement with a recent theory, and we explain the observed small deviations by the nonuniform velocity profile.Comment: 10 pages, 5 figures, to be appear in Europhys. Let

The spectral dimension of random trees

We present a simple yet rigorous approach to the determination of the spectral dimension of random trees, based on the study of the massless limit of the Gaussian model on such trees. As a byproduct, we obtain evidence in favor of a new scaling hypothesis for the Gaussian model on generic bounded graphs and in favor of a previously conjectured exact relation between spectral and connectivity dimensions on more general tree-like structures.Comment: 14 pages, 2 eps figures, revtex4. Revised version: changes in section I

Probability Distribution of the Shortest Path on the Percolation Cluster, its Backbone and Skeleton

We consider the mean distribution functions Phi(r|l), Phi(B)(r|l), and Phi(S)(r|l), giving the probability that two sites on the incipient percolation cluster, on its backbone and on its skeleton, respectively, connected by a shortest path of length l are separated by an Euclidean distance r. Following a scaling argument due to de Gennes for self-avoiding walks, we derive analytical expressions for the exponents g1=df+dmin-d and g1B=g1S-3dmin-d, which determine the scaling behavior of the distribution functions in the limit x=r/l^(nu) much less than 1, i.e., Phi(r|l) proportional to l^(-(nu)d)x^(g1), Phi(B)(r|l) proportional to l^(-(nu)d)x^(g1B), and Phi(S)(r|l) proportional to l^(-(nu)d)x^(g1S), with nu=1/dmin, where df and dmin are the fractal dimensions of the percolation cluster and the shortest path, respectively. The theoretical predictions for g1, g1B, and g1S are in very good agreement with our numerical results.Comment: 10 pages, 3 figure

Study of fuel cells using storable rocket propellants Final report, 28 Jan. 1964 - 29 Jan. 1965

Fuel cells using storable rocket propellants for reactant

First Passage Time in a Two-Layer System

As a first step in the first passage problem for passive tracer in stratified porous media, we consider the case of a two-dimensional system consisting of two layers with different convection velocities. Using a lattice generating function formalism and a variety of analytic and numerical techniques, we calculate the asymptotic behavior of the first passage time probability distribution. We show analytically that the asymptotic distribution is a simple exponential in time for any choice of the velocities. The decay constant is given in terms of the largest eigenvalue of an operator related to a half-space Green's function. For the anti-symmetric case of opposite velocities in the layers, we show that the decay constant for system length $L$ crosses over from $L^{-2}$ behavior in diffusive limit to $L^{-1}$ behavior in the convective regime, where the crossover length $L^*$ is given in terms of the velocities. We also have formulated a general self-consistency relation, from which we have developed a recursive approach which is useful for studying the short time behavior.Comment: LaTeX, 28 pages, 7 figures not include

Dynamics of Sleep-Wake Transitions During Sleep

We study the dynamics of the awakening during the night for healthy subjects and find that the wake and the sleep periods exhibit completely different behavior: the durations of wake periods are characterized by a scale-free power-law distribution, while the durations of sleep periods have an exponential distribution with a characteristic time scale. We find that the characteristic time scale of sleep periods changes throughout the night. In contrast, there is no measurable variation in the power-law behavior for the durations of wake periods. We develop a stochastic model which agrees with the data and suggests that the difference in the dynamics of sleep and wake states arises from the constraints on the number of microstates in the sleep-wake system.Comment: Final form with some small corrections. To be published in Europhysics Letters, vol. 57, issue no. 5, 1 March 2002, pp. 625-63

Nanopercolation

We investigate through direct molecular mechanics calculations the geometrical properties of hydrocarbon mantles subjected to percolation disorder. We show that the structures of mantles generated at the critical percolation point have a fractal dimension $d_{f} \approx 2.5$. In addition, the solvent access surface $A_{s}$ and volume $V_{s}$ of these molecules follow power-law behavior, $A_{s} \sim L^{\alpha_A}$ and $V_{s} \sim L^{\alpha_V}$, where $L$ is the system size, and with both critical exponents $\alpha_A$ and $\alpha_V$ being significantly dependent on the radius of the accessing probing molecule, $r_{p}$. Our results from extensive simulations with two distinct microscopic topologies (i.e., square and honeycomb) indicate the consistency of the statistical analysis and confirm the self-similar characteristic of the percolating hydrocarbons. Due to their highly branched topology, some of the potential applications for this new class of disordered molecules include drug delivery, catalysis, and supramolecular structures.Comment: 4 pages, 5 figure

Diffusion with random distribution of static traps

The random walk problem is studied in two and three dimensions in the presence of a random distribution of static traps. An efficient Monte Carlo method, based on a mapping onto a polymer model, is used to measure the survival probability P(c,t) as a function of the trap concentration c and the time t. Theoretical arguments are presented, based on earlier work of Donsker and Varadhan and of Rosenstock, why in two dimensions one expects a data collapse if -ln[P(c,t)]/ln(t) is plotted as a function of (lambda t)^{1/2}/ln(t) (with lambda=-ln(1-c)), whereas in three dimensions one expects a data collapse if -t^{-1/3}ln[P(c,t)] is plotted as a function of t^{2/3}lambda. These arguments are supported by the Monte Carlo results. Both data collapses show a clear crossover from the early-time Rosenstock behavior to Donsker-Varadhan behavior at long times.Comment: 4 pages, 6 figure

Effect of Disorder Strength on Optimal Paths in Complex Networks

We study the transition between the strong and weak disorder regimes in the scaling properties of the average optimal path $\ell_{\rm opt}$ in a disordered Erd\H{o}s-R\'enyi (ER) random network and scale-free (SF) network. Each link $i$ is associated with a weight $\tau_i\equiv\exp(a r_i)$, where $r_i$ is a random number taken from a uniform distribution between 0 and 1 and the parameter $a$ controls the strength of the disorder. We find that for any finite $a$, there is a crossover network size $N^*(a)$ at which the transition occurs. For $N \ll N^*(a)$ the scaling behavior of $\ell_{\rm opt}$ is in the strong disorder regime, with $\ell_{\rm opt} \sim N^{1/3}$ for ER networks and for SF networks with $\lambda \ge 4$, and $\ell_{\rm opt} \sim N^{(\lambda-3)/(\lambda-1)}$ for SF networks with $3 < \lambda < 4$. For $N \gg N^*(a)$ the scaling behavior is in the weak disorder regime, with $\ell_{\rm opt}\sim\ln N$ for ER networks and SF networks with $\lambda > 3$. In order to study the transition we propose a measure which indicates how close or far the disordered network is from the limit of strong disorder. We propose a scaling ansatz for this measure and demonstrate its validity. We proceed to derive the scaling relation between $N^*(a)$ and $a$. We find that $N^*(a)\sim a^3$ for ER networks and for SF networks with $\lambda\ge 4$, and $N^*(a)\sim a^{(\lambda-1)/(\lambda-3)}$ for SF networks with $3 < \lambda < 4$.Comment: 6 pages, 6 figures. submitted to Phys. Rev.