This work demonstrates how equilibrium measures within the framework of Schr¨odinger random walks on networks can be leveraged to compute key network parameters such as the Mean First Passage Time (MFPT) and Kemeny's constant by expressing these parameters in terms of generalized inverses of the associated M-matrix.
Á. Carmona, A. Encinas, M. J. Jiménez et al.· The Electronic Journal of Li...· 0 citations
We show sharpness of the phase transition for a nearest-neighbour percolation model on $\mathbb Z^d$, where vertices carry independent types and the percolation probability of edges depends on the type of the adjacent vertices. Our proof uses the OSSS inequality and adapts to our setup the method developed in Duminil-Copin et al. (2017) for the random cluster model. Additionally, we provide a more extensive study of the special case of combined Bernoulli bond and site percolation featuring a phase transition with two parameters.
In this paper, we prove that the fluctuations of the graph distance and the effective resistance on the trace of a random walk in four and five dimensions converge in distribution to a stable law. In previous work, the first and second authors proved that the corresponding fluctuations converge to a Gaussian distribution in dimensions six and higher. Taken together, these results reveal a phase transition between dimensions five and six. Our proof develops a novel coupling with long range percolation, and we expect this technique to find applications in a broad class of related models.
A. Adhikari, Izumi Okada, D. Shiraishi· 0 citations
The stochastic block model is a widely studied model of community structure in networks. Here we study the component structure and percolation properties of networks generated from this model and its variants, using exact methods based on probability generating functions. In particular, we derive expressions for the size of the giant component and the distribution of small components in such networks and for the size of the percolating cluster and position of the percolation threshold for both node and edge percolation, for the original stochastic block model and for its degree-corrected versions. In passing, we also develop a mapping between generating functions for microcanonical and canonical block models that allows us to generalize results for the former to the latter with minimal effort.
Random walks with long-range jumps can drive superdiffusive transport, replacing ordinary diffusion with an effective long-range kinetic operator. Such superdiffusive kinetics is also central to critical phenomena, notably the self-avoiding walk with long-range jump statistics, or L\'evy-SAW. This work investigates how the critical behavior is affected when the long-range connectivity itself becomes random. We study self-avoiding walks (SAWs) on a one-dimensional long-range random ring graph, where bonds are independently generated with Bernoulli probability $\sim|i-j|^{-(1+\sigma)}$. We term this walk Sparse-SAW. The same random bonds are responsible for both long-range superdiffusive transport and quenched disorder, with both simultaneously controlled by the single parameter $\sigma$, placing the problem beyond the conventional Harris and Weinrib-Halperin frameworks. Through large-scale Monte Carlo simulations and a Gaussian-truncated field theory, we show that Sparse-SAW belongs to the same universality class as the clean superdiffusive L\'evy-SAW. The random bonds generate short-range uncorrelated and long-range correlated mass disorder while simultaneously producing the long-range kinetic operator. Under coarse-graining, the latter dominates, restoring the clean critical behavior. Our study suggests that the full non-Gaussian Bernoulli statistics may lead to disorder physics beyond the conventional theory of quenched disorder, while establishing random graphs as an efficient platform for extracting the critical exponents of the clean superdiffusive L\'evy-SAW universality class.