Related papers: A new route to Explosive Percolation
Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning…
We study the explosive character of the percolation transition in a real-world network. We show that the emergence of a spanning cluster in the Human Protein Homology Network (H-PHN) exhibits similar features to an Achlioptas-type process…
We present exact and asymptotic results for clusters in the one-dimensional totally asymmetric exclusion process (TASEP) with two different dynamics. The expected length of the largest cluster is shown to diverge logarithmically with…
We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…
To investigate the network-growth rule dependence of certain geometric aspects of percolation clusters, we propose a generalized network-growth rule introducing a generalized parameter $q$ and we study the time evolution of the network. The…
We consider self-loops and multiple edges in the configuration model as the size of the graph tends to infinity. The interest in these random variables is due to the fact that the configuration model, conditioned on being simple, is a…
Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already…
Preferential attachment models are a common class of graph models which have been used to explain why power-law distributions appear in the degree sequences of real network data. One of the things they lack, however, is higher-order network…
The state space of our model is the Euclidean space in dimension d = 2. Simultaneously, from all points of a homogeneous Poisson point process, we let grow independent and identically distributed random continuum paths. Each path stops…
Using stochastic conformal mapping techniques we study the patterns emerging from Laplacian growth with a power-law decaying threshold for growth $R_N^{-\gamma}$ (where $R_N$ is the radius of the $N-$ particle cluster). For $\gamma > 1$ the…
We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…
Two cellular automata models with directed mass flow and internal time scales are studied by numerical simulations. Relaxation rules are a combination of probabilistic critical height (probability of toppling $p$) and deterministic critical…
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…
The analysis in this paper helps to explain the formation of growing networks with degree distributions that follow extended exponential or power-law tails. We present a generic model in which edge dynamics are driven by a continuous…
Here a viable and never before investigated mechanism of propagation of spikes along neurons is proposed. In the following, velocity of propagation of small-amplitude pressure waves through the cytoplasmic interior of myelinated and…
The surprising manifestation of collectivity in small collision systems, such as nucleon-nucleon and nucleon-nucleus collisions, is perhaps even more striking when discussed at higher momenta. In larger systems, high-$p_T$ elliptic…
Clustering data into meaningful subsets is a major task in scientific data analysis. To date, various strategies ranging from model-based approaches to data-driven schemes, have been devised for efficient and accurate clustering. One…
We study limit laws for simple random walks on supercritical long-range percolation clusters on the integer lattice. For the long range percolation model, the probability that two vertices are connected behaves asymptotically as a negative…
Bootstrap percolation in (random) graphs is a contagion dynamics among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$…
We discuss the front propagation in the $A+B\rightarrow 2A$ reaction under subdiffusion which is described by continuous time random walks with a heavy-tailed power law waiting time probability density function. Using a crossover argument,…