Structural complexity of one-dimensional random geometric graphs
We study the richness of the ensemble of graphical structures (i.e., unlabeled graphs) of the one-dimensional random geometric graph model defined by n nodes randomly scattered in [0, 1] that connect if they are within the connection range r∈[0,1] . We provide bounds on the number of possible struct...
Main Authors: | Badiu, M-A, Coon, JP |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers
2022
|
Similar Items
-
On the distribution of random geometric graphs
by: Badiu, M, et al.
Published: (2018) -
Kolmogorov basic graphs and their application in network complexity analysis
by: Farzaneh, A, et al.
Published: (2021) -
On the Fourier Coefficients of High-Dimensional Random Geometric Graphs
by: Bangachev, Kiril, et al.
Published: (2024) -
On the chromatic number of random geometric graphs
by: McDiarmid, C, et al.
Published: (2011) -
On the chromatic number of random geometric graphs
by: McDiarmid, C, et al.
Published: (2011)