Results 61 to 70 of about 723,488 (236)
Label-based parameters in increasing trees [PDF]
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
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
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
AbstractThe classical gambler's ruin problem, i.e., a random walk along a line may be viewed graph theoretically as a random walk along a path with the endpoints as absorbing states. This paper is an investigation of the natural generalization of this problem to that of a particle walking randomly on a tree with the endpoints as absorbing barriers ...
openaire +2 more sources
Predicting the Pillar Stability of Underground Mines with Random Trees and C4.5 Decision Trees
Predicting pillar stability in underground mines is a critical problem because the instability of the pillar can cause large-scale collapse hazards. To predict the pillar stability for underground coal and stone mines, two new models (random tree and C4 ...
Mahmood Ahmad +5 more
doaj +1 more source
Random trees and applications [PDF]
We discuss several connections between discrete and continuous random trees. In the discrete setting, we focus on Galton-Watson trees under various conditionings. In particular, we present a simple approach to Aldous' theorem giving the convergence in distribution of the contour process of conditioned Galton-Watson trees towards the normalized Brownian
openaire +5 more sources
The fluctuations of the giant cluster for percolation on random split trees
A split tree of cardinality $n$ is constructed by distributing $n$ "balls" in a subset of vertices of an infinite tree which encompasses many types of random trees such as $m$-ary search trees, quad trees, median-of-$(2k+1)$ trees, fringe-balanced trees,
Berzunza, Gabriel +2 more
core +1 more source
We prove that a random labeled (unlabeled) tree is balanced. We also prove that random labeled and unlabeled trees are strongly $k$-balanced for any $k\geq 3$.
Warren E. Shreve, Azer Akhmedov
openaire +4 more sources
With the advancement of the university information process, more and more application systems are running on the campus network, and the information system becomes larger and more complex. With the rapid growth of network users and the popularization and
Li Yin, Yijun Chen
doaj +1 more source
Random Planar Lattices and Integrated SuperBrownian Excursion [PDF]
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

