Dynamical scaling behavior of percolation clusters in scale-free networks.

In this work we investigate the spectra of Laplacian matrices that determine many dynamic properties of scale-free networks below and at the percolation threshold. We use a replica formalism to develop analytically, based on an integral equation, a systematic way to determine the ensemble averaged eigenvalue spectrum for a general type of treelike networks. Close to the percolation threshold we find characteristic scaling functions for the density of states rho(lambda) of scale-free networks. rho(lambda) shows characteristic power laws rho (lambda) approximately lambda (alpha(1) ) or rho (lambda) approximately lambda (d(2) ) for small lambda, where alpha(1) holds below and alpha(2) at the percolation threshold. In the range where the spectra are accessible from a numerical diagonalization procedure the two methods lead to very similar results.

Dynamics of randomly branched polymers: configuration averages and solvable models.

Treating the relaxation dynamics of an ensemble of random hyperbranched macromolecules in dilute solution represents a challenge even in the framework of Rouse-type approaches, which focus on generalized Gaussian structures (GGSs). The problem is that one has to average over a large class of realizations of molecular structures, and that each molecule undergoes its own dynamics. We show that a replica formalism allows to develop analytically, based on an integral equation, a systematic way to determine the ensemble averaged eigenvalue spectrum. Interestingly, for a specific probability distribution of the spring strengths of the GGSs, the integral equation takes a particularly simple form. Given that several dynamical observables, such as the mechanical moduli G'(omega) and G"(omega), as well as the averaged monomer displacement are relatively simple functions of the eigenvalues, we can use the obtained spectra to compute the corresponding averaged dynamical forms. Comparing the results obtained from this approach and from extensive diagonalizations of hyperbranched GGSs we find a very good agreement.

Trapping of random walks on small-world networks.

We investigate the trapping of random walkers on small-world networks (SWN's), irregular graphs. We derive bounds for the survival probability Phi(SWN)(n) and display its analysis through cumulant expansions. Computer simulations are performed for large SWNs. We show that in the limit of infinite sizes, trapping on SWNs is equivalent to trapping on a certain class of random trees, which are grown during the random walk.

Target problem on small-world networks.

In this work we focus on reactions on small-world networks (SWN's), disordered graphs of much recent interest. We study the target problem, since it allows an exact solution on regular lattices. On SWN's we find that the decay of the targets (for which we extend the formalism to disordered lattices) is again related to S(n), the mean number of distinct sites visited in n steps, although the S(n) vs n dependence changes here drastically in going from regular linear chains to their SWN.