The Wiener Index of Random Digital Trees
From MaRDI portal
Publication:5251627
DOI10.1137/140977989zbMath1311.05031OpenAlexW1975723678MaRDI QIDQ5251627
Publication date: 20 May 2015
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/90aff83d3e7c08c46d047f14233d0c3f94d19cdd
Analysis of algorithms (68W40) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05) Distance in graphs (05C12)
Related Items (9)
ON SEVERAL PROPERTIES OF A CLASS OF PREFERENTIAL ATTACHMENT TREES—PLANE-ORIENTED RECURSIVE TREES ⋮ The vertex version of weighted Wiener number for bicyclic molecular structures ⋮ Several topological indices of random caterpillars ⋮ A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries ⋮ On the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sum ⋮ On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs ⋮ Extremal bipartite graphs and unicyclic graphs with respect to the eccentric resistance-distance sum ⋮ Dependence between path-length and size in random digital trees ⋮ On the Wiener indices of trees ordering by diameter-growing transformation relative to the pendent edges
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries
- On the Wiener index of random trees
- The oscillatory distribution of distances in random tries
- On the asymptotic internal path length and the asymptotic Wiener index of random Split trees
- Precise logarithmic asymptotics for the right tails of some limit random variables for random trees
- Mellin transforms and asymptotics: Harmonic sums
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- On the variance of a class of inductive valuations of data structures for digital search
- Distances in random digital search trees
- On the balance property of Patricia tries: External path length viewpoint
- Analytical depoissonization and its applications
- On The variance of the extremal path length in a symmetric digital trie
- A general limit theorem for recursive algorithms and combinatorial structures
- On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach
- The center of mass of the ISE and the Wiener index of trees
- Distribution of distances in random binary search trees.
- Spanning tree size in random binary search trees.
- An analytic approach to the asymptotic variance of trie statistics and related structures
- A class of trees and its Wiener index
- On Tail Bounds for Random Recursive Trees
- Limit Theorems for Depths and Distances in Weighted Random B-Ary Recursive Trees
- The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees
- Limit distribution of distances in biased random tries
- Asymptotic variance of random symmetric digital search trees
- Profiles of Tries
- Digital Search Trees Revisited
- Generalized Digital Trees and Their Difference—Differential Equations
- Universal Limit Laws for Depths in Random Trees
- Digital Search Trees Again Revisited: The Internal Path Length Perspective
- The Wiener Index of simply generated random trees
- Distances and Finger Search in Random Binary Search Trees
- Probability: A Graduate Course
- On the distribution of distances in recursive trees
- New results on the size of tries
- A multivariate view of random bucket digital search trees
- The distance between points in random trees
- Wiener index of trees: Theory and applications
This page was built for publication: The Wiener Index of Random Digital Trees
