Related papers: Multilayer parking with screening on a random tree
We study the problem of random search in finite networks with a tree topology, where it is expected that the distribution of the first-passage time F(t) decays exponentially. We show that the slope of the exponential tail is independent of…
Greening cities is a key solution to improve the urban microclimate and mitigate the impact of climate change. However, the effect of tree planting on pollutant dispersion in streets is still a debated topic. To shed light on this issue, we…
Random Forest is an ensemble of decision trees based on the bagging and random subspace concepts. As suggested by Breiman, the strength of unstable learners and the diversity among them are the ensemble models' core strength. In this paper,…
Organisms in nature can alter the short-range order of an amorphous precursor phase, thereby controlling the resulting crystalline structure. This phenomenon inspired an investigation of the effect of modifying the short-range order within…
The estimation of probability densities based on available data is a central task in many statistical applications. Especially in the case of large ensembles with many samples or high-dimensional sample spaces, computationally efficient…
Let $G$ be an $r$-partite graph such that the edge density between any two parts is at least $\alpha$. How large does $\alpha$ need to be to guarantee that $G$ contains a connected transversal, that is, a tree on $r$ vertices meeting each…
The ratio of two densities provides a direct characterization of their differences. We consider the two-sample comparison problem by estimating this ratio given i.i.d. observations from two distributions. To this end, we propose additive…
The rate of second layer nucleation -- the formation of a stable nucleus on top of a two-dimensional island -- determines both the conditions for layer-by-layer growth, and the size of the top terrace of multilayer mounds in…
In this paper, we study a distribution of labeled particles on a continuous ring. It arises in three different ways, all related to the multi-type TASEP on a ring. We prove formulas for the probability density function for some permutations…
The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have a definable choice function (by a monadic formula with…
We study the problem of learning a latent tree graphical model where samples are available only from a subset of variables. We propose two consistent and computationally efficient algorithms for learning minimal latent trees, that is, trees…
We define a notion of stochastic domination between trees, where one tree dominates another if when the vertices of each are labeled with independent, identically distributed random variables, one tree is always more likely to contain a…
The empirical and particle force-based models of granular segregation due to density differences among the species are compared in this work. Dependency of the empirical segregation parameters on the initial configuration, the observation…
Due to their long-standing reputation as excellent off-the-shelf predictors, random forests continue remain a go-to model of choice for applied statisticians and data scientists. Despite their widespread use, however, until recently, little…
A layerwise search in a split-by-edges tree (as defined by Br{\ae}ndeland, 2015) of agiven graph produces a maximum independent set in exponential time. A depth-first search produces an independent set, which may or may not be a maximum, in…
We solve a problem of Krivelevich, Kwan and Sudakov [SIAM Journal on Discrete Mathematics 31 (2017), 155-171] concerning the threshold for the containment of all bounded degree spanning trees in the model of randomly perturbed dense graphs.…
The segmentation of individual trees from forest point clouds is a crucial task for downstream analyses such as carbon sequestration estimation. Recently, deep-learning-based methods have been proposed which show the potential of learning…
With the development of technology, the chemical production process is becoming increasingly complex and large-scale, making fault detection particularly important. However, current detective methods struggle to address the complexities of…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
A new synthesis scheme is proposed to generate a random vector with prescribed joint density that induces a (latent) Gaussian tree structure. The quality of synthesis is shown by vanishing total variation distance between the synthesized…