Related papers: Size distribution of clusters in site-percolation …
Transient dynamics leading to the synchrony of pulse-coupled oscillators has previously been studied as an aggregation process of synchronous clusters, and a rate equation for the cluster size distribution has been proposed. However, the…
We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…
We study occurrences of patterns on clusters of size n in random fields on Z^d. We prove that for a given pattern, there is a constant a>0 such that the probability that this pattern occurs at most an times on a cluster of size n is…
In this study, we investigate bond percolation in networks that have the Poisson degree distribution and a nearest-neighbor degree-degree correlation. Previous numerical studies on percolation critical behaviors of degree-correlated…
We investigate properties of node centrality in random growing tree models. We focus on a measure of centrality that computes the maximum subtree size of the tree rooted at each node, with the most central node being the tree centroid. For…
To address some physical properties of percolating systems it can be useful to know the degree distributions in finite clusters along with their size distribution. Here we show that to achieve this aim for classical bond percolation one can…
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…
In this paper, site percolation on random $\Phi^{3}$ planar graphs is studied by Monte-Carlo numerical techniques. The method consists in randomly removing a fraction $q=1-p$ of vertices from graphs generated by Monte-Carlo simulations,…
We prove that the probability the cluster of the origin in a subcritical Poisson random connection model (RCM) has size at least $n$ decays exponentially as $n$ increases, under minimal assumptions. We extend a recent method of Vanneuville…
We consider invasion percolation on the randomly-weighted complete graph $K_n$, started from some number $k(n)$ of distinct source vertices. The outcome of the process is a forest consisting of $k(n)$ trees, each containing exactly one…
Panagiotou and Stufler recently proved an important fact on their way to establish the scaling limits of random P\'olya trees: a uniform random P\'olya tree of size $n$ consists of a conditioned critical Galton-Watson tree $C_n$ and many…
We study a percolation model on the square lattice, where clusters "freeze" (stop growing) as soon as their volume (i.e. the number of sites they contain) gets larger than N, the parameter of the model. A model where clusters freeze when…
We give an exact solution for the complete distribution of component sizes in random networks with arbitrary degree distributions. The solution tells us the probability that a randomly chosen node belongs to a component of size s, for any…
Human development has far-reaching impacts on the surface of the globe. The transformation of natural land cover occurs in different forms and urban growth is one of the most eminent transformative processes. We analyze global land cover…
We present a rough estimation -- up to four significant digits, based on the scaling hypothesis and the probability of belonging to the largest cluster vs. the occupation probability -- of the critical occupation probabilities for the…
We study the cluster size distribution of particles for a two-species exclusion process which involves totally asymmetric transport process of two oppositely directed species with stochastic directional switching of the species on a 1D…
We investigate the heterogeneity of outcomes of repeated instances of percolation experiments in complex networks using a message passing approach to evaluate heterogeneous, node dependent probabilities of belonging to the giant or…
In this note we consider the $k$th level of the uniform random recursive tree after $n$ steps, and prove that the proportion of nodes with degree greater than $t\log n$ converges to $(1-t)^k$ almost surely, as $n\to\infty$, for every…
We study a rumour model from a percolation theory and branching process point of view. The existence of a giant component is related to the event where the rumour, which started from the root of a tree, spreads out through an infinite…
We describe a representation of the Bolthausen-Sznitman coalescent in terms of the cutting of random recursive trees. Using this representation, we prove results concerning the final collision of the coalescent restricted to [n]: we show…