Results 1 to 10 of about 2,921,645 (302)
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).
Rafael Blanquero +3 more
openaire +4 more sources
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.
Benjamini, Itai +2 more
openaire +3 more sources
The degree variance and geometric degree variance of random trees [PDF]
Journal of Mahani Mathematical ResearchThe degree variance and the geometric mean of the degrees of the vertices for graph $G$ are defined as $\text{Var}(G)=\frac{1}{n}\sum_{i=1}^{n}\Big(d(v_i)-\frac{2m}{n} \Big)^2$ and $\text{GM}(G)=\Big(\prod_{i=1}^{n}d(v_i)\Big)^\frac{1}{
Ramin Kazemi
doaj +1 more source
Simply generated trees, conditioned Galton―Watson trees, random allocations and condensation: Extended abstract [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 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
Journal of Statistical Mechanics: Theory and Experiment, 2010 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]
Discrete Mathematics & Theoretical Computer Science, 2019 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]
Combinatorics, Probability and Computing, 2021 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]
Jisuanji gongcheng, 2016 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
J. Mach. Learn. Res., 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
CLASSIFICATION OF ORCHARD CROP USING SENTINEL-1A SYNTHETIC APERTURE RADAR DATA [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2018 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