Results 41 to 50 of about 2,906,539 (296)
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 +1 more source
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
Fringe Trees for Random Trees With Given Vertex Degrees [PDF]
We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labeled trees with given vertex degrees, for
Berzunza Ojeda, Gabriel +6 more
core +2 more sources
A simple and effective approach to quantitatively characterize structural complexity
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
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
On the Zagreb index of random m-oriented recursive trees [PDF]
The main goal of this paper is to study the modified $F$-indices (modified first Zagreb index and modified forgotten topological index) of random $m$-oriented recursive trees (RMORTs).
Ramin Kazemi
doaj +1 more source
Asymptotic variance of random symmetric digital search trees [PDF]
Dedicated to the 60th birthday of Philippe ...
Hsien-Kuei Hwang +2 more
doaj +1 more source
Intersection of random spanning trees in complex networks
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
Machine learning-based models like random forest (RF) have been widely deployed in diverse domains such as image processing, health care, and text processing, etc. during the past few years.
Nasir Jalal +3 more
doaj +1 more source
Bindweeds or random walks in random environments on multiplexed trees and their asympotics [PDF]
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

