Results 41 to 50 of about 166,958 (306)
A simple and effective approach to quantitatively characterize structural complexity
Scientific Reports, 2021 This study brings insight into interpreting forest structural diversity and explore the classification of individuals according to the distribution of the neighbours in natural forests. Natural forest communities with different latitudes and distribution
Gongqiao Zhang +3 more
doaj +1 more source
Optimal randomized classification trees [PDF]
Computers & Operations Research, 2021 This research has been financed in part by research projects EC H2020 MSCA RISE NeEDS (Grant agreement ID: 822214), FQM-329 and P18-FR-2369 (Junta de Andaluc\'ia), and PID2019-110886RB-I00 (Ministerio de Ciencia, Innovaci\'on y Universidades, Spain).
Rafael Blanquero +3 more
openaire +3 more sources
Simply generated trees, conditioned Galton―Watson trees, random allocations and condensation: Extended abstract [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We give a unified treatment of the limit, as the size tends to infinity, of random simply generated trees, including both the well-known result in the standard case of critical Galton-Watson trees and similar but less well-known results in the other ...
Svante Janson
doaj +1 more source
Journal of Statistical Mechanics: Theory and Experiment, 2010 We investigate a network growth model in which the genealogy controls the evolution. In this model, a new node selects a random target node and links either to this target node, or to its parent, or to its grandparent, etc; all nodes from the target node to its most ancient ancestor are equiprobable destinations.
Ben-Naim, E., Krapivsky, P. L.
openaire +2 more sources
Asymptotic variance of random symmetric digital search trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Dedicated to the 60th birthday of Philippe ...
Hsien-Kuei Hwang +2 more
doaj +1 more source
Bindweeds or random walks in random environments on multiplexed trees and their asympotics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 We report on the asymptotic behaviour of a new model of random walk, we term the bindweed model, evolving in a random environment on an infinite multiplexed tree.The term multiplexed means that the model can be viewed as a nearest neighbours random walk ...
Mikhail Menshikov +2 more
doaj +1 more source
Intersection of random spanning trees in complex networks
Applied Network Science, 2023 In their previous work, the authors considered the concept of random spanning tree intersection of complex networks (London and Pluhár, in: Cherifi, Mantegna, Rocha, Cherifi, Micciche (eds) Complex networks and their applications XI, Springer, Cham, 2023)
András London, András Pluhár
doaj +1 more source
, 2009 The meeting was devoted to random trees, a central concept in mathematics that provides a key way of thinking about relationships between objects such as particles in a fluid, individuals in a population, or labels in a search algorithm.
core +2 more sources
Applied SciencesThe 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
ESAIM: Proceedings, 2011 These notes provide an elementary and self-contained introduction to branching ran- dom walks. Section 1 gives a brief overview of Galton-Watson trees, whereas Section 2 presents the classical law of large numbers for branching random walks. These two short sections are not exactly in- dispensable, but they introduce the idea of using size-biased trees,
openaire +2 more sources