Results 31 to 40 of about 2,921,645 (302)
Scaling limit for the random walk on the largest connected component of the critical random graph [PDF]
, 2012 In this article, a scaling limit for the simple random walk on the largest connected component of the Erdos-Rényi random graph G(n,p) in the critical window, p = n−1+λn−4/3, is deduced.
Croydon, David A.
core +1 more source
Random Generation of Nondeterministic Finite-State Tree Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Algorithms for (nondeterministic) finite-state tree automata (FTAs) are often tested on random FTAs, in which all internal transitions are equiprobable.
Thomas Hanneforth +2 more
doaj +1 more source
Jurnal Nasional Pendidikan Teknik Informatika (JANAPATI), 2021 This study describes the performance of Sugeno fuzzy logic in determining the amount of woven fabric production by using a combination of random tree decision trees in forming rules.
Tundo Tundo
doaj +1 more source
Fragmentation of random trees [PDF]
Journal of Physics A: Mathematical and Theoretical, 2014 We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected existing node. As nodes are removed from the tree, one at a time, the tree dissolves into an ensemble of separate trees,
Kalay, Z, Ben-Naim, E
openaire +3 more sources
, 2022 We consider the process of uncovering the vertices of a random labeled tree according to their labels. First, a labeled tree with n vertices is generated uniformly at random. Thereafter, the vertices are uncovered one by one, in order of their labels. With each new vertex, all edges to previously uncovered vertices are uncovered as well.
Benjamin Hackl +2 more
openaire +4 more sources
Random ultrametric trees and applications*
ESAIM: Proceedings and Surveys, 2017 Ultrametric trees are trees whose leaves lie at the same distance from the root. They are used to model the genealogy of a population of particles co-existing at the same point in time.
Lambert Amaury
doaj +1 more source
Random Recursive Trees and Preferential Attachment Trees are Random Split Trees [PDF]
Combinatorics, Probability and Computing, 2018 We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree and the standard preferential attachment tree.
openaire +4 more sources
International Journal of Advanced Robotic Systems, 2020 Inspired by the phototropism of plants, a novel variant of the rapidly exploring random tree algorithm as called phototropism rapidly exploring random tree is proposed.
Chengchen Zhuge +3 more
doaj +1 more source
Prediction of Employee Attendance Factors Using C4.5 Algorithm, Random Tree, Random Forest
Semesta Teknika, 2020 Research on the performance of workers based on the determination of standard working hours for absences conducted by workers in a certain period.
Riza Fahlapi +5 more
doaj +1 more source
Comparative Study of Various Wireless Sensor Network (WSN) Topology Construction Protocols [PDF]
International Journal of Networked and Distributed Computing (IJNDC), 2014 As the cost for wireless sensors and wireless sensor networks (WSNs) have decreased, they have become more ubiquitous; they are increasingly being used in many applications such as security, structural monitoring and environmental monitoring.
Lifford McLauchlan +3 more
doaj +1 more source