Results 51 to 60 of about 2,906,539 (296)

Local extrema in random trees

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2005
The number of local maxima (resp., local minima) in a tree T∈𝒯n rooted at r∈[n] is denoted by Mr(T) (resp., by mr(T)). We find exact formulas as rational functions of n for the expectation and variance of M1(T) and mn(T) when T∈𝒯n is chosen randomly ...
Lane Clark
doaj   +1 more source

Trees in random graphs

open access: yesDiscrete Mathematics, 1983
The probability space consisting of all graphs on a set of \(n\) vertices where each edge occurs with probability \(p\), independently of all other edges, is denoted by \(G(n,p)\). Theorem: For each \(\epsilon>0\) almost every graph \(G\in G(n,p)\) is such if \((1+\epsilon)\log n/\log ...
Paul Erdös, Zbigniew Palka
openaire   +2 more sources

Identification of Pasture Degradation Using Remote Sensing Data and Machine Learning: A Case Study of Obichnik

open access: yesApplied Sciences
The degradation of pastures and meadows is a global problem with a wide range of impacts. It affects farmers in different ways, such as decreases in cattle production, milk yield, and forage quality. Still, it also has other side effects, such as loss of
Boris Evstatiev   +12 more
doaj   +1 more source

Non-crossing trees revisited: cutting down and spanning subtrees [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2003
Here we consider two parameters for random non-crossing trees: $\textit{(i)}$ the number of random cuts to destroy a size-$n$ non-crossing tree and $\textit{(ii)}$ the spanning subtree-size of $p$ randomly chosen nodes in a size-$n$ non-crossing tree ...
Alois Panholzer
doaj   +1 more source

Random model trees: an effective and scalable regression method [PDF]

open access: yes, 2010
We present and investigate ensembles of randomized model trees as a novel regression method. Such ensembles combine the scalability of tree-based methods with predictive performance rivaling the state of the art in numeric prediction.
Pfahringer, Bernhard
core  

Scaling limit for the random walk on the largest connected component of the critical random graph [PDF]

open access: yes, 2012
In this article, a scaling limit for the simple random walk on the largest connected component of the Erdos-Rényi random graph G(n,p) in the critical window, p = n−1+λn−4/3, is deduced.
Croydon, David A.
core   +1 more source

Reconstructing enzyme evolution by protein engineering

open access: yesFEBS Letters, EarlyView.
Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler   +2 more
wiley   +1 more source

Random Intersection Trees

open access: yesJ. Mach. Learn. Res., 2013
Finding interactions between variables in large and high-dimensional datasets is often a serious computational challenge. Most approaches build up interaction sets incrementally, adding variables in a greedy fashion. The drawback is that potentially informative high-order interactions may be overlooked.
Shah, RD, Meinshausen, N
openaire   +4 more sources

A Modified Random Forest Based on Kappa Measure and Binary Artificial Bee Colony Algorithm

open access: yesIEEE Access, 2021
Random forest (RF) is an ensemble classifier method, all decision trees participate in voting, some low-quality decision trees will reduce the accuracy of random forest.
Chen Zhang   +5 more
doaj   +1 more source

Spectral asymptotics for stable trees [PDF]

open access: yes, 2010
We calculate the mean and almost-sure leading order behaviour of the high frequency asymptotics of the eigenvalue counting function associated with the natural Dirichlet form on alpha-stable trees, which lead in turn to short-time heat kernel asymptotics
Croydon, David A.   +3 more
core  

Home - About - Disclaimer - Privacy