Results 51 to 60 of about 723,488 (236)
Random Walks in I.I.D. Random Environment on Cayley Trees [PDF]
, 2014 We consider the random walk in an \emph{i.i.d.} random environment on the infinite $d$-regular tree for $d \geq 3$. We consider the tree as a Cayley graph of free product of finitely many copies of $\Zbold$ and $\Zbold_2$ and define the i.i.d ...
Athreya, Siva +2 more
core +1 more source
Intersection of random spanning trees in complex networks
Applied Network Science, 2023 In their previous work, the authors considered the concept of random spanning tree intersection of complex networks (London and Pluhár, in: Cherifi, Mantegna, Rocha, Cherifi, Micciche (eds) Complex networks and their applications XI, Springer, Cham, 2023)
András London, András Pluhár
doaj +1 more source
Mathematics of Operations Research, 1984 A widely used class of binary trees is studied in order to provide information useful in evaluating algorithms based on this storage structure. A closed form counting formula for the number of binary trees with n nodes and height k is developed and restated as a recursion more useful computationally. A generating function for the number of nodes given
Brown, Gerald G., Shubert, Bruno O.
openaire +3 more sources
Multilayer parking with screening on a random tree [PDF]
, 2009 In this paper we present a multilayer particle deposition model on a random tree. We derive the time dependent densities of the first and second layer analytically and show that in all trees the limiting density of the first layer exceeds the density in ...
A. Sudbury +7 more
core +1 more source
Random Recursive Trees and Preferential Attachment Trees are Random Split Trees [PDF]
Combinatorics, Probability and Computing, 2018 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
International Journal of Mathematics and Mathematical Sciences, 2005 The number of local maxima (resp., local minima) in a tree T∈𝒯n rooted at r∈[n] is denoted by Mr(T) (resp., by mr(T)). We find exact formulas as rational functions of n for the expectation and variance of M1(T) and mn(T) when T∈𝒯n is chosen randomly ...
Lane Clark
doaj +1 more source
Journal of Machine Learning Research, 2013 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
Extremely randomized trees [PDF]
Machine Learning, 2006 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
Spatial patterns and intra-specific competition of Chestnut-leaved oak (Quercus castaneifolia C. A. Mey.) using O- ring statistic (Case study: Neka Forest, Iran) [PDF]
تحقیقات جنگل و صنوبر ایران, 2015 The spatial patterns of trees in different stages of their life provide important information related to forest regeneration and succession processes.
Farideh Omidvar Hosseini +3 more
doaj +1 more source
Random hyperplane search trees in high dimensions
Journal of Computational Geometry, 2015 Given a set S of n ≥ d points in general position in Rd, a random hyperplane split is obtained by sampling d points uniformly at random without replacement from S and splitting based on their affine hull. A random hyperplane search tree is a binary space
Luc Devroye, James King
doaj +1 more source