Results 1 to 10 of about 5,579,561 (370)
Tree limits and limits of random trees [PDF]
Combinatorics, Probability and Computing, 2020 We 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 branching
S. Janson
arxiv +9 more sources
Development of an Improved Rapidly Exploring Random Trees Algorithm for Static Obstacle Avoidance in Autonomous Vehicles. [PDF]
Sensors (Basel), 2021 Safe path planning for obstacle avoidance in autonomous vehicles has been developed. Based on the Rapidly Exploring Random Trees (RRT) algorithm, an improved algorithm integrating path pruning, smoothing, and optimization with geometric collision ...
Yang SM, Lin YA.
europepmc +2 more sources
Coronary Artery Disease Diagnosis; Ranking the Significant Features Using a Random Trees Model. [PDF]
Int J Environ Res Public Health, 2020 Heart disease is one of the most common diseases in middle-aged citizens. Among the vast number of heart diseases, coronary artery disease (CAD) is considered as a common cardiovascular disease with a high death rate. The most popular tool for diagnosing
Joloudari JH +8 more
europepmc +3 more sources
Predicting the Pillar Stability of Underground Mines with Random Trees and C4.5 Decision Trees
Applied Sciences, 2020 Predicting pillar stability in underground mines is a critical problem because the instability of the pillar can cause large-scale collapse hazards. To predict the pillar stability for underground coal and stone mines, two new models (random tree and C4 ...
Mahmood Ahmad +5 more
doaj +2 more sources
Rooted trees and moments of large sparse random matrices [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 In these expository paper we describe the role of the rooted trees as a base for convenient tools in studies ofrandom matrices. Regarding the Wigner ensemble of random matrices, we represent main ingredients ofthis approach.
Oleksiy Khorunzhiy
doaj +2 more sources
Protected nodes and fringe subtrees in some random trees [PDF]
arXiv, 2013 We study protected nodes in various classes of random rooted trees by putting them in the general context of fringe subtrees introduced by Aldous (1991). Several types of random trees are considered: simply generated trees (or conditioned Galton-Watson trees), which includes several cases treated separately by other authors, binary search trees and ...
L. Devroye, S. Janson
arxiv +3 more sources
Critical Random Walk in Random Environment on Trees of Exponential Growth [PDF]
Proc. Sem. Stoch. Pro. 1992, Burdzy and Bass, editors, 221 - 240
(1993), 2004 This paper studies the behavior of RWRE on trees in the critical case left open in previous work. For trees of exponential growth, a random perturbation of the transition probabilities can change a transient random walk into a recurrent one. This is the opposite of what occurs on trees of sub-exponential growth.
Robin Pemantle
arxiv +3 more sources
optRF: Optimising random forest stability by determining the optimal number of trees [PDF]
BMC BioinformaticsMachine learning is frequently used to make decisions based on big data. Among these techniques, random forest is particularly prominent. Although random forest is known to have many advantages, one aspect that is often overseen is that it is a non ...
Thomas M. Lange +3 more
doaj +2 more sources
Universal height and width bounds for random trees [PDF]
Electronic Journal of Probability, 2021 We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models.
L. Addario-Berry +3 more
semanticscholar +1 more source
Multi-Goal Path Planning Using Multiple Random Trees [PDF]
IEEE Robotics and Automation Letters, 2021 In this letter, we propose a novel sampling-based planner for multi-goal path planning among obstacles, where the objective is to visit predefined target locations while minimizing the travel costs.
Jaroslav Janoš +2 more
semanticscholar +1 more source