We introduce an incidence-based random walk on the edges of a random two-dimensional simplicial complex with a complete $1$-skeleton and independently retained triangular faces. The dynamics combine two transport channels, one mediated by vertices and the other by triangular faces, through an effective transition operator controlled by a mixing parameter $q$. This construction isolates the effects of higher-order connectivity without modifying the underlying pairwise support of the walk. We characterize the model through structural observables, spectral relaxation, stationary localization, and first-passage transport. Our results show that partial face retention generates heterogeneous higher-order connectivity, giving rise to a pronounced transport bottleneck at intermediate face densities. In this regime, the second-largest eigenvalue modulus, the inverse participation ratio of the stationary distribution, and the mean first-passage time all exhibit non-monotonic behavior, reaching their largest values at intermediate face densities. The corresponding first-passage-time distributions reveal an enhanced probability of unusually long trajectories. Together, these results establish a simple framework for investigating how heterogeneous higher-order connectivity reshapes spectral and transport properties beyond pairwise network dynamics.
This work provides a perturbative approximation scheme recovering the modulation parameter between pure random walk and teleportation mode acting as the expansion parameter for simplicial complexes: a specific type of geometric and algebraic structures that encapsulates higher-order interactions.
Diego Febbe, Duccio Fanelli, Gianluca Peri et al.· 0 citations
We investigate random recursive simplicial complexes growing by adding, at each step, a vertex together with a simplex formed by joining the new vertex with a randomly chosen existing simplex. We also add all faces of the new simplex to ensure that the resulting object remains a simplicial complex. If the choice of an...
Two competitors choose starting vertices for independent, constant-speed random walks, and each site is acquired by its first visitor. We study the spatial geometry of the resulting first-passage location game. On every finite path the optimal strategies are exactly the distributions supported on the central vertices....
A vertex-reinforced random walk steps to a neighbour with probability proportional to $1+\beta n^{a}$, where $n$ counts previous visits to that neighbour and $a\in(0,1)$ sets the memory strength. On the rooted $b$-ary tree the exponential growth of the vertex set drives the walk outward while the reinforcement pulls it...
We consider the probability that the convex hull of the first $n$ partial sums of a $d$-dimensional random walk contains the origin. Under symmetric exchangeability of the increments and a general-position assumption, this absorption probability is distribution-free and admits an explicit formula, previously obtained b...
We consider a class of infinite critical tree-indexed random walks on $\mathbb Z$, where the motion of particles is subject to vertex reinforcement. We mainly focus on the strong reinforcement regime, where we expect the process to localize almost surely on two sites. Part of our analysis includes the study of a time-d...
Bruno Schapira· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.