Results 41 to 50 of about 258,206 (308)
Simply generated trees, conditioned Galton―Watson trees, random allocations and condensation: Extended abstract [PDF]
We give a unified treatment of the limit, as the size tends to infinity, of random simply generated trees, including both the well-known result in the standard case of critical Galton-Watson trees and similar but less well-known results in the other ...
Svante Janson
doaj +1 more source
We investigate a network growth model in which the genealogy controls the evolution. In this model, a new node selects a random target node and links either to this target node, or to its parent, or to its grandparent, etc; all nodes from the target node to its most ancient ancestor are equiprobable destinations.
Ben-Naim, E., Krapivsky, P. L.
openaire +2 more sources
Expected size of a tree in the fixed point forest [PDF]
We study the local limit of the fixed-point forest, a tree structure associated to a simple sorting algorithm on permutations. This local limit can be viewed as an infinite random tree that can be constructed from a Poisson point process configuration on
Samuel Regan, Erik Slivken
doaj +1 more source
Tree limits and limits of random trees [PDF]
AbstractWe explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits for many classes of random trees. We give general theorems for three classes of conditional Galton–Watson trees and simply generated trees, for split trees and generalized split trees (as defined here), and for trees defined by a continuous-time ...
openaire +3 more sources
Selection of Random Minimum Spanning Tree Based on Intuitionistic Fuzzy Sets [PDF]
To solve the difficulty of selecting nodes for network topology in complex environment,a selection method of random minimum spanning tree based on intuitionistic fuzzy sets is proposed.Through analyzing the uncertainty,like randomness and fuzziness ...
WANG Xiaoxia,YANG Fengbao,YUAN Hua
doaj +1 more source
Improved Random Forest Algorithm Based on Out-of-Bag Prediction and Extended Space [PDF]
On the basis of the bootstrap method, the random forest algorithm constructs a decision tree by using sampling characteristics.This reduces the correlation among decision trees at the expense of decision tree accuracy, thereby improving the prediction ...
CHANG Shuo, ZHANG Yanchun
doaj +1 more source
These notes provide an elementary and self-contained introduction to branching ran- dom walks. Section 1 gives a brief overview of Galton-Watson trees, whereas Section 2 presents the classical law of large numbers for branching random walks. These two short sections are not exactly in- dispensable, but they introduce the idea of using size-biased trees,
openaire +2 more sources
Hausdorff measure of arcs and Brownian motion on Brownian spatial trees [PDF]
A Brownian spatial tree is defined to be a pair $(\mathcal{T},\phi)$, where $\mathcal{T}$ is the rooted real tree naturally associated with a Brownian excursion and φ is a random continuous function from $\mathcal{T}$ into ℝd such that, conditional on ...
Croydon, David A.
core +1 more source
Road traffic accident severity prediction is crucial for implementing effective safety measures and proactive traffic management strategies. Existing methods often treat this as a nominal classification problem and use traditional feature selection ...
Bita Ghasemkhani +3 more
doaj +1 more source
CLASSIFICATION OF ORCHARD CROP USING SENTINEL-1A SYNTHETIC APERTURE RADAR DATA [PDF]
A study was conducted in Saharanpur District of Uttar Pradesh to asses the potential of Sentinel-1A SAR Data in orchard crop classification. The objective of the study was to evaluate three different classifiers that are maximum likelihood classifier ...
H. Sahu, D. Haldar, A. Danodia, S. Kumar
doaj +1 more source

