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-->infinity 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.

23 pages, 8 figures

References in corpus (9)

• Emergence of scaling in random networks
• The structure and function of complex networks
• Spatial Networks
• Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications
• Random Geometric Graphs
• Proximity Networks and Epidemics
• Worm Epidemics in Wireless Adhoc Networks
• Degree Correlations in Random Geometric Graphs
• Synchronization in Random Geometric Graphs

Cited by in corpus (16)

• Epidemic Spreading in Random Rectangular Networks
• Topological versus spectral properties of random geometric graphs
• Epidemic processes on self-propelled particles: continuum and agent-based modelling
• Normalized Sombor indices as complexity measures of random graphs
• Random geometric graphs in high dimension
• Random spherical graphs
• Connectivity Scaling Laws in Wireless Networks
• Geometrical and spectral study of $\beta$-skeleton graphs
• Random-Graph Models and Characterization of Granular Networks
• Non-uniform random graphs on the plane: A scaling study
• A Random-Line-Graph Approach to Overlapping Line Segments
• Isolation and connectivity in random geometric graphs with self-similar intensity measures
• Isotropic random geometric networks in two dimensions with a penetrable cavity
• Weighted random--geometric and random--rectangular graphs: Spectral and eigenfunction properties of the adjacency matrix
• On the extremal spectral properties of random graphs
• On the distribution of topological and spectral indices on random graphs