Results 11 to 20 of about 5,579,561 (370)
Optimal Prefetching in Random Trees [PDF]
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 +6 more sources
arXiv, 2014 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
arxiv +5 more sources
On the number of transversals in random trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We study transversals in random trees with n vertices asymptotically as n tends to infinity. Our investigation treats the average number of transversals of fixed size, the size of a random transversal as well as the probability that a random subset of ...
Bernhard Gittenberger, Veronika Kraus
doaj +3 more sources
Random ultrametric trees and applications* [PDF]
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 +4 more sources
Random walks on random trees [PDF]
Journal of the Australian Mathematical Society, 1973 Let T denote one of the nn−2 trees with n labelled nodes that is rooted at a given node x (see [6] or [8] as a general reference on trees). If i and j are any two nodes of T, we write i ∼ j if they are joined by an edge in T. We want to consider random walks on T; we assume that when we are at a node i of degree d the probability that we proceed to ...
J. W. Moon
openalex +3 more sources
Stochastic rumors on random trees [PDF]
Journal of Statistical Mechanics: Theory and Experiment, 2021 The Maki–Thompson rumor model is defined by assuming that a population represented by a graph is subdivided into three classes of individuals; namely, ignorants, spreaders and stiflers.
V. V. Junior +2 more
semanticscholar +1 more source
On random trees and forests [PDF]
ESAIM: Proceedings and Surveys, 2023 The first talk at the session Random trees and random forests “Journée MAS” (27/08/2021) was presented by I. Kortchemski. After a general up-to-date introduction to local and scaling limits of Bienaymé trees (which are discrete branching trees), he ...
Contat Alice +4 more
doaj +1 more source
Profiles of random trees: plane-oriented recursive trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We summarize several limit results for the profile of random plane-oriented recursive trees. These include the limit distribution of the normalized profile, asymptotic bimodality of the variance, asymptotic approximations of the expected width and the ...
Hsien-Kuei Hwang
doaj +1 more source
Sharpness of the phase transition for parking on random trees [PDF]
Random Struct. Algorithms, 2020 Recently, a phase transition phenomenon has been established for parking on random trees. We extend the results of Curien and Hénard on general Bienaymé–Galton–Watson trees and allow different car arrival distributions depending on the vertex outdegrees.
Alice Contat
semanticscholar +1 more source
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