scholarly journals The total Steiner $k$-distance for $b$-ary recursive trees and linear recursive trees

2010 ◽  
Vol DMTCS Proceedings vol. AM,... (Proceedings) ◽  
Author(s):  
Götz Olaf Munsonius
Keyword(s):  
Asymptotic Expansion ◽  
Limit Theorem ◽  
Recursion Formula ◽  
General Setting ◽  
Wiener Index ◽  
Second Step ◽  
Contraction Method ◽  
Recursive Tree ◽  
International Audience ◽  
Recursive Trees

International audience We prove a limit theorem for the total Steiner $k$-distance of a random $b$-ary recursive tree with weighted edges. The total Steiner $k$-distance is the sum of all Steiner $k$-distances in a tree and it generalises the Wiener index. The limit theorem is obtained by using a limit theorem in the general setting of the contraction method. In order to use the contraction method we prove a recursion formula and determine the asymptotic expansion of the expectation using the so-called Master Theorem by Roura (2001). In a second step we prove a transformation of the total Steiner $k$-distance of $b$-ary trees with weighted edges to arbitrary recursive trees. This transformation yields the limit theorem for the total Steiner $k$-distance of the linear recursive trees when the parameter of these trees is a non-negative integer.

scholarly journals On the Zagreb Index of Random Recursive Trees

2011 ◽  
Vol 48 (04) ◽  
pp. 1189-1196 ◽  
Author(s):  
Qunqiang Feng ◽  
Zhishui Hu
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Asymptotic Normality ◽  
Random Process ◽  
Central Limit ◽  
Topological Indices ◽  
Zagreb Index ◽  
Martingale Central Limit Theorem ◽  
Recursive Tree ◽  
Recursive Trees

We investigate the Zagreb index, one of the topological indices, of random recursive trees in this paper. Through a recurrence equation, the first two moments ofZn, the Zagreb index of a random recursive tree of sizen, are obtained. We also show that the random process {Zn− E[Zn],n≥ 1} is a martingale. Then the asymptotic normality of the Zagreb index of a random recursive tree is given by an application of the martingale central limit theorem. Finally, two other topological indices are also discussed in passing.

On the size of paged recursive trees

2017 ◽  
Vol 09 (02) ◽  
pp. 1750021
Author(s):  
Mehri Javanian
Keyword(s):  
Contraction Method ◽  
Recursive Tree ◽  
Asymptotically Normal ◽  
Recursive Trees ◽  
Normal Formula

A paged recursive tree is constructed as a recursive tree except that it depends on an integer parameter [Formula: see text] representing a page capacity, small subtrees with size [Formula: see text]. We investigate the number of nodes [Formula: see text] (size of the tree) in paged recursive trees built from labels [Formula: see text]. The expectation and variance of [Formula: see text] are derived, and it is also shown that [Formula: see text] is asymptotically normal. [Formula: see text] as [Formula: see text] by applying the contraction method.

scholarly journals On the Zagreb Index of Random Recursive Trees

2011 ◽  
Vol 48 (4) ◽  
pp. 1189-1196 ◽  
Author(s):  
Qunqiang Feng ◽  
Zhishui Hu
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Asymptotic Normality ◽  
Random Process ◽  
Central Limit ◽  
Topological Indices ◽  
Zagreb Index ◽  
Martingale Central Limit Theorem ◽  
Recursive Tree ◽  
Recursive Trees

We investigate the Zagreb index, one of the topological indices, of random recursive trees in this paper. Through a recurrence equation, the first two moments of Zn, the Zagreb index of a random recursive tree of size n, are obtained. We also show that the random process {Zn − E[Zn], n ≥ 1} is a martingale. Then the asymptotic normality of the Zagreb index of a random recursive tree is given by an application of the martingale central limit theorem. Finally, two other topological indices are also discussed in passing.

scholarly journals Random assignment and shortest path problems

2006 ◽  
Vol DMTCS Proceedings vol. AG,... (Proceedings) ◽  
Author(s):  
Johan Wästlund
Keyword(s):  
Limit Theorem ◽  
Shortest Path ◽  
Complete Graph ◽  
Assignment Problem ◽  
Shortest Path Problem ◽  
Random Assignment ◽  
Shortest Path Problems ◽  
Parisi Formula ◽  
International Audience ◽  
Random Assignment Problem

International audience We explore a similarity between the $n$ by $n$ random assignment problem and the random shortest path problem on the complete graph on $n+1$ vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by C. Nair, B. Prabhakar and M. Sharma in 2003. We give direct proofs of the analogs for the shortest path problem of some results established by D. Aldous in connection with his $\zeta (2)$ limit theorem for the assignment problem.

scholarly journals Constrained exchangeable partitions

2006 ◽  
Vol DMTCS Proceedings vol. AG,... (Proceedings) ◽  
Author(s):  
Alexander Gnedin
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Random Partitions ◽  
Type Representation ◽  
International Audience ◽  
De Finetti ◽  
Infinite Set ◽  
Special Case

International audience For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.

scholarly journals On the Variety of Shapes on the Fringe of a Random Recursive Tree

2010 ◽  
Vol 47 (01) ◽  
pp. 191-200 ◽  
Author(s):  
Qunqiang Feng ◽  
Hosam M. Mahmoud
Keyword(s):  
Normal Distribution ◽  
Contraction Method ◽  
Tree Shape ◽  
Recursive Tree ◽  
Asymptotic Normal Distribution ◽  
Asymptotic Normal ◽  
The Given ◽  
Fixed Tree

We consider a variety of subtrees of various shapes lying on the fringe of a recursive tree. We prove that (under suitable normalization) the number of isomorphic images of a given fixed tree shape on the fringe of the recursive tree is asymptotically Gaussian. The parameters of the asymptotic normal distribution involve the shape functional of the given tree. The proof uses the contraction method.

Phase Changes in the Topological Indices of Scale-Free Trees

2013 ◽  
Vol 50 (02) ◽  
pp. 516-532 ◽  
Author(s):  
Qunqiang Feng ◽  
Zhishui Hu
Keyword(s):  
Nonnegative Integer ◽  
Topological Indices ◽  
Critical Values ◽  
Phase Changes ◽  
Zagreb Index ◽  
Asymptotic Behaviors ◽  
Scale Free ◽  
Recursive Tree ◽  
Free Tree ◽  
Recursive Trees

A scale-free tree with the parameter β is very close to a star if β is just a bit larger than −1, whereas it is close to a random recursive tree if β is very large. Through the Zagreb index, we consider the whole scene of the evolution of the scale-free trees model as β goes from −1 to + ∞. The critical values of β are shown to be the first several nonnegative integer numbers. We get the first two moments and the asymptotic behaviors of this index of a scale-free tree for all β. The generalized plane-oriented recursive trees model is also mentioned in passing, as well as the Gordon-Scantlebury and the Platt indices, which are closely related to the Zagreb index.

Sign in / Sign up

Export Citation Format

Share Document