Results 31 to 40 of about 5,525,400 (353)
The continuous limit of large random planar maps [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We discuss scaling limits of random planar maps chosen uniformly over the set of all $2p$-angulations with $n$ faces. This leads to a limiting space called the Brownian map, which is viewed as a random compact metric space.
Jean-François Le Gall
doaj +1 more source
The spectral dimension of random trees [PDF]
Journal of Physics A: Mathematical and General, 2002 We present a simple yet rigorous approach to the determination of the spectral dimension of random trees, based on the study of the massless limit of the Gaussian model on such trees. As a byproduct, we obtain evidence in favor of a new scaling hypothesis for the Gaussian model on generic bounded graphs and in favor of a previously conjectured exact ...
C. Destri, Luca Donetti
openalex +6 more sources
Coronary Artery Disease Diagnosis: Ranking the Significant Features Using Random Trees Model
, 2020 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
Parking on a Random Tree [PDF]
Combinatorics, Probability and Computing, 2018 Consider a uniform random rooted labelled tree on n vertices. We imagine that each node of the tree has space for a single car to park. A number m ≤ n of cars arrive one by one, each at a node chosen independently and uniformly at random. If a car arrives at a space which is already occupied, it follows the unique path towards the root until it ...
Goldschmidt, C, Przykucki, M
openaire +4 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
Classification Under Streaming Emerging New Classes: A Solution Using Completely-Random Trees [PDF]
IEEE Transactions on Knowledge and Data Engineering, 2016 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
Pattern distribution in various types of random trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Let $\mathcal{T}_n$ denote the set of unrooted unlabeled trees of size $n$ and let $\mathcal{M}$ be a particular (finite) tree. Assuming that every tree of $\mathcal{T}_n$ is equally likely, it is shown that the number of occurrences $X_n$ of $\mathcal{M}
Gerard Kok
doaj +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
30th Annual Symposium on Foundations of Computer Science, 1989 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cecilia Aragon +2 more
openaire +2 more sources
Tail Bounds for the Wiener Index of Random Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Upper and lower bounds for the tail probabilities of the Wiener index of random binary search trees are given. For upper bounds the moment generating function of the vector of Wiener index and internal path length is estimated.
Tämur Ali Khan, Ralph Neininger
doaj +1 more source