Cluster identification in nearest-neighbor graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4754 LNAI, Issue , 2007, Pages 196-210

  Maier, Markus ^a   Hein, Matthias ^a   Von Luxburg, Ulrike ^a  

^a MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; IDENTIFICATION (CONTROL SYSTEMS); PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING;

CLUSTER IDENTIFICATION; SUBGRAPHS;

GRAPH THEORY;

EID: 38149070951     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75225-7_18     Document Type: Conference Paper

References (9)

1. Bettstetter, C.: On the minimum node degree and connectivity of a wireless multihop network. In: Proceedings of MobiHoc, pp. 80-91 (2002)
2. Biau, G., Cadre, B., Pelletier, B.: A graph-based estimator of the number of clusters. ESIAM: Prob. and Stat. 11, 272-280 (2007)
3. Bollobas, B.: Random Graphs. Cambridge University Press, Cambridge (2001)
4. Bollobas, B., Riordan, O.: Percolation. Cambridge Universiy Press, Cambridge (2006)
5. Brito, M., Chavez, E., Quiroz, A., Yukich, J.: Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection. Stat. Probabil. Lett. 35, 33-42 (1997)
6. Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58, 13-30 (1963)
7. Kunniyur, S.S., Venkatesh, S.S.: Threshold functions, node isolation, and emergent lacunae in sensor networks. IEEE Trans. Inf. Th. 52(12), 5352-5372 (2006)
8. Maier, M., Hein, M., von Luxburg, U.: Cluster identification in nearest-neighbor graphs. Technical Report 163, MPI for Biological Cybernetics, Tübingen (2007)
9. Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003) Santi, P., Blough, D.: The critical transmitting range for connectivity in sparse wireless ad hoc networks. IEEE Trans.