Random rectangular graphs

Ernesto Estrada, Matthew Sheerin

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0, 1]2 . The topological properties of the random rectangular graphs (RRGs) generated by this model are then studied as a function of the rectangle sides lengths a and b = 1/a, and the radius r used to connect the nodes. When a = 1 we recover the RGG, and when a → ∞ the very elongated rectangle generated resembles a one-dimensional RGG. We obtain here analytical expressions for the average degree, degree distribution, connectivity, average path length and clustering coefficient for RRG. These results provide evidence that show that most of these properties depend on the connection radius and the side length of the rectangle, usually in a monotonic way. The clustering coefficient, however, increases when the square is transformed into a slightly elongated rectangle, and after this maximum it decays with the increase of the elongation of the rectangle. We support all our findings by computational simulations that show the goodness of the theoretical models proposed for RRGs.
LanguageEnglish
Article number042805
Number of pages9
JournalPhysical Review E
Volume91
Issue number4
DOIs
Publication statusPublished - 21 Apr 2015

Fingerprint

rectangles
Rectangle
Random Geometric Graph
Graph in graph theory
Clustering Coefficient
Radius
Unit of area
Computational Simulation
radii
Geometric Model
Degree Distribution
Graph Model
Path Length
coefficients
Topological Properties
Elongation
Monotonic
Theoretical Model
Set of points
elongation

Keywords

  • random geometric graph
  • rectangle length
  • clustering coefficient
  • path length

Cite this

Estrada, E., & Sheerin, M. (2015). Random rectangular graphs. Physical Review E, 91(4), [042805]. https://doi.org/10.1103/PhysRevE.91.042805
Estrada, Ernesto ; Sheerin, Matthew. / Random rectangular graphs. In: Physical Review E. 2015 ; Vol. 91, No. 4.
@article{7b4e2c6613c140409b7a7afcf0b58914,
title = "Random rectangular graphs",
abstract = "A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0, 1]2 . The topological properties of the random rectangular graphs (RRGs) generated by this model are then studied as a function of the rectangle sides lengths a and b = 1/a, and the radius r used to connect the nodes. When a = 1 we recover the RGG, and when a → ∞ the very elongated rectangle generated resembles a one-dimensional RGG. We obtain here analytical expressions for the average degree, degree distribution, connectivity, average path length and clustering coefficient for RRG. These results provide evidence that show that most of these properties depend on the connection radius and the side length of the rectangle, usually in a monotonic way. The clustering coefficient, however, increases when the square is transformed into a slightly elongated rectangle, and after this maximum it decays with the increase of the elongation of the rectangle. We support all our findings by computational simulations that show the goodness of the theoretical models proposed for RRGs.",
keywords = "random geometric graph, rectangle length, clustering coefficient, path length",
author = "Ernesto Estrada and Matthew Sheerin",
year = "2015",
month = "4",
day = "21",
doi = "10.1103/PhysRevE.91.042805",
language = "English",
volume = "91",
journal = "Physical Review E",
issn = "1539-3755",
publisher = "American Physical Society",
number = "4",

}

Estrada, E & Sheerin, M 2015, 'Random rectangular graphs' Physical Review E, vol. 91, no. 4, 042805. https://doi.org/10.1103/PhysRevE.91.042805

Random rectangular graphs. / Estrada, Ernesto; Sheerin, Matthew.

In: Physical Review E, Vol. 91, No. 4, 042805, 21.04.2015.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Random rectangular graphs

AU - Estrada, Ernesto

AU - Sheerin, Matthew

PY - 2015/4/21

Y1 - 2015/4/21

N2 - A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0, 1]2 . The topological properties of the random rectangular graphs (RRGs) generated by this model are then studied as a function of the rectangle sides lengths a and b = 1/a, and the radius r used to connect the nodes. When a = 1 we recover the RGG, and when a → ∞ the very elongated rectangle generated resembles a one-dimensional RGG. We obtain here analytical expressions for the average degree, degree distribution, connectivity, average path length and clustering coefficient for RRG. These results provide evidence that show that most of these properties depend on the connection radius and the side length of the rectangle, usually in a monotonic way. The clustering coefficient, however, increases when the square is transformed into a slightly elongated rectangle, and after this maximum it decays with the increase of the elongation of the rectangle. We support all our findings by computational simulations that show the goodness of the theoretical models proposed for RRGs.

AB - A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0, 1]2 . The topological properties of the random rectangular graphs (RRGs) generated by this model are then studied as a function of the rectangle sides lengths a and b = 1/a, and the radius r used to connect the nodes. When a = 1 we recover the RGG, and when a → ∞ the very elongated rectangle generated resembles a one-dimensional RGG. We obtain here analytical expressions for the average degree, degree distribution, connectivity, average path length and clustering coefficient for RRG. These results provide evidence that show that most of these properties depend on the connection radius and the side length of the rectangle, usually in a monotonic way. The clustering coefficient, however, increases when the square is transformed into a slightly elongated rectangle, and after this maximum it decays with the increase of the elongation of the rectangle. We support all our findings by computational simulations that show the goodness of the theoretical models proposed for RRGs.

KW - random geometric graph

KW - rectangle length

KW - clustering coefficient

KW - path length

U2 - 10.1103/PhysRevE.91.042805

DO - 10.1103/PhysRevE.91.042805

M3 - Article

VL - 91

JO - Physical Review E

T2 - Physical Review E

JF - Physical Review E

SN - 1539-3755

IS - 4

M1 - 042805

ER -