Exact mean first-passage time on the T-graph

We consider a simple random walk on the T-fractal and we calculate the exact mean time $\tau^g$ to first reach the central node $i_0$. The mean is performed over the set of possible walks from a given origin and over the set of starting points uniformly distributed throughout the sites of the graph, except $i_0$. By means of analytic techniques based on decimation procedures, we find the explicit expression for $\tau^g$ as a function of the generation $g$ and of the volume $V$ of the underlying fractal. Our results agree with the asymptotic ones already known for diffusion on the T-fractal and, more generally, they are consistent with the standard laws describing diffusion on low-dimensional structures.Comment: 6 page

Diffusion-Limited One-Species Reactions in the Bethe Lattice

We study the kinetics of diffusion-limited coalescence, A+A-->A, and annihilation, A+A-->0, in the Bethe lattice of coordination number z. Correlations build up over time so that the probability to find a particle next to another varies from \rho^2 (\rho is the particle density), initially, when the particles are uncorrelated, to [(z-2)/z]\rho^2, in the long-time asymptotic limit. As a result, the particle density decays inversely proportional to time, \rho ~ 1/kt, but at a rate k that slowly decreases to an asymptotic constant value.Comment: To be published in JPCM, special issue on Kinetics of Chemical Reaction

Wigner Surmise For Domain Systems

In random matrix theory, the spacing distribution functions $p^{(n)}(s)$ are well fitted by the Wigner surmise and its generalizations. In this approximation the spacing functions are completely described by the behavior of the exact functions in the limits s->0 and s->infinity. Most non equilibrium systems do not have analytical solutions for the spacing distribution and correlation functions. Because of that, we explore the possibility to use the Wigner surmise approximation in these systems. We found that this approximation provides a first approach to the statistical behavior of complex systems, in particular we use it to find an analytical approximation to the nearest neighbor distribution of the annihilation random walk

A Method of Intervals for the Study of Diffusion-Limited Annihilation, A + A --> 0

We introduce a method of intervals for the analysis of diffusion-limited annihilation, A+A -> 0, on the line. The method leads to manageable diffusion equations whose interpretation is intuitively clear. As an example, we treat the following cases: (a) annihilation in the infinite line and in infinite (discrete) chains; (b) annihilation with input of single particles, adjacent particle pairs, and particle pairs separated by a given distance; (c) annihilation, A+A -> 0, along with the birth reaction A -> 3A, on finite rings, with and without diffusion.Comment: RevTeX, 13 pages, 4 figures, 1 table. References Added, and some other minor changes, to conform with final for

Percolation in Hierarchical Scale-Free Nets

We study the percolation phase transition in hierarchical scale-free nets. Depending on the method of construction, the nets can be fractal or small-world (the diameter grows either algebraically or logarithmically with the net size), assortative or disassortative (a measure of the tendency of like-degree nodes to be connected to one another), or possess various degrees of clustering. The percolation phase transition can be analyzed exactly in all these cases, due to the self-similar structure of the hierarchical nets. We find different types of criticality, illustrating the crucial effect of other structural properties besides the scale-free degree distribution of the nets.Comment: 9 Pages, 11 figures. References added and minor corrections to manuscript. In pres