Related papers: Diffusive Capture Process on Complex Networks
We consider a one-dimensional Brownian motion with diffusion coefficient $D$ in the presence of $n$ partially absorbing traps with intensity $\beta$, separated by a distance $L$ and evenly spaced around the initial position of the particle.…
Ever since the Barab\'{a}si-Albert (BA) scale-free network has been proposed, network modeling has been studied intensively in light of the network growth and the preferential attachment (PA). However, numerous real systems are featured…
We derive a analytic evolution equation for overlap parameters including the effect of degree distribution on the transient dynamics of sequence processing neural networks. In the special case of globally coupled networks, the precisely…
In this work, we investigate the large-scale transport properties of a passive scalar advected by a turbulent fluid, modelled as a superposition of divergence-free vector fields, each weighted by an independent symmetric…
We study the condensation phenomenon in a zero range process on scale-free networks. We show that the stationary state property depends only on the degree distribution of underlying networks. The model displays a stationary state phase…
We propose a simple adaptive-network model describing recent swarming experiments. Exploiting an analogy with human decision making, we capture the dynamics of the model by a low-dimensional system of equations permitting analytical…
The recently developed concept of spreadability, $\mathcal{S}(t)$, provides a direct link between time-dependent diffusive transport and the microstructure of two-phase media across length scales. We explicitly compute $\mathcal{S}(t)$ for…
We present a simple model of network growth and solve it by writing down the dynamic equations for its macroscopic characteristics like the degree distribution and degree correlations. This allows us to study carefully the percolation…
Extensive studies have been done to understand the principles behind architectures of real networks. Recently, evidences for hierarchical organization in many real networks have also been reported. Here, we present a new hierarchical model…
In a recent Letter Bray and Blythe have shown that the survival probability P(t) of an A particle diffusing with a diffusion coefficient D_A in a 1D system with diffusive traps B is independent of D_A in the asymptotic limit t \to \infty…
We have performed extensive simulations of random sequential adsorption and diffusion of $k$-mers, up to $k=5$ in two dimensions with particular attention to the case $k=2$. We focus on the behavior of the coverage and of vacancy dynamics…
Barab\'asi-Albert's `Scale Free' model is the starting point for much of the accepted theory of the evolution of real world communication networks. Careful comparison of the theory with a wide range of real world networks, however,…
We investigate the avalanche temporal statistics of the Susceptible-Infected-Susceptible (SIS) model when the dynamics is critical and takes place on finite random networks. By considering numerical simulations on annealed topologies we…
1. The utilisation distribution describes the relative probability of use of a spatial unit by an animal. It is natural to think of it as the long-term consequence of the animal's short-term movement decisions: it is the accumulation of…
We analyze the dynamics of random walks with long-term memory (binary chains with long-range correlations) in the presence of an absorbing boundary. An analytically solvable model is presented, in which a dynamical phase-transition occurs…
The analysis of the dynamics of a large class of excitable systems on locally tree-like networks leads to the conclusion that at $\lambda=1$ a continuous phase transition takes place, where $\lambda$ is the largest eigenvalue of the…
Transport in complex networks can describe a variety of natural and human-engineered processes including biological, societal and technological ones. However, how the properties of the source and drain nodes can affect transport subject to…
The study of random graphs has become very popular for real-life network modeling such as social networks or financial networks. Inhomogeneous long-range percolation (or scale-free percolation) on the lattice $\mathbb Z^d$, $d\ge1$, is a…
We derive asymptotic properties for a stochastic dynamic network model in a stochastic dynamic population. In the model, nodes give birth to new nodes until they die, each node being equipped with a social index given at birth. During the…
Diffusion models are powerful generative models that produce high-quality samples from complex data. While their infinite-data behavior is well understood, their generalization with finite data remains less clear. Classical learning theory…