Results 31 to 40 of about 2,906,539 (296)

Trees with product-form random weights [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2006
We consider growing random recursive trees in random environment, in which at each step a new vertex is attached according to a probability distribution that assigns the tree vertices masses proportional to their random weights.The main aim of the paper ...
Konstantin Borovkov, Vladimir Vatutin
doaj   +1 more source

Bias in Random Forest Variable Importance Measures: Illustrations, Sources and a Solution [PDF]

open access: yes, 2006
Variable importance measures for random forests have been receiving increased attention as a means of variable selection in many classification tasks in bioinformatics and related scientific fields, for instance to select a subset of genetic markers ...
Zeileis, Achim   +11 more
core   +1 more source

Fragmentation of random trees [PDF]

open access: yesJournal 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   +3 more sources

On the number of transversals in random trees [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
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

Uncovering a Random Tree.

open access: yes, 2022
We consider the process of uncovering the vertices of a random labeled tree according to their labels. First, a labeled tree with n vertices is generated uniformly at random. Thereafter, the vertices are uncovered one by one, in order of their labels. With each new vertex, all edges to previously uncovered vertices are uncovered as well.
Benjamin Hackl   +2 more
openaire   +4 more sources

The height of random binary unlabelled trees [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a central and local
Nicolas Broutin, Philippe Flajolet
doaj   +1 more source

Optimal randomized classification trees [PDF]

open access: yesComputers & 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

Unimodular random trees [PDF]

open access: yesErgodic 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

Election algorithms with random delays in trees [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2009
The election is a classical problem in distributed algorithmic. It aims to design and to analyze a distributed algorithm choosing a node in a graph, here, in a tree. In this paper, a class of randomized algorithms for the election is studied.
Jean-François Marckert   +2 more
doaj   +1 more source

Simply generated trees, conditioned Galton―Watson trees, random allocations and condensation: Extended abstract [PDF]

open access: yesDiscrete 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

Home - About - Disclaimer - Privacy