Random self-similar trees: A mathematical theory of Horton laws

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Horton Law in Self-Similar Trees

Abstract. Self-similarity of random trees is related to the operation of pruning. Pruning R cuts the leaves and their parental edges and removes the resulting chains of degree-two nodes from a finite tree. A Horton-Strahler order of a vertex v and its parental edge is defined as the minimal number of prunings necessary to eliminate the subtree rooted at v. A branch is a group of neighboring ver...

متن کامل

A Note on the Horton-Strahler Number for Random Trees

We consider the Horton-Strahler number S, for random equiprobable binary trees with n nodes. We give a simple probabilistic proof of the well-known result that ES, = log,n + O(1) and show that for every x > 0, P{ 1 S, log,n ( > x} Q D/4x, for some constant D > 0.

متن کامل

Self-similar solutions‎ ‎of the Riemann problem for two-dimensional systems of conservation‎ ‎laws

In this paper, a new approach is applied to study the self-similar solutions of 2×2 systems of nonlinear hyperbolic conservation laws. A notion of characteristic directions is introduced and then used to construct local and smooth solutions of the associated Riemann problem

متن کامل

Asymptotic laws for nonconservative self-similar fragmentations

We consider a self-similar fragmentation process in which the generic particle of mass x is replaced by the offspring particles at probability rate x, with positive parameter α. The total of offspring masses may be both larger or smaller than x with positive probability. We show that under certain conditions the typical mass in the ensemble is of the order t and that the empirical distribution ...

متن کامل

Self–Similar Perturbation Theory

A method is suggested for treating those complicated physical problems for which exact solutions are not known but a few approximation terms of a calculational algorithm can be derived. The method permits one to answer the following rather delicate questions: What can be said about the convergence of the calculational procedure when only a few its terms are available and how to decide which of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Probability Surveys

سال: 2020

ISSN: 1549-5787

DOI: 10.1214/19-ps331