Results 31 to 40 of about 5,474,085 (350)
Concentration Properties of Extremal Parameters in Random Discrete Structures [PDF]
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
Coronary Artery Disease Diagnosis: Ranking the Significant Features Using Random Trees Model
Heart disease is one of the most common diseases in middle-aged citizens. Among the vast number of heart diseases, coronary artery disease (CAD) is considered a common cardiovascular disease with a high death rate.
Javad Hassannataj Joloudari+8 more
semanticscholar +1 more source
Spreading of Infections on Network Models: Percolation Clusters and Random Trees
We discuss network models as a general and suitable framework for describing the spreading of an infectious disease within a population. We discuss two types of finite random structures as building blocks of the network, one based on percolation concepts
Hector Eduardo Roman, Fabrizio Croccolo
doaj +1 more source
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.
Oded Schramm+2 more
openaire +3 more sources
Classification Under Streaming Emerging New Classes: A Solution Using Completely-Random Trees [PDF]
This paper investigates an important problem in stream mining, i.e., classification under streaming emerging new classes or SENC. The SENC problem can be decomposed into three subproblems: detecting emerging new classes, classifying known classes, and ...
Xin Mu, K. Ting, Zhi-Hua Zhou
semanticscholar +1 more source
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) \
Bogumił Kamiński, Paweł Prałat
openaire +3 more sources
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.
Paul L. Krapivsky, Eli Ben-Naim
openaire +4 more sources
Optimal randomized classification trees [PDF]
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).
Blanquero, Rafael+3 more
openaire +4 more sources
Trees with product-form random weights [PDF]
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
Topological indices for random spider trees
In this study, we characterize the structure and some topological indices of a class of random spider trees (RSTs) such as degree-based Gini index, degree-based Hoover index, generalized Zagreb index, and other indices associated with these.
Sigarreta Saylé+2 more
doaj +1 more source