◊
Comparison of Relative Density of Two Random Geometric Digraph Families in
Testing Spatial Clustering. Accepted for publication in the TEST, 23(1):100-134, March 2014.
◊
The distribution of the relative arc density of a family of interval catch
digraph based on uniform data. Metrika, 75(6):761-793, July 2012.
◊ An
investigation of new graph invariants related to the domination number of
random proximity catch digraphs. Methodology and Computing in Applied
Probability,14(2): 299-334, April 2012.
◊
Extension of one-dimensional proximity regions to higher dimensions.
Computational Geometry: Theory and Applications, 43(9):721-748, November
2010. [This article is also featured at
http://www.verticalnews.com]
◊
A CLT for
a One-Dimensional Class Cover Problem.
Pengfei Xiang and John C. Wierman, 2009.
pdf
◊
The distribution of the domination number of class cover catch digraphs for
non-uniform one-dimensional data. Discrete Mathematics, 308:5376-5393,
December 2008.
pdf
◊
A General
SLLN for the One-Dimensional Class Cover Problem. Pengfei Xiang and John C. Wierman, 2008.
pdf
◊ A
new family of random graphs for testing spatial segregation (with C. E.
Priebe and D. J. Marchette). Canadian Journal of Statistics, 35(1):27-50,
February 2007.
pdf
◊ On
the distribution of the domination number of a new family of parameterized
random digraphs (with C. E. Priebe). Model Assisted Statistics and
Applications, 1(4):231-255, 2006.
pdf
◊
Relative density of the random r-factor proximity catch digraphs for testing
spatial patterns of segregation and association (with C. E. Priebe and J. C.
Wierman). Computational Statistics & Data Analysis, 50(8):1925-1964, April
2006.
pdf
◊ A New Family of Proximity Graphs: Class Cover Catch Digraphs.
Jason DeVinney and Carey E. Priebe, 2006.
pdf
◊
The use of domination number of a random proximity catch digraph for testing
spatial patterns of segregation and association (with C. E. Priebe).
Statistics & Probability Letters, 73, 37-50, June 2005.
pdf
◊ Limit Theory for the Domination Number of Random Class Cover Catch Digraphs. Pengfei Xiang and John C. Wierman, 2005. pdf
◊ Classification Using Class Cover Catch Digraphs. Carey E. Priebe, David J. Marchette, Jason DeVinney, and Diego Socolinsky, 2003. pdf
◊ Class Cover Catch Digraphs for Latent Class Discovery in Gene Expression Monitoring by DNA Microarrays. Carey E. Priebe, Jeffrey L. Solka, David J. Marchette, and B. Ted Clark, 2003. pdf
◊ Characterizing the Scale Dimension of a High Dimensional Classification Problem. David J. Marchette, and Carey E. Priebe, 2003. pdf
◊ A SLLN for a One-dimensional Class Cover Problem. Jason DeVinney and John C. Wierman, 2002. pdf
◊ On the Distribution of the Domination Number of Random Class Cover Catch Digraphs. Carey E. Priebe, David J Marchette and Jason DeVinney, 2001. pdf
Proceeding Articles in chronological order◊ Testing spatial clustering using relative density of two random geometric digraph families. 59th International Statistical Institute (ISI) World Statistics Congress, Hong Kong, China, August 25-30, 2013.
◊ The use of spatial graphs for optimal obstacle placement: A study on impact of the clutter spatial distribution (with V. Aksakalli). 59th ISI World Statistics Congress, Hong Kong, China, August 25-30, 2013.
◊ The use of central similarity proximity catch digraphs for testing multivariate spatial patterns (with C. E. Priebe and D. J. Marchette). 57th Session of the International Statistical Institute (ISI), Durban, South Africa, August 16-22, 2009.
◊ E. Ceyhan and C. E. Priebe, Central similarity proximity maps in Delaunay tessellations. Proceedings of the Joint Statistical Meeting, the Statistical Computing Section, American Statistical Association, San Francisco, CA, USA, August 3-7, 2003. pdf
◊ J. DeVinney, C. E. Priebe, D. J. Marchette, and D. Socolinsky, Random Walks and Catch Digraphs in Classification. 2002. pdf
Dissertations
◊ Limit Theory for the Domination Number of Random Class Cover Catch Digraphs. Pengfei Xiang. 2005. pdf
◊ An Investigation of Proximity Catch Digraphs in Delaunay Tessellations. Elvan Ceyhan. 2004. pdf
◊ The Class Cover Problem and its Applications in Pattern Recognition. Jason DeVinney. 2003. pdf
Talks
◊ Department Seminar, Domination number of a family of random geometric digraphs and its application to spatial clustering, Department of Applied Mathematics and Statistics, Johns Hopkins University, Baltimore, MD, USA, November 7, 2013.
◊ A new family of random geometric graphs: Theory and applications [also presented as a poster]. TWAS 12th General Conference and 23rd General Meeting, Tianjin, China, September 18-21, 2012.
◊ Seminar, Relative density of random proximity catch digraphs: Theory and applications, Department of Industrial Engineering, Çankaya University, December 24, 2010.
◊ Special Mathematics Seminar, Domination number of random proximity catch digraphs: Theory and applications (in Turkish Yakınlık yönlü çizgelerinin baskınlık sayısı: Teori ve uygulamalar), IMBM İstanbul Center for Mathematical Sciences İstanbul Discrete Mathematics Meetings, Boğaziçi University, November 26, 2010.
◊ Mathematics Seminar, The asymptotic distribution of the domination number of a geometric digraph family (in Turkish Geometrik bir yönlü çizge ailesinin baskınlık sayısının asimptotik dağılımı), Department of Mathematical Engineering, İstanbul Technical University, November 12, 2010.
◊ Seminar, The distribution of the domination number of a family of random catch digraphs based on one-dimensional data, The Fifth International Workshop in Applied Probability (IWAP 2010), Universidad Carlos III de Madrid, Colmenarejo Campus, July 5-8, 2010.
◊ Mathematics Seminar, A graph invariant of a random digraph family for testing multivariate spatial interaction, Department of Mathematics, İzmir University of Economics, May 7, 2010.
◊ Graduate Learning Seminar, A short synopsis on random graphs, spatial point patterns, and image analysis, Department of Mathematics, Koç University, November 2, 2009
◊ Statistics Seminar, Random proximity catch digraphs: Theory and applications - II, Department of Statistics, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil, September 25, 2009.
◊ Probability Seminar, Random proximity catch digraphs: Theory and applications - I, Institute of Mathematics and Statistics, Universidade de Sao Paulo, Sao Paulo, Brazil, September 24, 2009.
◊ Mathematics Seminar, Rassal yakınlık çizgeleri ve uygulamaları, Süleyman Demirel University, Isparta, Turkey, March 3, 2009.
◊ Presentation, The asymptotic distribution of the domination number of proximity catch digraphs (in Turkish Orantısal kenar yakınsal yönlü çizgelerin baskınlık sayısının asimptotik dağılımının hesaplanması). XXI. Ulusal Matematik Sempozyumu (21. National Mathematics Symposium), İstanbul, Turkey, September 1-4, 2008.
◊ Presentation, The asymptotic distribution of the domination number of proportional edge proximity catch digraphs. The 7th World Congress in Probability and Statistics, Singapore, July 14-19, 2008.
◊ Presentation, Extension of one-dimensional proximity maps to higher dimensions (in Turkish Tek-boyutlu yakınlık fonksiyonlarının daha üst boyutlara genelleştirilmesi). VI. Ulusal Geometri Sempozyumu (VI. National Geometry Symposium), Bursa, Turkey, July 1-4, 2008.
◊ Science-Math Seminar, A parameterized family of proximity catch digraphs in Delaunay tessellations and its use in testing spatial point patterns, Koç University, February 8, 2005.
◊ Invited Talk, The relative density of r-factor proportional-edge proximity catch digraphs and its application to spatial point patterns at Statistics Colloquium, George Mason University, January 28, 2005.
◊ Student Seminar, An investigation of proximity catch digraphs in Delaunay tessellations, Johns Hopkins University, October 1, 2004.
◊ Limit Theory for the Domination Number of Random Class Cover Catch Digraphs. Dissertation Defense: Pengfei Xiang. 2005. pdf
◊ An Investigation of Proximity Catch Digraphs in Delaunay Tessellations. Dissertation Defense: Elvan Ceyhan. 2004. pdf
◊ The Class Cover Problem and its Applications in Pattern Recognition. Dissertation Defense: Jason DeVinney. 2002. pdf
◊ E. Ceyhan, Proximity Catch Digraphs: Auxiliary Tools, Properties, and Applications (based on PhD thesis), VDM Verlag, Saarbrücken, Germany. ISBN:978-3-639-19063-2, 2009.
◊ E. Özel and E. Ceyhan, Extensions of domination number and their distribution for random interval catch digraph families. 8th World Congress in Probability and Statistics, Istanbul, Turkey, July 9-14, 2012.
◊ E. Özel and E. Ceyhan, The distribution of fractional domination number of a random digraph family based on one-dimensional uniform data. The Sixth International Conference on Probability and Statistics (PROBASTAT 2011), Bratislava, Slovakia, July 4-8, 2011.