Related papers: Diffusive Capture Process on Complex Networks
The survival probability, S_N(t), of a diffusing prey (``lamb'') in the proximity of N diffusing predators (a ``pride of lions'') in one dimension is investigated. When the lions are all to one side of the lamb, the survival probability…
The predator/prey (capture) problem is a prototype of many network-related applications. We study the capture process on complex networks by considering multiple predators from multiple sources. In our model, some lions start from multiple…
We study the capture of a diffusing "lamb" by diffusing "lions" in one dimension. The capture dynamics is exactly soluble by probabilistic techniques when the number of lions is very small, and is tractable by extreme statistics…
In this work we investigate the dynamics of random walk processes on scale-free networks in a short to moderate time scale. We perform extensive simulations for the calculation of the mean squared displacement, the network coverage and the…
We study the survival of a single diffusing lamb on the positive half line in the presence of N diffusing lions that all start at the same position L to the right of the lamb and a haven at x=0. If the lamb reaches this haven before meeting…
Kinetically grown self-avoiding walks on various types of generalized random networks have been studied. Networks with short- and long-tailed degree distributions $P(k)$ were considered ($k$, degree or connectivity), including scale-free…
The characterization of the "most connected" nodes in static or slowly evolving complex networks has helped in understanding and predicting the behavior of social, biological, and technological networked systems, including their robustness…
A diffusing lion pursues a diffusing lamb when both of them are allowed to get back to their homes intermittently. Identifying the system with a pair of vicious random walkers, we study their dynamics under Poissonian and sharp resetting.…
Many real-world scale-free networks, such as neural networks and online communication networks, consist of a fixed number of nodes but exhibit dynamic edge fluctuations. However, traditional models frequently overlook scenarios where the…
We show how effectively the diffusive capture processes (DCP) on complex networks can be applied to information search in the networks. Numerical simulations show that our method generates only 2% of traffic compared with the most popular…
We investigate condensation phase transitions of symmetric conserved-mass aggregation (SCA) model on random networks (RNs) and scale-free networks (SFNs) with degree distribution $P(k) \sim k^{-\gamma}$. In SCA model, masses diffuse with…
Using a simple model with link removals as well as link additions, we show that an evolving network is scale free with a degree exponent in the range of (2, 4]. We then establish a relation between the network evolution and a set of…
We study the influence of elements diffusing in and out of a network to the topological changes of the network and characterize it by investigating the behavior of probability of degree distribution ($\Gamma(k)$) with degree $k$. The local…
Metabolic networks are known to be scale free but the evolutionary origin of this structural property is not clearly understood. One way of studying the dynamical process is to compare the metabolic networks of species that have arisen at…
Complex networks in different areas exhibit degree distributions with heavy upper tail. A preferential attachment mechanism in a growth process produces a graph with this feature. We herein investigate a variant of the simple preferential…
A dynamical model of small-world network, with directed links which describe various correlations in social and natural phenomena, is presented. Random responses of every site to the imput message are introduced to simulate real systems.…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
We study a novel model for evolution of complex networks. We introduce information filtering for reduction of the number of available nodes to a randomly chosen sample, as stochastic component of evolution. New nodes are attached to the…
Synchronization problems in complex networks are very often studied by researchers due to its many applications to various fields such as neurobiology, e-commerce and completion of tasks. In particular, Scale Free networks with degree…
We consider a general model in which there is a coupled dynamics of node states and links states in a network. This coupled dynamics coevolves with dynamical changes of the topology of the network caused by a link rewiring mechanism. Such…