Results 51 to 60 of about 166,958 (306)

Distinct Fringe Subtrees in Random Trees

open access: yes, 2022
A fringe subtree of a rooted tree is a subtree induced by one of the vertices and all its descendants. We consider the problem of estimating the number of distinct fringe subtrees in random trees under a generalized notion of distinctness, which allows ...
Stephan Wagner   +3 more
core   +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

Rooted trees and moments of large sparse random matrices [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2003
In these expository paper we describe the role of the rooted trees as a base for convenient tools in studies ofrandom matrices. Regarding the Wigner ensemble of random matrices, we represent main ingredients ofthis approach.
Oleksiy Khorunzhiy
doaj   +1 more source

The human gut microbiome across the life course

open access: yesFEBS Letters, EarlyView.
Despite significant individual variation and continuous change throughout life, the human gut microbiome follows some life stage‐specific trends. This article provides a brief overview of how gut microbiome composition shifts across different phases of life. Created in BioRender. Özkurt, E. (2026) https://BioRender.com/8q4nrnc.
Alise J. Ponsero   +4 more
wiley   +1 more source

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

Spatial patterns and intra-specific competition of Chestnut-leaved oak (Quercus castaneifolia C. A. Mey.) using O- ring statistic (Case study: Neka Forest, Iran) [PDF]

open access: yesتحقیقات جنگل و صنوبر ایران, 2015
The spatial patterns of trees in different stages of their life provide important information related to forest regeneration and succession processes.
Farideh Omidvar Hosseini   +3 more
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   +1 more source

Structural insights and therapeutic targets in Acinetobacter baumannii capsule biosynthesis

open access: yesFEBS Letters, EarlyView.
Hypervirulent KL49 A. baumannii's capsular polysaccharide contains the nonulosonic acid 8‐epi‐Leg5,7Ac2, synthesized by epimerization via ElaA, ElaB, and ElaC. Crystal structures of ElaA, ElaB, and ElaC reveal their role in CMP‐Leg5,7Ac2 synthesis and regioselective C8 epimerization.
Woo Cheol Lee   +7 more
wiley   +1 more source

Clustering graphs using random trees

open access: yes, 2019
In this work-in-progress paper, we present GraphTrees, a novel method that relies on random decision trees to compute pairwise distances between vertices in a graph.
Couceiro, Miguel   +2 more
core   +4 more sources

Random hyperplane search trees in high dimensions

open access: yesJournal of Computational Geometry, 2015
Given a set S of n ≥ d points in general position in Rd, a random hyperplane split is obtained by sampling d points uniformly at random without replacement from S and splitting based on their affine hull. A random hyperplane search tree is a binary space
Luc Devroye, James King
doaj   +1 more source

Home - About - Disclaimer - Privacy