Related papers: Zagreb Connection indices on polyomino chains and …
The first multiplicative Zagreb index of a graph $G$ is the product of the square of every vertex degree, while the second multiplicative Zagreb index is the product of the products of degrees of pairs of adjacent vertices. In this paper,…
The first Zagreb index $M_{1}(G)$ is equal to the sum of squares of the degrees of the vertices, and the second Zagreb index $M_{2}(G)$ is equal to the sum of the products of the degrees of pairs of adjacent vertices of the underlying…
Continuous-time Markov chains on non-negative integers can be used for modeling biological systems, population dynamics, and queueing models. Qualitative behaviors of birth-and-death models, typical examples of such one-dimensional…
Given a non-negative Jacobi matrix describing higher order recurrence relations for multiple orthogonal polynomials of type~II and corresponding linear forms of type I, a general strategy for constructing a pair of stochastic matrices, dual…
The motivation of this work is to extend the techniques of higher order random walks on simplicial complexes to analyze mixing times of Markov chains for combinatorial problems. Our main result is a sharp upper bound on the second…
We present a novel method for computing reachability probabilities of parametric discrete-time Markov chains whose transition probabilities are fractions of polynomials over a set of parameters. Our algorithm is based on two key…
Recently, a couple of degree-based topological indices, defined using a geometrical point of view of a graph edge, have attracted significant attention and being extensively investigated. Furtula and Oz [Complementary Topological Indices,…
In this paper we present a theoretical analysis in order to establish maximal and minimal vectors with respect to the majorization order of particular subsets of \Re ^n: Afterwards we apply these issues to the calcula- tion of bounds for a…
The generalized hierarchical product of graphs was introduced by L. Barri\'ere et al in 2009. In this paper, reformulated first Zagreb index of generalized hierarchical product of two connected graphs and hence as a special case cluster…
Let $\mathbb{G} = (\mathcal{V}, \mathcal{E})$ be a simple connected graph, where $\mathcal{V}$ and $\mathcal{E}$ denote the vertex and edge sets, respectively. The first Zagreb index is defined as $\mathcal{M}_{1}(\mathbb{G}) = \sum_{v \in…
We review the recent approach to Markov chains using the Karnofksy-Rhodes and McCammond expansions in semigroup theory by the authors and illustrate them by two examples.
Applications in chemistry motivated mathematicians to define different topological indices for different types of graphs. The Hyper-Zagreb index (HM) is an important tool as it integrates the first and the second Zagreb indices. In this…
We consider the higher-order Markov Chain, and characterize the second order Markov chains admitting every probability distribution vector as a stationary vector. The result is used to construct Markov chains of higher-order with the same…
In order to investigate the relationship between Shannon information measure of random variables, scholars such as Yeung utilized information diagrams to explore the structured representation of information measures, establishing…
We investigate multivariate regular variation in the context of time-homogeneous Markov chains on general vector spaces and in random coefficient linear models. In the first part, we show that the regular variation of the stationary…
In this paper we develop the elements of the theory of algorithmic randomness in continuous-time Markov chains (CTMCs). Our main contribution is a rigorous, useful notion of what it means for an individual trajectory of a CTMC to be random.…
This paper proposes a new type of recurrence where we divide the Markov chains into intervals that start when the chain enters into a subset A, then sample another subset B far away from A and end when the chain again return to A. The…
Markov networks are widely studied and used throughout multivariate statistics and computer science. In particular, the problem of learning the structure of Markov networks from data without invoking chordality assumptions in order to…
We determine the degree sequence of the generalized Sierpinski graph and its general first Zagreb index in terms of the same parameters of the base graph G.
In this paper we study the long term evolution of a continuous time Markov chain formed by two interacting birth-and-death processes. The interaction between the processes is modelled by transition rates which are functions with suitable…