Investigating properties of random geometric graphs

C. Marshall; C. O'Riordan; J. Cruickshank

Investigating properties of random geometric graphs

Research output: Chapter in Book or Conference Publication/Proceeding › Conference Publication › peer-review

Abstract

For this paper we create random geometric graphs in the unit square and compare their properties with the Erdos-Ré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 Erdos-Ré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.

Original language	Undefined/Unknown
Title of host publication	Proceedings of the European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014 - Part of the Multi Conference on Computer Science and Information Systems, MCCSIS 2014
Editors	Jorg Roth, Ajith P. Abraham, Antonio Palma dos Reis
Publisher	IADIS
Pages	263-265
Number of pages	3
ISBN (Electronic)	9789898704108
Publication status	Published - 2014
Event	European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014 - Lisbon, Portugal Duration: 15 Jul 2014 → 17 Jul 2014

Publication series

Name	Proceedings of the European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014 - Part of the Multi Conference on Computer Science and Information Systems, MCCSIS 2014

Conference

Conference	European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014
Country/Territory	Portugal
City	Lisbon
Period	15/07/14 → 17/07/14

Keywords

Clustering coefficient
Random geometric graphs
Transitivity

Cite this

Marshall, C., O'Riordan, C., & Cruickshank, J. (2014). Investigating properties of random geometric graphs. In J. Roth, A. P. Abraham, & A. P. dos Reis (Eds.), Proceedings of the European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014 - Part of the Multi Conference on Computer Science and Information Systems, MCCSIS 2014 (pp. 263-265). (Proceedings of the European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014 - Part of the Multi Conference on Computer Science and Information Systems, MCCSIS 2014). IADIS.

Marshall, C. ; O'Riordan, C. ; Cruickshank, J. / Investigating properties of random geometric graphs. Proceedings of the European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014 - Part of the Multi Conference on Computer Science and Information Systems, MCCSIS 2014. editor / Jorg Roth ; Ajith P. Abraham ; Antonio Palma dos Reis. IADIS, 2014. pp. 263-265 (Proceedings of the European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014 - Part of the Multi Conference on Computer Science and Information Systems, MCCSIS 2014).

@inproceedings{1d36811bd0504a22af6c369df3144117,

title = "Investigating properties of random geometric graphs",

abstract = "For this paper we create random geometric graphs in the unit square and compare their properties with the Erdos-R{\'e}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 Erdos-R{\'e}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.",

keywords = "Clustering coefficient, Random geometric graphs, Transitivity",

author = "C. Marshall and C. O'Riordan and J. Cruickshank",

note = "Publisher Copyright: Copyright {\textcopyright} 2014 IADIS Press All rights reserved.; European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014 ; Conference date: 15-07-2014 Through 17-07-2014",

year = "2014",

language = "Undefined/Unknown",

series = "Proceedings of the European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014 - Part of the Multi Conference on Computer Science and Information Systems, MCCSIS 2014",

publisher = "IADIS",

pages = "263--265",

editor = "Jorg Roth and Abraham, \{Ajith P.\} and \{dos Reis\}, \{Antonio Palma\}",

booktitle = "Proceedings of the European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014 - Part of the Multi Conference on Computer Science and Information Systems, MCCSIS 2014",

}

Marshall, C, O'Riordan, C & Cruickshank, J 2014, Investigating properties of random geometric graphs. in J Roth, AP Abraham & AP dos Reis (eds), Proceedings of the European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014 - Part of the Multi Conference on Computer Science and Information Systems, MCCSIS 2014. Proceedings of the European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014 - Part of the Multi Conference on Computer Science and Information Systems, MCCSIS 2014, IADIS, pp. 263-265, European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014, Lisbon, Portugal, 15/07/14.

Investigating properties of random geometric graphs. / Marshall, C.; O'Riordan, C.; Cruickshank, J.
Proceedings of the European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014 - Part of the Multi Conference on Computer Science and Information Systems, MCCSIS 2014. ed. / Jorg Roth; Ajith P. Abraham; Antonio Palma dos Reis. IADIS, 2014. p. 263-265 (Proceedings of the European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014 - Part of the Multi Conference on Computer Science and Information Systems, MCCSIS 2014).

Research output: Chapter in Book or Conference Publication/Proceeding › Conference Publication › peer-review

TY - GEN

T1 - Investigating properties of random geometric graphs

AU - Marshall, C.

AU - O'Riordan, C.

AU - Cruickshank, J.

PY - 2014

Y1 - 2014

N2 - For this paper we create random geometric graphs in the unit square and compare their properties with the Erdos-Ré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 Erdos-Ré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.

AB - For this paper we create random geometric graphs in the unit square and compare their properties with the Erdos-Ré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 Erdos-Ré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.

KW - Clustering coefficient

KW - Random geometric graphs

KW - Transitivity

UR - https://www.scopus.com/pages/publications/84929408104

M3 - Conference Publication

T3 - Proceedings of the European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014 - Part of the Multi Conference on Computer Science and Information Systems, MCCSIS 2014

SP - 263

EP - 265

BT - Proceedings of the European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014 - Part of the Multi Conference on Computer Science and Information Systems, MCCSIS 2014

A2 - Roth, Jorg

A2 - Abraham, Ajith P.

A2 - dos Reis, Antonio Palma

PB - IADIS

T2 - European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014

Y2 - 15 July 2014 through 17 July 2014

ER -

Marshall C, O'Riordan C , Cruickshank J. Investigating properties of random geometric graphs. In Roth J, Abraham AP, dos Reis AP, editors, Proceedings of the European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014 - Part of the Multi Conference on Computer Science and Information Systems, MCCSIS 2014. IADIS. 2014. p. 263-265. (Proceedings of the European Conference on Data Mining 2014 and International Conferences on Intelligent Systems and Agents 2014 and Theory and Practice in Modern Computing 2014 - Part of the Multi Conference on Computer Science and Information Systems, MCCSIS 2014).

Investigating properties of random geometric graphs

Abstract

Publication series

Conference

Keywords

Other files and links

Cite this