Related papers: Anomalous scaling in an age-dependent branching mo…
We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on…
We have analysed the possibility of scaling the sexual Penna ageing model. Assuming that the number of genes expressed before the reproduction age grows linearly with the genome size and that the mutation rate per genome and generation is…
We analyse the scaling of the weights added by invasion percolation on a branching process tree. This process is a paradigm model of self-organised criticality, where criticality is approach without a prespecified parameter. In this paper,…
The Yule branching process is a classical model for the random generation of gene tree topologies in population genetics. It generates binary ranked trees -- also called "histories" -- with a finite number $n$ of leaves. We study the…
The Yule-Harding-Kingman (YHK) model and the proportional to distinguishable arrangements (PDA) model are two binary tree generating models that are widely used in evolutionary biology. Understanding the distributions of clade sizes under…
The scaling exponent $\alpha$ in neural scaling laws $L(N) \propto N^{-\alpha}$ is commonly treated as a fixed constant set by architecture and data. We present evidence that $\alpha$ depends systematically on the optimizer. In controlled…
This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a…
We generalize recent results of Haas and Miermont to obtain scaling limits of Markov branching trees whose size is specified by the number of nodes whose out-degree lies in a given set. We then show that this implies that the scaling limit…
We study the asymptotics of the $p$-mapping model of random mappings on $[n]$ as $n$ gets large, under a large class of asymptotic regimes for the underlying distribution $p$. We encode these random mappings in random walks which are shown…
Panagiotou and Stufler (arXiv:1502.07180v2) recently proved one important fact on their way to establish the scaling limits of random P\'{o}lya trees: a uniform random P\'{o}lya tree of size $n$ consists of a conditioned critical…
A nested family of growing or shrinking planar domains is called a Laplacian growth process if the normal velocity of each domain's boundary is proportional to the gradient of the domain's Green function with a fixed singularity on the…
We consider a branching random walk (BRW) taking its values in the $\mathtt{b}$-ary rooted tree $\mathbb W_{ \mathtt{b}}$ (i.e. the set of finite words written in the alphabet $\{ 1, \ldots, \mathtt{b} \}$, with $\mathtt{b}\! \geq \! 2$).…
The decay timescales of the quasinormal modes of a massive scalar field have an intriguing behavior: they either grow or decay with increasing angular harmonic numbers $\ell$, depending on whether the mass of the scalar field is small or…
Let $\tau$n be a random tree distributed as a Galton-Watson tree with geometric offspring distribution conditioned on {Zn = an} where Zn is the size of the n-th generation and (an, n $\in$ N *) is a deterministic positive sequence. We study…
By introducing a new measure for the infinite Galton-Watson process and providing estimates for (discrete) Green's functions on trees, we establish the asymptotic behavior of the capacity of critical branching random walks: in high…
In this paper we study a variation of the accessibility percolation model, this is also motivated by evolutionary biology and evolutionary computation. Consider a tree whose vertices are labeled with random numbers. We study the probability…
We study branching random walks on Cayley graphs. A first result is that the trace of a transient branching random walk on a Cayley graph is a.s. transient for the simple random walk. In addition, it has a.s. critical percolation…
The tree-depth is a parameter introduced under several names as a measure of sparsity of a graph. We compute asymptotic values of the tree-depth of random graphs. For dense graphs, p>> 1/n, the tree-depth of a random graph G is a.a.s.…
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p=n^{-alpha} and alpha=alpha(n) is bounded away from 0. We show…
A tentative scaling theory is presented of a tree swaying in a turbulent wind. It is argued that the turbulence of the air within the crown is in the inertial regime. An eddy causes a dynamic bending response of the branches according to a…