For a simple graph G, the Gordon-Scantlebury index of G is equal to the number of paths of length two in G, and the Platt index is equal to the total sum of the degrees of all edges in G. In this paper, we study these indices in random plane-oriented recursive trees through a recurrence equation for the first Zagreb index. As n ∊ ∞, the asymptotic normality of these indices are given.
19 March 2020 in Communications in Statistics - Simulation and Computation
Generalized weighted exponential (GWE) distributions are a natural generalization of weighted exponential distributions. This paper attempts to revisit the GWE distribution in order to address the main inferential aspects of this distribution, such as the maximum likelihood estimators of the unknown parameters and their corresponding asymptotic confidence intervals, that vanished in previous works. Also, it develops some new distributional results about the GWE distribution and provides more interesting closed form expressions for previously presented results. A simulation study and a real world application are also worked out to assess the maximum likelihood estimators and to illustrate the theory.
The first multiplicative Zagreb index $Pi_1(G)$ is equal to the product of squares of the degree of the vertices and the second multiplicative Zagreb index $Pi_2(G)$ is equal to the product of the products of the degree of pairs of adjacent vertices of the underlying molecular graphs $G$. Also, the multiplicative sum Zagreb index $Pi_3(G)$ is equal to the product of the sums of the degree of pairs of adjacent vertices of $G$. In this paper, we introduce a new version of the multiplicative sum Zagreb index and study the moments of the ratio and product of all above indices in a randomly chosen molecular graph with tree structure of order $n$. Also, a supermartingale is introduced by Doob's supermartingale inequality.
The first variable Zagreb index of graph $G$ is defined as begin{eqnarray*} M_{1,lambda}(G)=sum_{vin V(G)}d(v)^{2lambda}, end{eqnarray*} where $lambda$ is a real number and $d(v)$ is the degree of vertex $v$. In this paper, some upper and lower bounds for the distribution function and expected value of this index in random increasing trees (recursive trees, plane-oriented recursive trees and binary increasing trees) are given.
1 August 2022 in Acta Universitatis Sapientiae, Informatica
In this paper, we derive several results related to total path length and Sackin index in two classes of random recursive trees. A limiting distribution of the normalized version of the Sackin index is given by the contraction method in random recursive trees. Also, we show the normalized total path length converges in L2 and almost surely to a limiting random variable in plane-oriented recursive trees via martingales.