On the distribution in a graph process
type: Item
instance of: scholarly article
title: On the distribution in a graph process
zbMATH Open document ID: 0543.05040
DOI: 10.1016/0012-365X(84)90057-8
author: B. R. Handa
author: S. G. Mohanty
published in: Discrete Mathematics
publication date: 1984-01-01T00:00:00Z
review text: A graph \(G_{n+1}\) is obtained from a graph \(G_ n\) by adding a new point with probability \(p_ n\) and inserting a new line at random with probability \(1-p_ n\) for \(n=1,2,...\). Here \(p_ n=1\) if \(G_ n\) is complete, and \(p_ n=p\) otherwise. The initial graph \(G_ 1\) consists of a simple point. Various properties of the graph process were investigated by \textit{M. Capobianco} and \textit{O. Frank} [Discrete Math. 46, 133-143 (1983; Zbl 0513.05049)] using lattice path methods. This note shows how determinantal lattice path counting formulas can be applied in this context.
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05A10
zbMATH DE Number: 3863237
zbMATH Keywords: lattice path counting
zbMATH Keywords: random walk
MaRDI profile type: Publication
cites work: Q5550180
cites work: Q3903764
description: scientific article; zbMATH DE number 3863237