We consider an interacting particle system on a graph which, from a macroscopic point of view, looks like ℤd and, at a microscopic level, is a complete graph of degree N (called a patch). There are two birth rates: an inter-patch birth rate λ and an intra-patch birth rate ϕ. Once a site is occupied, there is no breeding from outside the patch and the probability c(i) of success of an intra-patch breeding decreases with the size i of the population in the site. We prove the existence of a critical value λc(ϕ, c, N) and a critical value ϕc(λ, c, N). We consider a sequence of processes generated by the families of control functions {cn}n∈ℕ and degrees {Nn}n∈ℕ; we prove, under mild assumptions, the existence of a critical value nc(λ, ϕ, c). Roughly speaking, we show that, in the limit, these processes behave as the branching random walk on ℤd with inter-neighbor birth rate λ and on-site birth rate ϕ. Some examples of models that can be seen as particular cases are given.

PageRank with personalization is used in Web search as an importance measure for Web documents. The goal of this paper is to characterize the tail behavior of the PageRank distribution in the Web and other complex networks characterized by power laws. To this end, we model the PageRank as a solution of a stochastic equation where the Ris are distributed as R. This equation is inspired by the original definition of the PageRank. In particular, N models the number of incoming links to a page, and B stays for the user preference. Assuming that N or B are heavy tailed, we employ the theory of regular variation to obtain the asymptotic behavior of R under quite general assumptions on the involved random variables. Our theoretical predictions show good agreement with experimental data.