|
Title:
|
INVESTIGATING PROPERTIES OF RANDOM GEOMETRIC GRAPHS |
|
Author(s):
|
Christine Marshall, Colm ORiordan, James Cruickshank |
|
ISBN:
|
978-989-8704-10-8 |
|
Editors:
|
Ajith P. Abraham, Antonio Palma dos Reis and Jörg Roth |
|
Year:
|
2014 |
|
Edition:
|
Single |
|
Keywords:
|
Random geometric graphs, clustering coefficient, transitivity. |
|
Type:
|
Poster/Demonstration |
|
First Page:
|
263 |
|
Last Page:
|
265 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
For this paper we create random geometric graphs in the unit square and compare their properties with the Erd?sRényi model of random graphs. Graph properties of interest are described and explored and, in particular, the relationship between the network average clustering coefficient and transitivity is examined. Empirical data is presented which demonstrates that the transitivity measure approximates the network average clustering coefficient in the Erd?sRényi model but that these measures differ significantly in the random geometric graphs. This is of interest in areas such as spatial game theory since the way that nodes are clustered in a network may impact the adoption of learned behaviours or strategies and affect the spread of cooperation. |
|
|
|
|
|
|
