The connectivity of a graph on uniform points on [0,1]d

By M. J. Appel, R. P. Russo. 2002

84 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Mathematical Physics, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/4b8a0183a2fbd872fb70cdc7100822cd5cfd57ae

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Omer Bobrowski
2. Primoz Skraba
3. Matthew Kahle
4. Robert J. Adler
5. D. Yogeshwaran
6. Michael Farber
7. Armindo Costa
8. Elizabeth Meckes

In Mathematical Physics

1. Omer Bobrowski
2. Primoz Skraba
3. Matthew Kahle
4. Michael Farber
5. Armindo Costa
6. Robert J. Adler
7. D. Yogeshwaran
8. Elizabeth Meckes

In Statistics and Probability

1. Primoz Skraba
2. Omer Bobrowski
3. Matthew Kahle

Citations in the corpus

• Maximally Persistent Cycles in Random Geometric Complexes (2015, methodology): “this area. The study of random persistent homology, on the other hand, is at its very initial stages. Recall that the 0-th homology represent the connected components in a space. Thus, the results in [3, 46] about the connectivity threshold in random geometric graphs could be viewed as related to th”