Related papers: A new route to Explosive Percolation
Biased (degree-dependent) percolation was recently shown to provide new strategies for turning robust networks fragile and vice versa. Here we present more detailed results for biased edge percolation on scale-free networks. We assume a…
We study the agglomerative percolation (AP) models on the Bethe lattice and the triangular cactus to establish the exact mean-field theory for AP. Using the self-consistent simulation method, based on the exact self-consistent equation, we…
The effect of introducing a mass dependent diffusion rate ~ m^{-alpha} in a model of coagulation with single-particle break up is studied both analytically and numerically. The model with alpha=0 is known to undergo a nonequilibrium phase…
We propose a model that generates a new class of networks exhibiting power-law degree distribution with a spectrum of exponents depending on the number of links ($m$) with which incoming nodes join the existing network. Unlike the…
Diffusion-Limited Aggregation (DLA) is a cluster-growth model that consists in a set of particles that are sequentially aggregated over a two-dimensional grid. In this paper, we introduce a biased version of the DLA model, in which…
Using a Lubachevsky-Stillinger-like growth algorithm combined with biased SWAP Monte Carlo and transient degrees of freedom, we generate ultradense disordered jammed ellipse packings. For all aspect ratios $\alpha$, these packings exhibit…
Bootstrap percolation is a prominent framework for studying the spreading of activity on a graph. We begin with an initial set of active vertices. The process then proceeds in rounds, and further vertices become active as soon as they have…
We investigate percolation on growing networks where the evolution of connected components resembles a non-equilibrium version of the multiplicative coalescent. The supercritical $\pi> \pi_c$ regime for a host of such models was conjectured…
We develop a percolation model motivated by recent experimental studies of gels with active network remodeling by molecular motors. This remodeling was found to lead to a critical state reminiscent of random percolation (RP), but with a…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $\lambda,\mu$. We show for $d \geq 2$ that if $\lambda$ is…
In this paper, we study the transport capacity of large multi-hop wireless CSMA networks. Different from previous studies which rely on the use of centralized scheduling algorithm and/or centralized routing algorithm to achieve the optimal…
We introduce a model for a growing random graph based on simultaneous reproduction of the vertices. The model can be thought of as a generalisation of the reproducing graphs of Southwell and Cannings and Bonato et al to allow for a random…
We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks that admit tunable (power law) degree distribution and assortativity and clustering coefficients. We show the asymptotic degree…
The availability of large scale streaming network data has reinforced the ubiquity of power-law distributions in observations and enabled precision measurements of the distribution parameters. The increased accuracy of these measurements…
We introduce a new percolation model to describe and analyze the spread of an epidemic on a general directed and locally finite graph. We assign a two-dimensional random weight vector to each vertex of the graph in such a way that the…
We derive a variational representation for the log-normalizing constant of the posterior distribution in Bayesian linear regression with a uniform spherical prior and an i.i.d. Gaussian design. We work under the "proportional" asymptotic…
There is still much to discover about the mechanisms and nature of discontinuous percolation transitions. Much of the past work considers graph evolution algorithms known as Achlioptas processes in which a single edge is added to the graph…
We derive distributional approximations for the number of triangles in the linear preferential attachment model $\mathrm{PAM}(m,\delta)$, where $m\ge 2$ and $\delta>-m$, with explicit rates of convergence. The limiting distribution…
It is recently discovered that at high multiplicy, the proton-nucleus ($pA$) collisions give rise to two particle correlations that are strikingly similar to those of nucleus-nucleus ($AA$) collisions at the same multiplicity, although the…