Related papers: Random spatial growth with paralyzing obstacles
We search the five CANDELS fields (COSMOS, EGS, GOODS-North, GOODS-South and UDS) for passively evolving a.k.a. "red and dead" massive galaxies in the first 2 Gyr after the Big Bang, integrating and updating the work on GOODS-South…
A phase diagram for a one dimensional fiber bundle model is constructed with a continuous variation in two parameters guiding dynamics of the model: strength of disorder and system size. We monitor the successive events of fiber rupture in…
We consider a model of long-range first-passage percolation on the $d$ dimensional square lattice $Z^d$ in which any two distinct vertices $x, y \in Z^d$ are connected by an edge having exponentially distributed passage time with mean…
Consider an infinite, rooted, connected graph where each vertex is labelled with an independent and identically distributed Uniform(0,1) random variable, plus a parameter $\theta$ times its distance from the root $\rho$. That is, we label…
The ranges of transmission of the mobiles in a Mobile Ad-hoc Network are not uniform in reality. They are affected by the temperature fluctuation in air, obstruction due to the solid objects, even the humidity difference in the environment,…
Exploiting a mass complete (M_*>10^(10.25)M_sun) sample at 0.03<z<0.11 drawn from the Padova Millennium Galaxy Group Catalog (PM2GC), we use the (U-B)_rf color and morphologies to characterize galaxies, in particular those that show signs…
Understanding what types of phenomena lead to discontinuous phase transitions in the connectivity of random networks is an outstanding challenge. Here we show that a simple stochastic model of graph evolution leads to a discontinuous…
Tropical rainforests exhibit a rich repertoire of spatial patterns emerging from the intricate relationship between the microscopic interaction between species. In particular, the distribution of vegetation clusters can shed much light on…
We study the evolution of graphs densifying by adding edges: Two vertices are chosen randomly, and an edge is (i) established if each vertex belongs to a tree; (ii) established with probability $p$ if only one vertex belongs to a tree;…
We examine the cosmic growth of the red sequence in a cosmological hydrodynamic simulation that includes a heuristic prescription for quenching star formation that yields a realistic passive galaxy population today. In this prescription,…
We describe the effect of power-law initial distributions of clusters on ordinary percolation and its generalizations, specifically, models of explosive percolation processes based on local optimization. These aggregation processes were…
Majority bootstrap percolation is a model of infection spreading in networks. Starting with a set of initially infected vertices, new vertices become infected once half of their neighbours are infected. Balogh, Bollob\'{a}s and Morris…
We study the bond percolation problem in random graphs of $N$ weighted vertices, where each vertex $i$ has a prescribed weight $P_i$ and an edge can connect vertices $i$ and $j$ with rate $P_iP_j$. The problem is solved by the $q\to 1$…
Resource competition is a fundamental interaction in natural communities.However little is known about competition in spatial environments where organisms are able to regulate resource distributions. Here, we analyze the competition of two…
We study a one parameter family of random graph models that spans a continuum between traditional random graphs of the Erd\H{o}s-R\'enyi type, where there is no underlying structure, and percolation models, where the possible edges are…
We study a percolation model with restrictions on the opening of sites on the square lattice. In this model, each site $s \in \mathbb{Z}^{2}$ starts closed and an attempt to open it occurs at time $t=t_s$, where $(t_s)_{s \in \mathbb{Z}^2}$…
We introduce a class of cellular automata growth models on the two-dimensional integer lattice with finite cross neighborhoods. These dynamics are determined by a Young diagram $\mathcal Z$ and the radius $\rho$ of the neighborhood, which…
We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [9]. We describe our results…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
We investigate vertex levels of containment in a random hypergraph grown in the spirit of a recursive tree. We consider a local profile tracking the evolution of the containment of a particular vertex over time, and a global profile…