Results 41 to 50 of about 736,356 (194)

Random real trees [PDF]

open access: yes, 2006
We survey recent developments about random real trees, whose prototype is the Continuum Random Tree (CRT) introduced by Aldous in 1991. We briefly explain the formalism of real trees, which yields a neat presentation of the theory and in particular of ...
Gall, J. F. Le
core   +3 more sources

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

Potts Model On Random Trees

open access: yes, 2004
We study the Potts model on locally tree-like random graphs of arbitrary degree distribution. Using a population dynamics algorithm we numerically solve the problem exactly. We confirm our results with simulations.
Albert R   +15 more
core   +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

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

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

Label-based parameters in increasing trees [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2006
Grown simple families of increasing trees are a subclass of increasing trees, which can be constructed by an insertion process. Three such tree families contained in the grown simple families of increasing trees are of particular interest: $\textit ...
Markus Kuba, Alois Panholzer
doaj   +1 more source

Random Planar Lattices and Integrated SuperBrownian Excursion [PDF]

open access: yes, 2002
In this paper, a surprising connection is described between a specific brand of random lattices, namely planar quadrangulations, and Aldous' Integrated SuperBrownian Excursion (ISE).
A Dembo   +18 more
core   +5 more sources

Random environment on coloured trees

open access: yes, 2007
In this paper, we study a regular rooted coloured tree with random labels assigned to its edges, where the distribution of the label assigned to an edge depends on the colours of its endpoints.
Menshikov, Mikhail   +2 more
core   +3 more sources

Multilayer parking with screening on a random tree [PDF]

open access: yes, 2009
In this paper we present a multilayer particle deposition model on a random tree. We derive the time dependent densities of the first and second layer analytically and show that in all trees the limiting density of the first layer exceeds the density in ...
A. Sudbury   +7 more
core   +1 more source

Home - About - Disclaimer - Privacy