The aim is to develop the methods for investigation of the random forestes, to obtain the total description on the limit behaviour of the most important characteristics of the random forestes. The total description on the limit behaviour of the maximal tree volume, number of the given volume trees and height of the random forestes has been obtained. Application field: solution of probabilistic problem in discrete mathematics, study of limit properties in random representations and branching processes.Available from VNTIC / VNTIC - Scientific & Technical Information Centre of RussiaSIGLERURussian Federatio
International audienceThis book offers an application-oriented guide to random forests: a statistica...
Let F(N, m) denote a random forest on a set of N vertices, chosen uniformly from all forests with m ...
Random forests are a scheme proposed by Leo Breiman in the 2000’s for building a predictor ensemble ...
AbstractThe analytic methods of Pólya, as reported in [1, 6] are used to determine the asymptotic be...
We investigate scaling limits of several types of random trees. The study of scaling limits of rand...
The last decade has witnessed a growing interest in random forest models which are recognized to exh...
We consider the set Fn,N of all possible forests, consisting of N≥2 ordered non-root trees and labe...
We explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits f...
The purpose of this survey is to present recent results concerning concentration properties of extre...
We study a model of random R-enriched trees that is based on weights on the R-structures and allows ...
International audienceIn this paper we present a study on the Random Forest (RF) family of classific...
In this paper several limit theorems are proved for the fluctuations of the queue size during the in...
Random forests are a very effective and commonly used statistical method, but their full theoretical...
AbstractThe problem is considered of determining the distribution of the number of nodes in any give...
Random forests are studied. A moment inequality and a strong law of large numbers are obtained for t...
International audienceThis book offers an application-oriented guide to random forests: a statistica...
Let F(N, m) denote a random forest on a set of N vertices, chosen uniformly from all forests with m ...
Random forests are a scheme proposed by Leo Breiman in the 2000’s for building a predictor ensemble ...
AbstractThe analytic methods of Pólya, as reported in [1, 6] are used to determine the asymptotic be...
We investigate scaling limits of several types of random trees. The study of scaling limits of rand...
The last decade has witnessed a growing interest in random forest models which are recognized to exh...
We consider the set Fn,N of all possible forests, consisting of N≥2 ordered non-root trees and labe...
We explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits f...
The purpose of this survey is to present recent results concerning concentration properties of extre...
We study a model of random R-enriched trees that is based on weights on the R-structures and allows ...
International audienceIn this paper we present a study on the Random Forest (RF) family of classific...
In this paper several limit theorems are proved for the fluctuations of the queue size during the in...
Random forests are a very effective and commonly used statistical method, but their full theoretical...
AbstractThe problem is considered of determining the distribution of the number of nodes in any give...
Random forests are studied. A moment inequality and a strong law of large numbers are obtained for t...
International audienceThis book offers an application-oriented guide to random forests: a statistica...
Let F(N, m) denote a random forest on a set of N vertices, chosen uniformly from all forests with m ...
Random forests are a scheme proposed by Leo Breiman in the 2000’s for building a predictor ensemble ...
Add to ORKG