Complex first-passage transport in ring networks with long-range jumps and stochastic resetting
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915965938171904 |
|---|---|
| author | Mena, Oscar Ivan Torres Sevilla, Francisco J |
| author_facet | Mena, Oscar Ivan Torres Sevilla, Francisco J |
| contents | 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 nearest neighbors and to nodes located at a fixed distance $r$. Using the spectral properties of the transition matrix, we derive explicit expressions for the occupation probabilities and mean first-passage times (MFPTs). Contrary to the common expectation that shortcuts monotonically enhance transport, we find that the MFPT between distant nodes develops a highly non-monotonic dependence on the shortcut length. Beyond a threshold value, the MFPT landscape exhibits a hierarchy of maxima and minima organized in a self-similar pattern associated with commensurability relations between the shortcut length and the system size. The scaling behavior of these extrema reveals regimes where transport efficiency is either strongly enhanced or suppressed. We further analyze the mean squared displacement and the influence of stochastic resetting, showing that resetting amplifies the oscillatory MFPT structure and induces strongly nonuniform stationary distributions. These results demonstrate that the spatial organization of long-range connections plays a crucial role in determining transport efficiency in networks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_26215 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Complex first-passage transport in ring networks with long-range jumps and stochastic resetting Mena, Oscar Ivan Torres Sevilla, Francisco J Statistical Mechanics 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 nearest neighbors and to nodes located at a fixed distance $r$. Using the spectral properties of the transition matrix, we derive explicit expressions for the occupation probabilities and mean first-passage times (MFPTs). Contrary to the common expectation that shortcuts monotonically enhance transport, we find that the MFPT between distant nodes develops a highly non-monotonic dependence on the shortcut length. Beyond a threshold value, the MFPT landscape exhibits a hierarchy of maxima and minima organized in a self-similar pattern associated with commensurability relations between the shortcut length and the system size. The scaling behavior of these extrema reveals regimes where transport efficiency is either strongly enhanced or suppressed. We further analyze the mean squared displacement and the influence of stochastic resetting, showing that resetting amplifies the oscillatory MFPT structure and induces strongly nonuniform stationary distributions. These results demonstrate that the spatial organization of long-range connections plays a crucial role in determining transport efficiency in networks. |
| title | Complex first-passage transport in ring networks with long-range jumps and stochastic resetting |
| topic | Statistical Mechanics |
| url | https://arxiv.org/abs/2604.26215 |