相关论文: The size of random fragmentation trees
We study a random tree, which was introduced by Ajazi et al. as part of a model of a neuronal network. Realising a scaling relation for the law of the tree, we can use elementary techniques to derive asymptotic results on the geometry as…
We define and study a model of winding for non-colliding particles in finite trees. We prove that the asymptotic behavior of this statistic satisfies a central limiting theorem, analogous to similar results on winding of bounded particles…
We study various types of consistency of honest decision trees and random forests in the regression setting. In contrast to related literature, our proofs are elementary and follow the classical arguments used for smoothing methods. Under…
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…
We propose a stochastic model of a fragmentation process, developed by taking into account fragment lifetime as a function of their size based on the Gibrat process. If lifetime is determined by a power function of fragment size, numerical…
We study the abelian sandpile model on a random binary tree. Using a transfer matrix approach introduced by Dhar & Majumdar, we prove exponential decay of correlations, and in a small supercritical region (i.e., where the branching process…
We consider the branching process in random environment $\{Z_n\}_{n\geq 0}$, which is a~population growth process where individuals reproduce independently of each other with the reproduction law randomly picked at each generation. We…
We consider fragmentations of an R-tree $T$ driven by cuts arriving according to a Poisson process on $T \times [0, \infty)$, where the first co-ordinate specifies the location of the cut and the second the time at which it occurs. The…
We develop some theory of spinal decompositions of discrete and continuous fragmentation trees. Specifically, we consider a coarse and a fine spinal integer partition derived from spinal tree decompositions. We prove that for a…
We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…
Metabolites, small molecules that are involved in cellular reactions, provide a direct functional signature of cellular state. Untargeted metabolomics experiments usually relies on tandem mass spectrometry to identify the thousands of…
We prove an asymptotic Edgeworth expansion for the profiles of certain random trees including binary search trees, random recursive trees and plane-oriented random trees, as the size of the tree goes to infinity. All these models can be…
We study a linear-fractional Bienaym\'e-Galton-Watson process with a general type space. The corresponding tree contour process is described by an alternating random walk with the downward jumps having a geometric distribution. This leads…
The properties of randomly evolving special trees having defined and analyzed already in two earlier papers (arXiv:cond-mat/0205650 and arXiv:cond-mat/0211092) have been investigated in the case when the continuous time parameter converges…
We give the asymptotic distribution of the length of partial coalescent trees for Beta and related coalescents. This allows us to give the asymptotic distribution of the number of (neutral) mutations in the partial tree. This is a first…
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…
We introduce a very general model of an inhomogenous random graph with independence between the edges, which scales so that the number of edges is linear in the number of vertices. This scaling corresponds to the p=c/n scaling for G(n,p)…
We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…
A statistical model of fragmentation of aggregates is proposed, based on the stochastic propagation of cracks through the body. The propagation rules are formulated on a lattice and mimic two important features of the process -- a crack…
We present a minimal dynamical model for randomly branched isotropic polymers, and we study this model in the framework of renormalized field theory. For the swollen phase, we show that our model provides a route to understand the well…