Related papers: Transport Efficiency for Networks Obtained by Vert…
First passage phenomena arise across physics, biology, and finance when stochastic processes first reach a threshold, triggering downstream events. Examples include the irreversible exit from a domain, a biochemical reaction, a financial…
In this paper, we propose a class of growth models, named Fibonacci trees $F(t)$, with respect to the intrinsic advantage of Fibonacci sequence $\{F_{t}\}$. First, we turn out model $F(t)$ to have power-law degree distribution with exponent…
We study the information traffic in Barab\'asi-Albert scale free networks wherein each node has finite queue length to store the packets. It is found that in the case of shortest path routing strategy the networks undergo a first order…
We develop novel numerical methods and perturbation approaches to determine the mean first passage time (MFPT) for a Brownian particle to be captured by either small stationary or mobile traps inside a bounded 2-D confining domain. Of…
In this paper we show how graph structure can be used to drastically reduce the computational bottleneck of the Breadth First Search algorithm (the foundation of many graph traversal techniques). In particular, we address parallel…
Various graph algorithms have been developed with multiple random walks, the movement of several independent random walkers on a graph. Designing an efficient graph algorithm based on multiple random walks requires investigating multiple…
Many scientific questions can be framed as asking for a first passage time (FPT), which generically describes the time it takes a random "searcher" to find a "target." The important timescale in a variety of biophysical systems is the time…
Real-time navigation services, such as Google Maps and Waze, are widely used in daily life. These services provide rich data resources in real-time traffic conditions and travel time predictions; however, they have not been fully applied in…
Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not…
In this paper, we propose a model for evaluating the transmission performance of multipath transport. Previous researches focused exclusively on single pair users in simple scenarios. The distinct perspective in this paper is to build…
We study the problem of random search in finite networks with a tree topology, where it is expected that the distribution of the first-passage time F(t) decays exponentially. We show that the slope of the exponential tail is independent of…
We present a comparative study of the application of a recently introduced heuristic algorithm to the optimization of transport on three major types of complex networks. The algorithm balances network traffic iteratively by minimizing the…
An approach was developed to describe the first passage time (FPT) in multistep stochastic processes with discrete states governed by a master equation (ME). The approach is an extension of the totally absorbing boundary approach given for…
Migration of immune cells within the human body allows them to fulfill their main function of detecting pathogens. Adopting an optimal navigation and search strategy by these cells is of crucial importance to achieve an efficient immune…
The co-evolution between network structure and functional performance is a fundamental and challenging problem whose complexity emerges from the intrinsic interdependent nature of structure and function. Within this context, we investigate…
We study the problem of a particle/message that travels as a biased random walk towards a target node in a network in the presence of traps. The bias is represented as the probability $p$ of the particle to travel along the shortest path to…
While it is well-known and acknowledged that the performance of graph algorithms is heavily dependent on the input data, there has been surprisingly little research to quantify and predict the impact the graph structure has on performance.…
Multipathing in communication networks is gaining momentum due to its attractive features of increased reliability, throughput, fault tolerance, and load balancing capabilities. In particular, wireless environments and datacenters are…
Accurate traffic prediction, especially predicting traffic conditions several days in advance is essential for intelligent transportation systems (ITS). Such predictions enable mid- and long-term traffic optimization, which is crucial for…
We study the mean time for a random walk to traverse between two arbitrary sites of the Erdos-Renyi random graph. We develop an effective medium approximation that predicts that the mean first-passage time between pairs of nodes, as well as…