Markovian growth-fragmentation processes introduced in [8,9] extend the pure-fragmentation model by allowing the fragments to grow larger or smaller between dislocation events. What becomes of the known asymptotic behaviors of self-similar pure fragmentations [6,11,12,14] when growth is added to the fragments is a natural question that we investigate in this paper. Our results involve the terminal value of some additive martingales whose uniform integrability is an essential requirement. Dwelling first on the homogeneous case [8], we exploit the connection with branching random walks and in particular the martingale convergence of Biggins [18,19] to derive precise asymptotic estimates. The self-similar case [9] is treated in a second part; under the so called Malthusian hypotheses and with the help of several martingale-flavored features recently developed in [10], we obtain limit theorems for empirical measures of the fragments.
In this paper we study the number of key exchanges required by Hoare's FIND algorithm (also called Quickselect) when operating on a uniformly distributed random permutation and selecting an independent uniformly distributed rank. After normalization we give a limit theorem where the limit law is a perpetuity characterized by a recursive distributional equation. To make the limit theorem usable for statistical methods and statistical experiments we provide an explicit rate of convergence in the Kolmogorov-Smirnov metric, a numerical table of the limit law's distribution function and an algorithm for exact simulation from the limit distribution. We also investigate the limit law's density. This case study provides a program applicable to other cost measures, alternative models for the rank selected and more balanced choices of the pivot element such as median-of-2t+1 versions of Quickselect as well as further variations of the algorithm.MSC2010: 60F05, 68P10, 60C05, 68Q25.
We provide explicit conditions, in terms of the transition kernel of its driving particle, for a Markov branching process to admit a scaling limit toward a self-similar growth-fragmentation with negative index. We also derive a scaling limit for the genealogical embedding considered as a compact real tree.
We study the limit, as the dimension goes to infinity, of the moments of the Hilbert-Schmidt norm of a uniformly distributed matrix in the p-Schatten ball, with entries in the real, complex or quaternionic field. We also consider the restriction to the space of self-adjoint matrices. We build on the connection with spectral asymptotics of β-ensembles to adapt some fluctuation results due to Bekerman, Leblé and Serfaty [8]. When p > 3, this allows us to obtain the next asymptotic order for ratios of q-inertia moments of p-Schatten balls of self-adjoint matrices, and to establish a strong version of the variance conjecture for these families of convex bodies.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.