Related papers: Critical beta-splitting, via contraction
We consider a multitype branching process with immigration in a random environment introduced by Key in [Ann. Probab. 15 (1987) 344--353]. It was shown by Key that, under the assumptions made in [Ann. Probab. 15 (1987) 344--353], the…
The Aldous--Broder algorithm provides a way of sampling a uniformly random spanning tree for finite connected graphs using simple random walk. Namely, start a simple random walk on a connected graph and stop at the cover time. The tree…
We study maximal clades in random phylogenetic trees with the Yule-Harding model or, equivalently, in binary search trees. We use probabilistic methods to reprove and extend earlier results on moment asymptotics and asymptotic normality. In…
We consider a random tree and introduce a metric in the space of trees to define the ``mean tree'' as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of large numbers and…
Decision trees are widely used for non-linear modeling, as they capture interactions between predictors while producing inherently interpretable models. Despite their popularity, performing inference on the non-linear fit remains largely…
Let ${\cal T}$ be a rooted Galton-Watson tree with offspring distribution $\{p_k\}$ that has $p_0=0$, mean $m=\sum kp_k>1$ and exponential tails. Consider the $\lambda$-biased random walk $\{X_n\}_{n\geq 0}$ on ${\cal T}$; this is the…
We establish effective convergence rates in the Doeblin-Lenstra law, describing the limiting distribution of approximation coefficients arising from continued fraction convergents of a typical real number. More generally, we prove…
Consider a stochastic process that behaves as a $d$-dimensional simple and symmetric random walk, except that, with a certain fixed probability, at each step, it chooses instead to jump to a given site with probability proportional to the…
The $q=2$ random cluster model is studied in the context of two mean field models: The Bethe lattice and the complete graph. For these systems, the critical exponents that are defined in terms of finite clusters have some anomalous values…
A symbolic-computational algorithm, fully implemented in Maple, is described, that computes explicit expressions for generating functions that enable the efficient computations of the expectation, variance, and higher moments, of the random…
Generating function equation has been derived for the probability distribution of the number of nodes with $k \ge 0$ outgoing lines in randomly evolving special trees. The stochastic properties of end-nodes (k=0) have been analyzed, and it…
We derive a central limit theorem for the probability distribution of the sum of many critically correlated random variables. The theorem characterizes a variety of different processes sharing the same asymptotic form of anomalous scaling…
In the 1960's, Birch proved that the traces of Frobenius for elliptic curves taken at random over a large finite field is modeled by the semicircular distribution (i.e. the usual Sato-Tate for non-CM elliptic curves). In analogy with…
Fractal scaling--a power-law behavior of the number of boxes needed to tile a given network with respect to the lateral size of the box--is studied. We introduce a new box-covering algorithm that is a modified version of the original…
We prove an invariance principle for a general class of continuous time critical branching processes with finite variance (non-local) branching mechanism. We show that the genealogical trees, viewed as random compact metric measure spaces,…
We consider simple random walk on a realization of an Erd\H{o}s-R\'enyi graph that is asymptotically almost surely (a.a.s.) connected. We show a Central Limit Theorem (CLT) for the average starting hitting time, i.e. the expected time it…
We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…
A controlled branching process (CBP) is a modification of the standard Bienaym\'e-Galton-Watson process in which the number of progenitors in each generation is determined by a random mechanism. We consider a CBP starting from a random…
A central limit theorem is established for a sum of random variables belonging to a sequence of random fields. The fields are assumed to have zero mean conditional on the past history and to satisfy certain conditional $\alpha$-mixing…
Drees and Rootz\'en [2010] have proven central limit theorems (CLT) for empirical processes of extreme values cluster functionals built from $\beta$-mixing processes. The problem with this family of $\beta$-mixing processes is that it is…