Related papers: Uniform attachment with freezing: Scaling limits
In irreversible aggregation processes droplets or polymers of microscopic size successively coalesce until a large cluster of macroscopic scale forms. This gelation transition is widely believed to be self-averaging, meaning that the order…
Anomalous diffusion phenomena occur on length scales spanning from intracellular to astrophysical ranges. A specific form of decay at large argument of the probability density function of rescaled displacement (scaling function) is derived…
The growth of ballistic aggregates on deterministic fractal substrates is studied by means of numerical simulations. First, we attempt the description of the evolving interface of the aggregates by applying the well-established…
In this paper we introduce a new model of random spanning trees that we call choice spanning trees, constructed from so-called choice random walks. These are random walks for which each step is chosen from a subset of random options,…
We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent $\alpha+1$, where $\alpha \in (1,2)$. The limiting components are…
We obtain a complete description of anisotropic scaling limits and the existence of scaling transition for a class of negatively dependent linear random fields on ${\mathbb{Z}}^2$ with moving-average coefficients $a(t,s)$ decaying as…
We consider a class of density-dependent branching processes which generalises exponential, logistic and Gompertz growth. A population begins with a single individual, grows exponentially initially, and then growth may slow down as the…
We derive mostly analytically the scaling behavior of the number of nonfrozen and relevant nodes in critical Kauffman networks (with two inputs per node) in the thermodynamic limit. By defining and analyzing a stochastic process that…
The scaling properties of the roughness of surfaces grown by two different processes randomly alternating in time, are addressed. The duration of each application of the two primary processes is assumed to be independently drawn from given…
Consider the Markov process taking values in the partitions of N such that each pair of blocks merges at rate one, and each integer is eroded, i.e., becomes a singleton block, at rate d. This is a special case of exchangeable…
The nested Kingman coalescent describes the ancestral tree of a population undergoing neutral evolution at the level of individuals and at the level of species, simultaneously. We study the speed at which the number of lineages descends…
The evolving Kingman coalescent is the tree-valued process which records the time evolution undergone by the genealogies of Moran populations. We consider the associated process of total external tree length of the evolving Kingman…
We consider an evolving preferential attachment random graph model where at discrete times a new node is attached to an old node, selected with probability proportional to a superlinear function of its degree. For such schemes, it is known…
We analyze the crystallization and collapse transition of a simple model for flexible polymer chains on simple cubic and face-centered cubic lattices by means of sophisticated chain-growth methods. In contrast to bond-fluctuation polymer…
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…
Lattice growth models where uncorrelated random deposition competes with some aggregation dynamics that generates correlations are studied with rates of the correlated component decreasing as a power law. These models have anomalous…
We consider a class of reinforcement processes, called WARMs, on tree graphs. These processes involve a parameter $\alpha$ which governs the strength of the reinforcement, and a collection of Poisson processes indexed by the vertices of the…
We consider maps which are constructed from plane trees by assigning marks to the corners of each vertex and then connecting each pair of consecutive marks on their contour by a single edge. A measure is defined on the set of such maps by…
We consider growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…
We study a discrete model of an heterogeneous elastic line with internal disorder, submitted to thermal fluctuations. The monomers are connected through random springs with independent and identically distributed elastic constants drawn…