Related papers: Diffusive Capture Process on Complex Networks
In the study of dynamics on networks, moment closure is a commonly used method to obtain low-dimensional evolution equations amenable to analysis. The variables in the evolution equations are mean counts of subgraph states and are referred…
It is commonly believed that real networks are scale-free and fraction of nodes $P(k)$ with degree $k$ satisfies the power law $P(k) \propto k^{-\gamma} \text{ for } k > k_{min} > 0$. Preferential attachment is the mechanism that has been…
Although the origin of the fat-tail characteristic of the degree distribution in complex networks has been extensively researched, the underlying cause of the degree distribution characteristic across the complete range of degrees remains…
The properties of a particle diffusing on a one-dimensional lattice where at each site a random barrier and a random trap act simultaneously on the particle are investigated by numerical and analytical techniques. The combined effect of…
An ongoing challenge in animal ecology is developing movement models that account for the autocorrelation, and often temporal irregularity, in telemetry data. Continuous-time Langevin diffusion models have been proposed to model temporally…
We investigate the trapping problem in Erdos-Renyi (ER) and Scale-Free (SF) networks. We calculate the evolution of the particle density $\rho(t)$ of random walkers in the presence of one or multiple traps with concentration $c$. We show…
Dynamic Spectrum Access systems exploit temporarily available spectrum (`white spaces') and can spread transmissions over a number of non-contiguous sub-channels. Such methods are highly beneficial in terms of spectrum utilization. However,…
We consider the competition of two mechanisms for adoption processes: a so-called complex threshold dynamics and a simple Susceptible-Infected-Susceptible (SIS) model. Separately, these mechanisms lead, respectively, to first order and…
The one-dimensional random trap model with a power-law distribution of mean sojourn times exhibits a phenomenon of dynamical localization in the case where diffusion is anomalous: The probability to find two independent walkers at the same…
The first passage search of a diffusing target (prey) by multiple searchers (predators) in confinement is an important problem in the stochastic process literature. While the analogous problem in open space has been studied in some details,…
Generic short-range interacting quantum systems with a conserved quantity exhibit universal diffusive transport at late times. We employ non-equilibrium quantum field theory and semi-classical phase-space simulations to show how this…
We analyze the dynamics of the Sisyphus random walk model, a discrete Markov chain in which the walkers may randomly return to their initial position $x_0$. In particular, we present a remarkably compact derivation of the time-dependent…
We show that the load at each node in a preferential attachment network scales as a power of the degree of the node. For a network whose degree distribution is p(k) ~ k^(-gamma), we show that the load is l(k) ~ k^eta with eta = gamma - 1,…
To study transport properties of complex networks, we analyze the equivalent conductance $G$ between two arbitrarily chosen nodes of random scale-free networks with degree distribution $P(k)\sim k^{-\lambda}$ in which each link has the same…
Much research has been done on studying the diffusion of ideas or technologies on social networks including the \textit{Influence Maximization} problem and many of its variations. Here, we investigate a type of inverse problem. Given a…
Although species longevity is subject to a diverse range of selective forces, the mortality curves of a wide variety of organisms are rather similar. We argue that aging and its universal characteristics may have evolved by means of a…
Previous work shows that the mean first-passage time (MFPT) for random walks to a given hub node (node with maximum degree) in uncorrelated random scale-free networks is closely related to the exponent $\gamma$ of power-law degree…
Preferential attachment drives the evolution of many complex networks. Its analytical studies mostly consider the simplest case of a network that grows uniformly in time despite the accelerating growth of many real networks. Motivated by…
We consider a growing network, whose growth algorithm is based on the preferential attachment typical for scale-free constructions, but where the long-range bonds are disadvantaged. Thus, the probability to get connected to a site at…
We compute the stationary in-degree probability, $P_{in}(k)$, for a growing network model with directed edges and arbitrary out-degree probability. In particular, under preferential linking, we find that if the nodes have a light tail…