Results 51 to 60 of about 5,474,085 (350)
Random Recursive Trees and Preferential Attachment Trees are Random Split Trees [PDF]
We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree and the standard preferential attachment tree.
openaire +3 more sources
On the Zagreb index of random m-oriented recursive trees [PDF]
The main goal of this paper is to study the modified $F$-indices (modified first Zagreb index and modified forgotten topological index) of random $m$-oriented recursive trees (RMORTs).
Ramin Kazemi
doaj +1 more source
Spectral atoms of unimodular random trees [PDF]
We use the Mass Transport Principle to analyze the local recursion governing the resolvent $(A-z)^{-1}$ of the adjacency operator of unimodular random trees.
Justin Salez
semanticscholar +1 more source
Finding interactions between variables in large and high-dimensional datasets is often a serious computational challenge. Most approaches build up interaction sets incrementally, adding variables in a greedy fashion. The drawback is that potentially informative high-order interactions may be overlooked.
Shah, RD, Meinshausen, N
openaire +4 more sources
On the number of transversals in random trees [PDF]
We study transversals in random trees with n vertices asymptotically as n tends to infinity. Our investigation treats the average number of transversals of fixed size, the size of a random transversal as well as the probability that a random subset of ...
Bernhard Gittenberger, Veronika Kraus
doaj +1 more source
Extremely randomized trees [PDF]
This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute and cut-point choice while splitting a tree node. In the extreme case, it builds totally randomized trees whose structures are independent of the output values of the learning sample.
Geurts, Pierre+2 more
openaire +3 more sources
This review discusses the use of Surface‐Enhanced Raman Spectroscopy (SERS) combined with Artificial Intelligence (AI) for detecting antimicrobial resistance (AMR). Various SERS studies used with AI techniques, including machine learning and deep learning, are analyzed for their advantages and limitations.
Zakarya Al‐Shaebi+4 more
wiley +1 more source
A simple and effective approach to quantitatively characterize structural complexity
This study brings insight into interpreting forest structural diversity and explore the classification of individuals according to the distribution of the neighbours in natural forests. Natural forest communities with different latitudes and distribution
Gongqiao Zhang+3 more
doaj +1 more source
The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs [PDF]
One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade (Braunstein et al. in Phys Rev Lett 91(16):168701, 2003; Wu et al.
S. Bhamidi, R. Hofstad, S. Sen
semanticscholar +1 more source
We survey recent developments about random real trees, whose prototype is the Continuum Random Tree (CRT) introduced by Aldous in 1991. We briefly explain the formalism of real trees, which yields a neat presentation of the theory and in particular of the relations between discrete Galton-Watson trees and continuous random trees.
openaire +2 more sources