On the distribution in a graph process (Q795841): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Sri Gopal Mohanty / rank | |||
Property / author | |||
Property / author: Sri Gopal Mohanty / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5550180 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3903764 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:20, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the distribution in a graph process |
scientific article |
Statements
On the distribution in a graph process (English)
0 references
1984
0 references
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.
0 references
lattice path counting
0 references
random walk
0 references