Preliminary Measurements of Be-10/Be-7 Ratio in Rainwater for Atmospheric Transport Analysis

The meteoric cosmogenic beryllium has been used as an essential geophysical tracer in the analysis of atmospheric flows and erosion soils since 1960. The first measurements Be-7 and Be-10 concentrations in rainwater from Mexico, have been carried out by using gamma decay spectroscopy and AMS techniques, respectively for each isotope. With this it was possible to report a preliminar value for the Be-10/Be-7 isotopic ratio in such environmental samples. The present work described preliminary results related to rainwater collected at mountain and metropolitan areas. Results are compared with predictions and previous measurements for both radioisotopes, observing a very sensible behavior particularly for the case of Be-7 activities

The Fractal Properties of Internet

In this paper we show that the Internet web, from a user's perspective, manifests robust scaling properties of the type $P(n)\propto n^{-\tau}$ where n is the size of the basin connected to a given point, $P$ represents the density of probability of finding n points downhill and $\tau=1.9 \pm 0.1$ s a characteristic universal exponent. This scale-free structure is a result of the spontaneous growth of the web, but is not necessarily the optimal one for efficient transport. We introduce an appropriate figure of merit and suggest that a planning of few big links, acting as information highways, may noticeably increase the efficiency of the net without affecting its robustness.Comment: 6 pages,2 figures, epl style, to be published on Europhysics Letter

Scale-free random branching tree in supercritical phase

We study the size and the lifetime distributions of scale-free random branching tree in which $k$ branches are generated from a node at each time step with probability $q_k\sim k^{-\gamma}$. In particular, we focus on finite-size trees in a supercritical phase, where the mean branching number $C=\sum_k k q_k$ is larger than 1. The tree-size distribution $p(s)$ exhibits a crossover behavior when $2 < \gamma < 3$; A characteristic tree size $s_c$ exists such that for $s \ll s_c$, $p(s)\sim s^{-\gamma/(\gamma-1)}$ and for $s \gg s_c$, $p(s)\sim s^{-3/2}\exp(-s/s_c)$, where $s_c$ scales as $\sim (C-1)^{-(\gamma-1)/(\gamma-2)}$. For $\gamma > 3$, it follows the conventional mean-field solution, $p(s)\sim s^{-3/2}\exp(-s/s_c)$ with $s_c\sim (C-1)^{-2}$. The lifetime distribution is also derived. It behaves as $\ell(t)\sim t^{-(\gamma-1)/(\gamma-2)}$ for $2 < \gamma < 3$, and $\sim t^{-2}$ for $\gamma > 3$ when branching step $t \ll t_c \sim (C-1)^{-1}$, and $\ell(t)\sim \exp(-t/t_c)$ for all $\gamma > 2$ when $t \gg t_c$. The analytic solutions are corroborated by numerical results.Comment: 6 pages, 6 figure

Model for the hydration of non-polar compounds and polymers

We introduce an exactly solvable statistical-mechanical model of the hydration of non-polar compounds, based on grouping water molecules in clusters where hydrogen bonds and isotropic interactions occur; interactions between clusters are neglected. Analytical results show that an effective strengthening of hydrogen bonds in the presence of the solute, together with a geometric reorganization of water molecules, are enough to yield hydrophobic behavior. We extend our model to describe a non-polar homopolymer in aqueous solution, obtaining a clear evidence of both ``cold'' and ``warm'' swelling transitions. This suggests that our model could be relevant to describe some features of protein folding.Comment: REVTeX, 6 pages, 3 figure

Shortest paths and load scaling in scale-free trees

The average node-to-node distance of scale-free graphs depends logarithmically on N, the number of nodes, while the probability distribution function (pdf) of the distances may take various forms. Here we analyze these by considering mean-field arguments and by mapping the m=1 case of the Barabasi-Albert model into a tree with a depth-dependent branching ratio. This shows the origins of the average distance scaling and allows a demonstration of why the distribution approaches a Gaussian in the limit of N large. The load (betweenness), the number of shortest distance paths passing through any node, is discussed in the tree presentation.Comment: 8 pages, 8 figures; v2: load calculations extende

Extremal dynamics model on evolving networks

We investigate an extremal dynamics model of evolution with a variable number of units. Due to addition and removal of the units, the topology of the network evolves and the network splits into several clusters. The activity is mostly concentrated in the largest cluster. The time dependence of the number of units exhibits intermittent structure. The self-organized criticality is manifested by a power-law distribution of forward avalanches, but two regimes with distinct exponents tau = 1.98 +- 0.04 and tau^prime = 1.65 +- 0.05 are found. The distribution of extinction sizes obeys a power law with exponent 2.32 +- 0.05.Comment: 4 pages, 5 figure

Scale-Free networks from varying vertex intrinsic fitness

A new mechanism leading to scale-free networks is proposed in this Letter. It is shown that, in many cases of interest, the connectivity power-law behavior is neither related to dynamical properties nor to preferential attachment. Assigning a quenched fitness value xi to every vertex, and drawing links among vertices with a probability depending on the fitnesses of the two involved sites, gives rise to what we call a good-get-richer mechanism, in which sites with larger fitness are more likely to become hubs (i.e., to be highly connected)

Statistical properties of contact vectors

We study the statistical properties of contact vectors, a construct to characterize a protein's structure. The contact vector of an N-residue protein is a list of N integers n_i, representing the number of residues in contact with residue i. We study analytically (at mean-field level) and numerically the amount of structural information contained in a contact vector. Analytical calculations reveal that a large variance in the contact numbers reduces the degeneracy of the mapping between contact vectors and structures. Exact enumeration for lengths up to N=16 on the three dimensional cubic lattice indicates that the growth rate of number of contact vectors as a function of N is only 3% less than that for contact maps. In particular, for compact structures we present numerical evidence that, practically, each contact vector corresponds to only a handful of structures. We discuss how this information can be used for better structure prediction.Comment: 20 pages, 6 figure

Structural efficiency of percolation landscapes in flow networks

Complex networks characterized by global transport processes rely on the presence of directed paths from input to output nodes and edges, which organize in characteristic linked components. The analysis of such network-spanning structures in the framework of percolation theory, and in particular the key role of edge interfaces bridging the communication between core and periphery, allow us to shed light on the structural properties of real and theoretical flow networks, and to define criteria and quantities to characterize their efficiency at the interplay between structure and functionality. In particular, it is possible to assess that an optimal flow network should look like a "hairy ball", so to minimize bottleneck effects and the sensitivity to failures. Moreover, the thorough analysis of two real networks, the Internet customer-provider set of relationships at the autonomous system level and the nervous system of the worm Caenorhabditis elegans --that have been shaped by very different dynamics and in very different time-scales--, reveals that whereas biological evolution has selected a structure close to the optimal layout, market competition does not necessarily tend toward the most customer efficient architecture.Comment: 8 pages, 5 figure