Results 31 to 40 of about 2,453,886 (301)
Parking on a Random Tree [PDF]
Journal of Statistical Physics, 2008 Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability distribution with generating function G(s). We consider the following variation of Renyi's parking problem, alternatively called blocking RSA: at every vertex of the tree a particle (or car) arrives with rate one.
Dehling, H. G. +2 more
openaire +4 more sources
Random effects regression trees for the analysis of INVALSI data [PDF]
, 2021 Mixed or multilevel models exploit random effects to deal with hierarchical data, where statistical units are clustered in groups and cannot be assumed as independent.
Carla Rampichini +7 more
core +1 more source
Concentration Properties of Extremal Parameters in Random Discrete Structures [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 The purpose of this survey is to present recent results concerning concentration properties of extremal parameters of random discrete structures. A main emphasis is placed on the height and maximum degree of several kinds of random trees. We also provide
Michael Drmota
doaj +1 more source
Discrete Applied Mathematics, 2019 Let $T$ be a random tree taken uniformly at random from the family of labelled trees on $n$ vertices. In this note, we provide bounds for $c(n)$, the number of sub-trees of $T$ that hold asymptotically almost surely. With computer support we show that $1.41805386^n \le c(n) \le 1.41959881^n$. Moreover, there is a strong indication that, in fact, $c(n) \
Bogumil Kaminski, Pawel Pralat
openaire +2 more sources
Specific Random Trees for Random Forest
IEICE Transactions on Information and Systems, 2013 Zhi Liu, Hongjun Wang
exaly +4 more sources
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 +3 more sources
The clustering coefficient of a scale-free random graph [PDF]
, 2009 We consider a random graph process in which, at each time step, a new vertex is added with m out-neighbours, chosen with probabilities proportional to their degree plus a strictly positive constant.
Eggemann, N, Noble, S D
core +6 more sources
Trees with product-form random weights [PDF]
Discrete 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]
, 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
On the Zagreb index of random m-oriented recursive trees [PDF]
Transactions on Combinatorics, 2023 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