Related papers: Lifting linear preferential attachment trees yield…
Models based on preferential attachment have had much success in reproducing the power law degree distributions which seem ubiquitous in both natural and engineered systems. Here, rather than assuming preferential attachment, we give an…
Eliciting preferences from human judgements is inherently imprecise, yet most decision analysis methods force a single priority vector from pairwise comparisons, discarding the information embedded in inconsistencies. We instead leverage…
In 1986, Janson showed that the number of edges in the union of $k$ random spanning trees in the complete graph $K_n$ is a shifted Poisson distribution. Using results from the theory of electrical networks, we provide a new proof of this…
We investigate a degree-biased cutting process on random recursive trees, where each vertex is deleted with probability proportional to its degree. We establish the splitting property and derive the explicit distribution of the number of…
Kingman derived the Ewens sampling formula for random partitions describing the genetic variation in a neutral mutation model defined by a Poisson process of mutations along lines of descent governed by a simple coalescent process, and…
We give a new, simple construction of the $\alpha$-stable tree for $\alpha \in (1,2]$. We obtain it as the closure of an increasing sequence of $\mathbb{R}$-trees inductively built by gluing together line-segments one by one. The lengths of…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
We study an asymptotical behavior of the maximal degree in the degree distribution in an evolving tree model combining the local choice and the Mori's preferential attachment. In the considered model, the random graph is constructed in the…
We study the basic preferential attachment process, which generates a sequence of random trees, each obtained from the previous one by introducing a new vertex and joining it to one existing vertex, chosen with probability proportional to…
We study random two-dimensional spanning forests in the plane that can be viewed both in the discrete case and in their appropriately taken scaling limits as a uniformly chosen spanning tree with some Poissonian deletion of edges or points.…
We study scaling limits of non-increasing Markov chains with values in the set of non-negative integers, under the assumption that the large jump events are rare and happen at rates that behave like a negative power of the current state. We…
Uniform attachment with freezing is an extension of the classical model of random recursive trees, in which trees are recursively built by attaching new vertices to old ones. In the model of uniform attachment with freezing, vertices are…
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…
We investigate the statistics of trees grown from some initial tree by attaching links to preexisting vertices, with attachment probabilities depending only on the valence of these vertices. We consider the asymptotic mass distribution that…
We investigate algorithms to find the first vertex in large trees generated by either the uniform attachment or preferential attachment model. We require the algorithm to output a set of $K$ vertices, such that, with probability at least…
Bollob\'as-Riordan random pairing model of a preferential attachment graph $G_m^n$ is studied. Let $\{W_j\}_{j\le mn+1}$ be the process of sums of independent exponentials with mean $1$. We prove that the degrees of the first…
We study preferential attachment mechanisms in random graphs that are parameterized by (i) a constant bias affecting the degree-biased distribution on the vertex set and (ii) the distribution of times at which new vertices are created by…
Phylogenetic trees constitute an interesting class of objects for stochastic processes due to the non-standard nature of the space they inhabit. In particular, many statistical applications require the construction of Markov processes on…
Decision tree learning is increasingly being used for pointwise inference. Important applications include causal heterogenous treatment effects and dynamic policy decisions, as well as conditional quantile regression and design of…
A preferential attachment model for a growing network incorporating deletion of edges is studied and the expected asymptotic degree distribution is analyzed. At each time step $t=1,2,\ldots$, with probability $\pi_1>0$ a new vertex with one…