Stochastic cooperative distributed grammar systems and random graphs
- 41 Downloads
We introduce an alternative definition of random graphs as a language generated by a stochastic cooperating distributed grammar system. We show a relationship between our definition and four known definitions of random graphs, an example of using our model to prove graph-theoretic properties, and we define k-probabilistic model of random graphs as an extension. The first important acquisition of our definition is that only a small modification of a stochastic cooperating distributed grammar system may effect the substantial change of the generated random graph model. Other important result resides in the fact that our approach enables the use of a new proving technique in the random graph theory which is based on the generative paradigm inherent in the formal languages theory.
KeywordsGraph Theory Graph Model Random Graph Formal Language Alternative Definition
Unable to display preview. Download preview PDF.