one of the most visible aspects of a forest stand structure is the spatial patterns of trees. competition affects on forest structure and its understanding is important, when the purpose of forest management is to imitate the dynamic of natural ecosystems. for this purpose, an unmanaged intact forest was selected with 26 hectares area. all chestnut leaf oak (quercus castaneifolia) trees with a ...

In this paper we derive a limit theorem for recursively defined processes. For several instances of recursive processes like for depth first search processes in random trees with logarithmic height or for fractal processes it turns out that convergence can not be expected in the space of continuous functions or in the Skorohod space D. We therefore weaken the Skorohod topology and establish a c...

A split tree of cardinality $n$ is constructed by distributing balls in a subset vertices an infinite which encompasses many types random trees such as $m$-ary search trees, quad median-of-$(2k+1)$ fringe-balanced digital and simplex trees. In this work, we study Bernoulli bond percolation on arbitrary large but finite $n$. We show for appropriate regimes that depend the there exists unique gia...

Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e., labellings of the nodes by distinct integers of the set {1, . . . , n} in such a way that each sequence of labels along any branch starting at the root is increasing. Three such tree families are of particular interest: recurs...

Abstract In this work we analyse bucket increasing tree families. We introduce two simple stochastic growth processes, generating random trees of size n , complementing the earlier result Mahmoud and Smythe (1995, Theoret. Comput. Sci. 144 221–249.) for recursive trees. On combinatorial side, define multilabelled generalisations families d -ary generalised plane-oriented Additionally, a cluster...

Bona [6] studied the distribution of ascents, plateaux and descents in the class of Stirling permutations, introduced by Gessel and Stanley [14]. Recently, Janson [18] showed the connection between Stirling permutations and plane recursive trees and proved a joint normal law for the parameters considered by Bona. Here we will consider generalized Stirling permutations extending the earlier resu...

Evolutionary Algorithms (EAs) are successfully applied for optimization in discrete search spaces, but theory is still weak in particular for population-based EAs. Here, a first rigorous analysis of the (μ+1) EA on pseudo-Boolean functions is presented. For three example functions well-known from the analysis of the (1+1) EA, bounds on the expected runtime and success probability are derived. F...