Related papers: A growth model in a random environment
In this paper, we study inference for high-dimensional data characterized by small sample sizes relative to the dimension of the data. In particular, we provide an infinite-dimensional framework to study statistical models that involve…
We propose a simple, exactly solvable, model of interface growth in a random medium that is a variant of the zero-temperature random-field Ising model on the Cayley tree. This model is shown to have a phase diagram (critical depinning field…
Zipf's power law is a general empirical regularity found in many natural and social systems. A recently developed theory predicts that Zipf's law corresponds to systems that are growing according to a maximally sustainable path in the…
Scale-free power law structure describes complex networks derived from a wide range of real world processes. The extensive literature focuses almost exclusively on networks with power law exponent strictly larger than 2, which can be…
The dynamics of fluctuating radially growing interfaces is approached using the formalism of stochastic growth equations on growing domains. This framework reveals a number of dynamic features arising during surface growth. For fast growth,…
The two-time distribution gives the limiting joint distribution of the heights at two different times of a local 1D random growth model in the curved geometry. This distribution has been computed in a specific model but is expected to be…
In this paper we introduce a model of spatial network growth in which nodes are placed at randomly selected locations on a unit square in $\mathbb{R}^2$, forming new connections to old nodes subject to the constraint that edges do not…
A one-dimensional cellular automaton with a probabilistic evolution rule can generate stochastic surface growth in $(1 + 1)$ dimensions. Two such discrete models of surface growth are constructed from a probabilistic cellular automaton…
We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…
We propose a new, direct, correlation-free approach based on central moments of profiles to the asymptotics of width (size of the most abundant level) in some random trees of logarithmic height. The approach is simple but gives precise…
We present the microscopic equation of growing interface with quenched noise for the Tang and Leschhorn model [{\em Phys. Rev.} {\bf A 45}, R8309 (1992)]. The evolution equations for the mean heigth and the roughness are reached in a simple…
A condition is given, under which a general lattice point counting function is asymptotic to the corresponding ball volume growth function. This is then used to give height asymptotics in the style of the Batyrev-Manin Conjecture for…
We study here a standard next-nearest-neighbor (NNN) model of ballistic growth on one- and two-dimensional substrates focusing our analysis on the probability distribution function $P(M,L)$ of the number $M$ of maximal points (i.e., local…
We present a one-parameter extension of the raise and peel one-dimensional growth model. The model is defined in the configuration space of Dyck (RSOS) paths. Tiles from a rarefied gas hit the interface and change its shape. The adsorption…
We study a single, motionless three-dimensional droplet growing by adsorption of diffusing monomers on a 2D substrate. The diffusing monomers are adsorbed at the aggregate perimeter of the droplet with different boundary conditions. Models…
We introduce a two-dimensional growth model where every new site is located, at a distance $r$ from the barycenter of the pre-existing graph, according to the probability law $1/r^{2+\alpha_G} (\alpha_G \ge 0)$, and is attached to (only)…
A growing random graph is constructed by successively sampling without replacement an element from the pool of virtual vertices and edges. At start of the process the pool contains $N$ virtual vertices and no edges. Each time a vertex is…
The preferential attachment model is a natural and popular random graph model for a growing network that contains very well-connected ``hubs''. We study the higher-order connectivity of such a network by investigating the topological…
We study network growth from a fixed set of initially isolated nodes placed at random on the surface of a sphere. The growth mechanism we use adds edges to the network depending on strictly local gain and cost criteria. Only nodes that are…
The Airy distribution function describes the probability distribution of the area under a Brownian excursion over a unit interval. Surprisingly, this function has appeared in a number of seemingly unrelated problems, mostly in computer…