Acta Informatica

, Volume 39, Issue 2, pp 119–140 | Cite as

Stochastic cooperative distributed grammar systems and random graphs

  • Ján Gašo
  • Martin Nehéz
Original article


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.


Graph Theory Graph Model Random Graph Formal Language Alternative Definition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Ján Gašo
    • 1
  • Martin Nehéz
    • 2
  1. 1.University of Economics, Dept. of Applied Informatics, Dolnozemská 1/b, 852 35 Bratislava, Slovak Republic (e-mail: SK
  2. 2.Slovak University of Technology, Dept. of Computer Science and Engineering, Ilkovičova 3, 812 19 Bratislava, Slovak Republic (e-mail: SK

Personalised recommendations