Results 31 to 40 of about 5,579,561 (370)
Random Trees in Random Graphs [PDF]
Proceedings of the American Mathematical Society, 1988 We show that a random labeled n n -vertex graph almost surely contains isomorphic copies of almost all labeled n n -vertex trees, in two senses. In the first sense, the probability of each edge occurring in the graph diminishes as n n increases, and the set of trees referred to as "almost all" depends
Nicholas C. Wormald, Edward A. Bender
openaire +2 more sources
Optimal randomized classification trees [PDF]
Computers & Operations Research, 2021 This research has been financed in part by research projects EC H2020 MSCA RISE NeEDS (Grant agreement ID: 822214), FQM-329 and P18-FR-2369 (Junta de Andaluc\'ia), and PID2019-110886RB-I00 (Ministerio de Ciencia, Innovaci\'on y Universidades, Spain).
Blanquero, Rafael +3 more
openaire +4 more sources
A Heuristic Rapidly-Exploring Random Trees Method for Manipulator Motion Planning
IEEE Access, 2020 In order to plan the robot path in 3D space efficiently, a modified Rapidly-exploring Random Trees based on heuristic probability bias-goal (PBG-RRT) is proposed.
Chengren Yuan +4 more
semanticscholar +1 more source
Fragmentation of random trees [PDF]
Journal of Physics A: Mathematical and Theoretical, 2014 We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected existing node. As nodes are removed from the tree, one at a time, the tree dissolves into an ensemble of separate trees,
Kalay, Z, Ben-Naim, E
openaire +4 more sources
Distribution of inter-node distances in digital trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We investigate distances between pairs of nodes in digital trees (digital search trees (DST), and tries). By analytic techniques, such as the Mellin Transform and poissonization, we describe a program to determine the moments of these distances.
Rafik Aguech +2 more
doaj +1 more source
Coronary Artery Disease Diagnosis: Ranking the Significant Features Using Random Trees Model
, 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 a common cardiovascular disease with a high death rate.
Javad Hassannataj Joloudari +8 more
semanticscholar +1 more source
The continuous limit of large random planar maps [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We discuss scaling limits of random planar maps chosen uniformly over the set of all $2p$-angulations with $n$ faces. This leads to a limiting space called the Brownian map, which is viewed as a random compact metric space.
Jean-François Le Gall
doaj +1 more source
Topological indices for random spider trees
Main Group Metal Chemistry, 2023 In this study, we characterize the structure and some topological indices of a class of random spider trees (RSTs) such as degree-based Gini index, degree-based Hoover index, generalized Zagreb index, and other indices associated with these.
Sigarreta Saylé +2 more
doaj +1 more source
Ergodic Theory and Dynamical Systems, 2013 AbstractWe consider unimodular random rooted trees (URTs) and invariant forests in Cayley graphs. We show that URTs of bounded degree are the same as the law of the component of the root in an invariant percolation on a regular tree. We use this to give a new proof that URTs are sofic, a result of Elek.
Oded Schramm +2 more
openaire +3 more sources
Classification Under Streaming Emerging New Classes: A Solution Using Completely-Random Trees [PDF]
IEEE Transactions on Knowledge and Data Engineering, 2016 This paper investigates an important problem in stream mining, i.e., classification under streaming emerging new classes or SENC. The SENC problem can be decomposed into three subproblems: detecting emerging new classes, classifying known classes, and ...
Xin Mu, K. Ting, Zhi-Hua Zhou
semanticscholar +1 more source