Related papers: Anomalous biased diffusion in networks
We introduce a new threshold model of social networks, in which the nodes influenced by their neighbours can adopt one out of several alternatives. We characterize the graphs for which adoption of a product by the whole network is possible…
We study the biased diffusion of particles moving in one direction under the action of a constant force in the presence of a piecewise linear random potential. Using the overdamped equation of motion, we represent the first and second…
We study probabilistic protocols for concurrent threshold-based load balancing in networks. There are n resources or machines represented by nodes in an undirected graph and m >> n users that try to find an acceptable resource by moving…
We consider the random walk Metropolis algorithm on $\mathbb{R}^n$ with Gaussian proposals, and when the target probability measure is the $n$-fold product of a one-dimensional law. In the limit $n\to\infty$, it is well known (see [Ann.…
We analyze the effect of interference on the convergence rate of average consensus algorithms, which iteratively compute the measurement average by message passing among nodes. It is usually assumed that these algorithms converge faster…
We study a Brownian particle diffusing under a time-modulated stochastic resetting mechanism to a fixed position. The rate of resetting r(t) is a function of the time t since the last reset event. We derive a sufficient condition on r(t)…
This paper presents results on the typical number of simultaneous point-to-point transmissions above a minimum rate that can be sustained in a network with $n$ transmitter-receiver node pairs when all transmitting nodes can potentially…
Transport is an important function of networks. Studying transport efficiency sheds light on the dynamic processes occurring within various underlying structures and offers a wide range of applications. To construct networks with different…
We study the mean traversal time for a class of random walks on Newman-Watts small-world networks, in which steps around the edge of the network occur with a transition rate F that is different from the rate f for steps across small-world…
We study the diffusion of an ensemble of overdamped particles sliding over a tilted random poten- tial (produced by the interaction of a particle with a random polymer) with long-range correlations. We found that the diffusion properties of…
In this paper, we present a detailed framework to analyze the evolution of the random topology of a time-varying wireless network via the information theoretic notion of entropy rate. We consider a propagation channel varying over time with…
We revisit the diffusion properties and the mean drift induced by an external field of a random walk process in a class of branched structures, as the comb lattice and the linear chains of plaquettes. A simple treatment based on scaling…
We investigate the ensemble and time averaged mean squared displacements for particle diffusion in a simple model for disordered media by assuming that the local diffusivity is both fluctuating in time and has a deterministic average growth…
Cellular networks are often composed of thin tubules connecting much larger node compartments. These structures serve for active or diffusion transport of proteins. Examples are glial networks in the brain, the endoplasmic reticulum in…
We consider a cognitive network consisting of n random pairs of cognitive transmitters and receivers communicating simultaneously in the presence of multiple primary users. Of interest is how the maximum throughput achieved by the cognitive…
We extend the theoretical framework used to study search processes with stochastic resetting to the case of partially absorbing targets. Instead of an absorption event occurring when the search particle reaches the boundary of a target, the…
Sood and Grassberger studied in [Phys. Rev. Lett. 99, 098701 (2007)] random walks on random graphs that are biased towards a fixed target point. They put forward a critical bias strength b_c such that a random walker on an infinite graph…
We study large deviations, over a long time window $T \to \infty$, of the dynamical observables $A_n = \int_{0}^{T} x^n(t) dt$, $n=3,4,\dots$, where $x(t)$ is a centered stationary Gaussian process in continuous time. We show that, for…
Evaluating the completion time of a random algorithm or a running stochastic process is a valuable tip not only from a purely theoretical, but also pragmatic point of view. In the formal sense, this kind of a task is specified in terms of…
The first-passage time (FPT) of a stochastic signal to a threshold is a fundamental observable across physics, biology, and finance. While renewal shot noise is a canonical model for such signals, analytical results for its FPT have…