| Popis: |
Graphs are a method of visualising data, in which data is shown in vertices and edges between them. Such graphs have many inherent characteristics which define said graph. This paper studies random graphs. A random graph is a graph that is generated by a random process. Such processes are called graph generation models. Graph characteristics are dependent on the model that the graph was created with. This paper studies such random graph models so that it would be possible to know which characteristics are guaranteed best by which models. Theoretical models are written in programs, which produces results that are compared with other models, or with modified versions of the original models. The aim of this paper is to accertain which models guarantee which characteristics in a most efficient way. The result of this paper is the ability to choose between random graph models depending on what characteristic you want to guarantee in that graph. |
