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: | , |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers
2022
|