Random Geometric Graphs
暂无分享，去创建一个
1. Introduction 2. Probabilistic ingredients 3. Subgraph and component counts 4. Typical vertex degrees 5. Geometrical ingredients 6. Maximum degree, cliques and colourings 7. Minimum degree: laws of large numbers 8. Minimum degree: convergence in distribution 9. Percolative ingredients 10. Percolation and the largest component 11. The largest component for a binomial process 12. Ordering and partitioning problems 13. Connectivity and the number of components References Index
[1] M. Penrose. A Central Limit Theorem With Applications to Percolation, Epidemics and Boolean Models , 2001 .
[2] R. Meester,et al. Continuum percolation: References , 1996 .
[3] J. Yukich,et al. Central limit theorems for some graphs in computational geometry , 2001 .
[4] M. Penrose. The longest edge of the random minimal spanning tree , 1997 .
[5] J. Dall,et al. Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.