Related papers: Scale-free random branching tree in supercritical …
We study the branching random walk on weighted graphs; site-breeding and edge-breeding branching random walks on graphs are seen as particular cases. We describe the strong critical value in terms of a geometrical parameter of the graph. We…
We consider the random directed graph $\vec{G}(n,p)$ with vertex set $\{1,2,\ldots,n\}$ in which each of the $n(n-1)$ possible directed edges is present independently with probability $p$. We are interested in the strongly connected…
In the mean field (or random link) model there are $n$ points and inter-point distances are independent random variables. For $0 < \ell < \infty$ and in the $n \to \infty$ limit, let $\delta(\ell) = 1/n \times$ (maximum number of steps in a…
We consider a stochastic sandpile where the sand-grains of unstable sites are randomly distributed to the nearest neighbors. Increasing the value of the threshold condition the stochastic character of the distribution is lost and a…
In this paper we investigate the scaling limit of the range (the set of visited vertices) for a class of critical lattice models, starting from a single initial particle at the origin. We give conditions on the random sets and an associated…
We consider a one-dimensional network in which the nodes at Euclidean distance $l$ can have long range connections with a probabilty $P(l) \sim l^{-\delta}$ in addition to nearest neighbour connections. This system has been shown to exhibit…
Several studies on real complex networks from different fields as biology, economy, or sociology have shown that the degree of nodes (number of edges connected to each node) follows a scale-free power-law distribution like $P(k)\approx…
We study the Gierer-Meinhardt model of reaction-diffusion on a site-disordered square lattice. Let $p$ be the site occupation probability of the square lattice. For $p$ greater than a critical value $p_c$, the steady state consists of…
This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe trees isomorphic to a fixed tree, we investigate the case…
We present a simple mechanism for generating undirected scale-free networks using random walkers, where the network growth is determined by choosing parent vertices by sequential random walks. We show that this mechanism produces scale-free…
The main substance of the paper concerns the growth rate and the classification (ergodicity, transience) of a family of random trees. In the basic model, new edges appear according to a Poisson process of parameter $\lambda$ and leaves can…
We study the percolation of strongly connected clusters (SCCs), in which sites are mutually reachable through directed paths, in systems with randomly oriented bonds by extensive simulations on hypercubic lattices from dimension $d=2$ to…
This paper studies the behavior of RWRE on trees in the critical case left open in previous work. For trees of exponential growth, a random perturbation of the transition probabilities can change a transient random walk into a recurrent…
Loops are subgraphs responsible for the multiplicity of paths going from one to another generic node in a given network. In this paper we present an analytic approach for the evaluation of the average number of loops in random scale-free…
We consider supercritical branching random walks on transitive graphs and we prove a law of large numbers for the mean displacement of the ensemble of particles, and a Stam-type central limit theorem for the empirical distributions, thus…
We study bond percolations on hierarchical scale-free networks with the open bond probability of the shortcuts $\tilde{p}$ and that of the ordinary bonds $p$. The system has a critical phase in which the percolating probability $P$ takes an…
A branching random walk in presence of an absorbing wall moving at a constant velocity v undergoes a phase transition as v varies. The problem can be analyzed using the properties of the Fisher-Kolmogorov-Petrovsky-Piscounov (F-KPP)…
The reproduction speed of a continuous-time branching random walk is proportional to a positive parameter $\lambda$. There is a threshold for $\lambda$, which is called $\lambda_w$, that separates almost sure global extinction from global…
We propose a numerical method to evaluate the upper critical dimension $d_c$ of random percolation clusters in Erd\H{o}s-R\'{e}nyi networks and in scale-free networks with degree distribution ${\cal P}(k) \sim k^{-\lambda}$, where $k$ is…
We investigate properties of node centrality in random growing tree models. We focus on a measure of centrality that computes the maximum subtree size of the tree rooted at each node, with the most central node being the tree centroid. For…