Related papers: Growing random planar network with oriented branch…
We consider a general class of branching processes in discrete time, where particles have types belonging to a Polish space and reproduce independently according to their type. If the process is critical and the mean distribution of types…
We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and…
A construction as a growth process for sampling of the uniform infinite planar triangulation (UIPT), defined in a previous paper, is given. The construction is algorithmic in nature, and is an efficient method of sampling a portion of the…
In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust trees overlay. Our key result can be stated as follows. Consider a…
We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle…
Experimentally monitoring the kinematics of branching network growth is a tricky task, given the complexity of the structures generated in three dimensions. One option is to drive the network in such a way as to obtain two-dimensional…
A model for growing information networks is introduced where nodes receive new links through j-redirection, i.e. the probability for a node to receive a link depends on the number of paths of length j arriving at this node. In detail, when…
The organizational development of growing random networks is investigated. These growing networks are built by adding nodes successively and linking each to an earlier node of degree k with attachment probability A_k. When A_k grows slower…
A single axon can generate branches connecting with plenty synaptic targets. Process of branching is very important for making connections in central nervous system. The interstitial branching along primary axon shaft occurs during nervous…
We consider a class of continuous-time stochastic growth models on $d$-dimensional lattice with non-negative real numbers as possible values per site. The class contains examples such as binary contact path process and potlatch process. We…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
We consider a Markov evolution of lozenge tilings of a quarter-plane and study its asymptotics at large times. One of the boundary rays serves as a reflecting wall. We observe frozen and liquid regions, prove convergence of the local…
Consider a branching Markov process with values in some general type space. Conditional on survival up to generation $N$, the genealogy of the extant population defines a random marked metric measure space, where individuals are marked by…
Granular convergence is a property of a granular pack as it is repeatedly sheared in a cyclic, quasistatic fashion, as the packing configuration changes via discrete events. Under suitable conditions the set of microscopic configurations…
We provide sufficient conditions for polynomial rate of convergence in the weak law of large numbers for supercritical general indecomposable multi-type branching processes. The main result is derived by investigating the embedded…
The spread of infectious disease in a human community or the proliferation of fake news on social media can be modeled as a randomly growing tree-shaped graph. The history of the random growth process is often unobserved but contains…
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…
We study branching Markov chains on a countable state space (space of types) $\mathscr{X}$, with the focus on the qualitative aspects of the limit behaviour of the evolving empirical population distributions. No conditions are imposed on…
We investigate the growth of needles from a flat substrate. We focus on the situation when needles suddenly begin to grow from the seeds randomly distributed on the line. The width of needles is ignored and we additionally assume that (i)…
For many random graph models, the analysis of a related birth process suggests local sampling algorithms for the size of, e.g., the giant connected component, the $k$-core, the size and probability of an epidemic outbreak, etc. In this…