Abstract

Speaker: Catherine Yan, Texas A&M University

Title: Random Geometric Graph Diameter in the Unit Ball

Abstract:

The unit ball random geometric graph G=G^d_p(L,n) has as its vertices n points distributed independently and uniformly in the unit ball in R^d, with two vertices adjacent if and only if their l_p-distance is at most L. In this talk we decide the connectivity threshold for such graphs, and give a tight asymptotic bound for the graph diameter.

Return to the seminar page.