Gurami Tsitsiashvili, Marina Osipova, "New Asymptotic and Algorithmic Results in Calculation of Random Graphs Connectivity," WSEAS Transactions on Mathematics, vol. 11, pp. -, 2012, DOI:
Gurami Tsitsiashvili, Marina Osipova. New Asymptotic and Algorithmic Results in Calculation of Random Graphs Connectivity.
WSEAS Transactions on Mathematics. 2012;11:-.
WSEAS Transactions on Mathematics
Print ISSN: 1109-2769, E-ISSN: 2224-2880
Volume 11, 2012
New Asymptotic and Algorithmic Results in Calculation of Random Graphs Connectivity
Authors: ,
Abstract: This paper is devoted to calculations of connectivity probabilities and distributions of connectivity com- ponents numbers in planar and recursively defined and parallel-sequential random graphs. These calculations are based on asymptotic formulas for connectivity probabilities and on recurrent relations for different deterministic and stochastic characteristics of random graphs and on limit theorems for Markov chains with finite state set. Main aim of these paper is to decrease calculational complexity of considered problems solutions.
Keywords:
Planar graph, cross section, connectivity probability, recursive definition, calculational complexity, central limit theorem, law of large numbers
Pages: - WSEAS Transactions on Mathematics, ISSN / E-ISSN: 1109-2769 / 2224-2880, Volume 11, 2012DOI: *As the DOI is a unique identifier, it is already available in the pdf version.
**The DOI link will be activated in the first midst of January 2026.
, Art. #
×
Citation Tools