Results 11 to 20 of about 166,958 (306)
On the spectral dimension of random trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We determine the spectral dimensions of a variety of ensembles of infinite trees. Common to the ensembles considered is that sample trees have a distinguished infinite spine at whose vertices branches can be attached according to some probability ...
Bergfinnur Durhuus +2 more
doaj +1 more source
Optimal Prefetching in Random Trees
Mathematics, 2021 We propose and analyze a model for optimizing the prefetching of documents, in the situation where the connection between documents is discovered progressively.
Kausthub Keshava +2 more
doaj +1 more source
Parking on a Random Tree [PDF]
Combinatorics, Probability and Computing, 2018 Consider a uniform random rooted labelled tree on n vertices. We imagine that each node of the tree has space for a single car to park. A number m ≤ n of cars arrive one by one, each at a node chosen independently and uniformly at random. If a car arrives at a space which is already occupied, it follows the unique path towards the root until it ...
Christina Goldschmidt, Michal Przykucki
openaire +3 more sources
A functional limit law for the profile of plane-oriented recursive trees. [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We give a functional limit law for the normalized profile of random plane-oriented recursive trees. The proof uses martingale convergence theorems in discrete and continuous-time. This complements results of Hwang (2007).
Henning Sulzbach
doaj +1 more source
Spreading of Infections on Network Models: Percolation Clusters and Random Trees
Mathematics, 2021 We discuss network models as a general and suitable framework for describing the spreading of an infectious disease within a population. We discuss two types of finite random structures as building blocks of the network, one based on percolation concepts
Hector Eduardo Roman, Fabrizio Croccolo
doaj +1 more source
One-sided Variations on Tries: Path Imbalance, Climbing, and Key Sampling [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 One-sided variations on path length in a trie (a sort of digital trees) are investigated: They include imbalance factors, climbing under different strategies, and key sampling.
Costas A. Christophi, Hosam M. Mahmoud
doaj +1 more source
Topological indices for random spider trees
Main Group Metal Chemistry, 2023 In this study, we characterize the structure and some topological indices of a class of random spider trees (RSTs) such as degree-based Gini index, degree-based Hoover index, generalized Zagreb index, and other indices associated with these.
Sigarreta Saylé +2 more
doaj +1 more source
Distribution of inter-node distances in digital trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We investigate distances between pairs of nodes in digital trees (digital search trees (DST), and tries). By analytic techniques, such as the Mellin Transform and poissonization, we describe a program to determine the moments of these distances.
Rafik Aguech +2 more
doaj +1 more source
Random Trees in Random Graphs [PDF]
Proceedings of the American Mathematical Society, 1988 We show that a random labeled n n -vertex graph almost surely contains isomorphic copies of almost all labeled
Bender, E. A., Wormald, N. C.
openaire +2 more sources
The continuous limit of large random planar maps [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We discuss scaling limits of random planar maps chosen uniformly over the set of all $2p$-angulations with $n$ faces. This leads to a limiting space called the Brownian map, which is viewed as a random compact metric space.
Jean-François Le Gall
doaj +1 more source