Jesper Dall1, Michael Christensen
1Fysisk Institut, SDU-Odense Universitet, Campusvej 55, DK-5230 Odense M, Denmark. j.dall@fysik.sdu.dk
This study analyzes random geometric graphs, finding critical connectivity numerically. The derived cluster coefficient shows these graphs differ significantly from standard random graphs, even in high dimensions.
You might also read
Articles linked to this work by shared authors, journal, and citation graph.
Area of Science:
Background:
Purpose of the Study:
Main Methods:
Main Results:
Conclusions: