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.
In this paper, we investigate models of percolation of words on $\mathbb{Z}_+$ with long-range connections. The underlying graph is oriented and constructed according to a sequence of non-negative ranges. In the first model, the sequence of ranges is considered random and, in the second model, deterministic and non-decreasing. In both cases, we establish a phase transition for the occurrence of percolation of all words simultaneously from the origin.
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.
It is shown that spreading dynamics on temporal networks can analogously be mapped to reachability in temporal event graphs, which provides a theoretical and computational framework for a class of processes, such as variants of the susceptible-infected-susceptible model.
Omar Henderson, Mikko Kivelä, M'arton Karsai· 0 citations
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
We study percolation on lattices with directed bonds, focusing on the behavior of strongly-connected percolation clusters -- clusters in which every site is reachable from every other along a directed path. We consider the two-dimensional square lattice and various globally isotropic arrangements of the directions of the bonds. Performing simulations using a range of algorithmic approaches, we calculate high-precision values for critical exponents, fractal dimensions, crossing probabilities, and percolation thresholds for bond percolation with each bond arrangement. We find that the critical behavior is in a distinctly different universality class from that of traditional undirected percolation, but that all bond arrangements appear to fall in the same universality class.
M. Newman, P. Grassberger, R. Ziff· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
