相关论文: Entropic Collapse and Extreme First-Passage Times …
We consider a mortal random walker on a family of hierarchical graphs in the presence of some trap sites. The configuration comprising the graph, the starting point of the walk, and the locations of the trap sites is taken to be exactly…
Consider a network embedded in the 2D plane, where a particle diffuses along the edges of the network. It is clear that over short length scales a particle moves along a single edge and thus undergoes one-dimensional diffusion. However, on…
Many biological, social, and communication systems can be modeled by ``searchers'' moving through a complex network. For example, intracellular cargo is transported on tubular networks, news and rumors spread through online social networks,…
The first passage time (FPT) for random walks is a key indicator of how fast information diffuses in a given system. Despite the role of FPT as a fundamental feature in transport phenomena, its behavior, particularly in heterogeneous…
The presence of temporal correlations in random movement trajectories is a widespread phenomenon across biological, chemical and physical systems. The ubiquity of persistent and anti-persistent motion in many natural and synthetic systems…
First-passage times are often the most relevant aspect of a complex Markovian network, because they signify when information processing has resulted in a definite decision. Previous studies have shown that for kinetic proofreading networks…
A large and sparse random graph with independent exponentially distributed link weights can be used to model the propagation of messages or diseases in a network with an unknown connectivity structure. In this article we study an extended…
The transport properties of discrete-time random walks on ring networks with deterministic shortcuts are investigated through analytical and numerical methods. The network consists of a periodic chain where each node is connected to its…
We analyse diffusion dynamics on weakly-coupled networks (interconnected networks) by means of separation of time scales. Using an adiabatic approximation we reduced the system dynamics to a Markov chain with aggregated variables and…
We consider discrete time dynamical systems and show the link between Hitting Time Statistics (the distribution of the first time points land in asymptotically small sets) and Extreme Value Theory (distribution properties of the partial…
Understanding the topological characteristics of complex networks and how they affect navigability is one of the most important goals in science today, as it plays a central role in various economic, biological, ecological and social…
Recently, De Martino et al have presented a general framework for the study of transportation phenomena on complex networks. One of their most significant achievements was a deeper understanding of the phase transition from the uncongested…
For probability measures on countable spaces we derive distributional limits for empirical entropic optimal transport quantities. More precisely, we show that the empirical optimal transport plan weakly converges to a centered Gaussian…
We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…
We study in this paper optimal mass transport over a strongly connected, directed graph on a given discrete time interval. Differently from previous literature, we do not assume full knowledge of the initial and final goods distribution…
First passage time statistics in disordered systems exhibiting scale invariance are studied widely. In particular, long trapping times in energy or entropic traps are fat-tailed distributed, which slow the overall transport process. We…
The statistics of the slowest first-passage time among a large population of $N$ searchers is crucial for determining the completion time of many stochastic processes. Classical extreme-value theory predicts that for diffusing particles in…
We revisit an old minor topic in algorithms, the deterministic walk on a finite graph which always moves toward the nearest unvisited vertex until every vertex is visited. There is an elementary connection between this cover time and…
In the classic model of first passage percolation, for pairs of vertices separated by a Euclidean distance $L$, geodesics exhibit deviations from their mean length $L$ that are of order $L^\chi$, while the transversal fluctuations, known as…
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…