Mark Daniel Ward

The Data Mine
Purdue University
1201 West State Street
West Lafayette, IN 47907-2057
[email protected]
[email protected]
phone: (765)496-9563
VRS: (765)248-6858

Current Position

I am a Professor of Statistics and (by courtesy) of Agricultural & Biological Engineering, Computer Science, Mathematics, and Public Health at Purdue University. My research is in probabilistic, combinatorial, and analytic techniques for the analysis of algorithms and data structures. I am also interested in data science, science of information, game theory, and large-scale computation. I currently serve as Director of The Data Mine and Interim Director of the Integrative Data Science Initiative.

Visiting Faculty Positions

École Polytechnique, Palaiseau, France
Invited Professor in the Algorithms and Models for Integrative Biology team, November-December 2015

The George Washington University, Washington, DC
(sabbatical) Adjunct Professor in the Department of Statistics, September 2013-May 2014

University of Maryland, College Park, MD
(sabbatical) Visiting Professor in the Department of Mathematics, July 2013-June 2014

Université de Paris 13, Villetaneuse, France
Invited Professor at the Laboratoire Informatique de Paris Nord (LIPN), February-March 2012

University of Pennsylvania
(postdoc) Lecturer in Mathematics, 2005-2007

Education

Purdue University
Ph.D., Mathematics with Specialization in Computational Science, May 2005
Dissertation: Analysis of the Multiplicity Matching Parameter in Suffix Trees
Advisor: Wojciech Szpankowski

University of Wisconsin-Madison
M.S., Applied Mathematical Sciences, May 2003
Thesis: Analysis of a Randomized Selection Algorithm

Denison University
B.S., Mathematics and Computer Science, summa cum laude, May 1999
Senior Honors Project: Mathematical Foundations for Performance Analysis

Publications

  1. Student Experiences within a Data Science Learning Community: A Communities of Practice Perspective, by Aparajita Jaiswal, Alejandra Magana, Joseph A. Lyon, Ellen Gundlach, and Mark D. Ward, Learning Communities Research and Practice, Volume 9, Issue 1 (2021).

  2. Work-in-Progress: Evaluating Student Experiences in a Residential Learning Community: A Situated Learning Perspective, by Aparajita Jaiswal, Joseph A. Lyon, Viranga Perera, Alejandra J. Magana, Ellen Gundlach, Mark D. Ward, accepted for publication in the American Society for Engineering Education (ASEE) Annual Conference (2021).

  3. Characterizing the psychosocial effects of participating on a year-long residential research-oriented learning community, by Alejandra J. Magana, Aparajita Jaiswal, Aasakiran Madamanchi, Loran C. Parker, Ellen Gundlach, Mark D. Ward, accepted for publication in Current Psychology (2021).

  4. The number of distinct adjacent pairs ingeometrically distributed words, by Margaret Archibald, Aubrey Blecher, Charlotte Brennan, Arnold Knopfmacher, Stephan Wagner, Mark Daniel Ward, 18 pages, accepted for publication in Discrete Mathematics and Theoretical Computer Science (2021).

  5. Research Experiences in the Statistics Living Learning Community, by Maggie Betz, Peter Boyd, Emily Damone, Christina DeSantiago, Kent Gauen, Katie Lothrop, Mikaela Meyer, Kristen Mori, Ashley Peterson, Mark Daniel Ward, 12 pages, provisionally accepted pending minor revisions, for forthcoming book on the Future of Undergraduate Research in Math, to be published by the MAA in 2021.

  6. The Data Mine: Enabling Data Science Across the Curriculum, by E. Gundlach and M. D. Ward, Journal of Statistics and Data Science Education, Volume 29 (2021), supplement, S74-S82.

  7. The Periodicity of Nim-Sequences in Two-Element Subtraction Games, by B. Benesh, J. Carter, D. Crabill, D. Coleman, J. Good, M. Smith, J. Travis, and M. D. Ward, INTEGERS: Electronic Journal of Combinatorial Number Theory, Volume 20 (2020), 6 pages (pdf).

  8. The Next Wave: We Will All Be Data Scientists, by M. Betz, E. Gundlach, E. Hillery, J. Rickus, and M. D. Ward, Statistical Analysis and Data Mining, volume 13 (2020), 544-547 (pdf).

  9. Asymptotic Analysis of the kth Subword Complexity, by L. Ahmadi and M. D. Ward, Entropy, Volume 22, Issue 2 (2020), 34 pages (pdf).

  10. Fostering Undergraduate Data Science, by F. Gokalp Yavuz and M. D. Ward, The American Statistician, volume 74 (2020), 8-16 (pdf).

  11. Purdue University: Statistics Living Learning Community, by L. C. Parker and M. D. Ward, Aligning Institutional Support for Student Success: Case Studies of Sophomore-Year Initiatives, National Resource Center for The First-Year Experience & Students in Transition, University of South Carolina, edited by Tracy Skipper, September 2019 (pdf).

  12. Undergraduate Data Science and Diversity at Purdue University, by E. Hillery, M. D. Ward, J. Rickus, A. Younts, P. Smith, and E. Adams, PEARC '19: Proceedings of the Practice and Experience in Advanced Research Computing on Rise of the Machines, July 2019, Article No. 88 (pdf).

  13. The Characterization of Tenable Pólya Urns, by A. Davidson and M. D. Ward, Statistics and Probability Letters, volume 135 (2018), 38-43 (pdf).

  14. Asymptotic Analysis of Sums of Powers of Multinomial Coefficients: A Saddle Point Approach, by G. Louchard and M. D. Ward, INTEGERS: Electronic Journal of Combinatorial Number Theory, volume 17 (2017), paper A47 (27 pages) (pdf).

  15. Building Bridges: The Role of an Undergraduate Mentor, by M. D. Ward, invited submission for The American Statistician, volume 71 (2017), 30-33 (pdf).

  16. On the Variety of Shapes in Digital Trees, by J. Gaither, H. Mahmoud, and M. D. Ward, Journal of Theoretical Probability, volume 30 (2017), 1225-1254 (pdf).

  17. Variance of the Internal Profile in Suffix Trees, by J. Gaither and M. D. Ward, Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, 12 pages (2016) (pdf).

  18. On the Asymptotic Probability of Forbidden Motifs on the Fringe of Recursive Trees, by M. Gopaladesikan, S. Wagner, and M. D. Ward, Experimental Mathematics, volume 25 (2016), 237-245 (pdf).

  19. Data Science in the Statistics Curricula: Preparing Students to "Think with Data," by J. Hardin, R. Hoerl, N. J. Horton, D. Nolan, B. Baumer, O. Hall-Holt, P. Murrell, R. Peng, P. Roback, D. Temple Lang, and M. D. Ward, The American Statistician, volume 69 (2015), 343-353 (pdf).

  20. Learning Communities and the Undergraduate Statistics Curriculum (A Response to "Mere Renovation Is Too Little Too Late" by George Cobb), by M. D. Ward, The American Statistician, volume 69 (2015), online supplement (pdf).

  21. The Truncated Geometric Election Algorithm : Duration of the Election, by G. Louchard and M. D. Ward, Statistics and Probability Letters, volume 101 (2015), 40-48 (pdf).

  22. Asymptotic Properties of Protected Nodes in Random Recursive Trees, by H. Mahmoud and M. D. Ward, Journal of Applied Probability, volume 52 (2015), 290-297 (pdf).

  23. Resolution of T. Ward’s Question and the Israel-Finch Conjecture. Precise Analysis of an Integer Sequence Arising in Dynamics, by J. Gaither, G. Louchard, S. Wagner, and M. D. Ward, Combinatorics, Probability, & Computing, volume 24 (2015), 195-215 (pdf).

  24. On Kotzig’s Nim, by X. L. Tan and M. D. Ward, INTEGERS: The Electronic Journal of Combinatorial Number Theory, volume 14 (2014), paper G6 (27 pages) (pdf).

  25. On a Leader Election Algorithm: Truncated Geometric Case Study, by R. Kalpathy and M. D. Ward, Statistics and Probability Letters, volume 87 (2014), 40-47 (pdf).

  26. Asymptotic Joint Normality of Counts of Uncorrelated Motifs in Recursive Trees by M. Gopaladesikan, H. M. Mahmoud, and M. D. Ward, Methodology and Computing in Applied Probability, volume 16 (2014), 863-884 (pdf).

  27. Building Random Trees from Blocks, by M. Gopaladesikan, H. M. Mahmoud, and M. D. Ward, Probability in the Engineering and Informational Sciences, volume 28 (2014), 67-81 (pdf).

  28. The Variance of the Number of 2-Protected Nodes in a Trie, by J. Gaither and M. D. Ward, The Tenth Workshop on Analytic Algorithmics and Combinatorics (2013), 43-51 (pdf).

  29. Analytic Methods for Select Sets, by J. Gaither and M. D. Ward, Probability in the Engineering and Informational Sciences, volume 26 (2012), 561-568 (pdf).

  30. Asymptotic Distribution of Two-Protected Nodes in Random Binary Search Trees, by H. M. Mahmoud and M. D. Ward, Applied Mathematics Letters, volume 25 (2012), 2218-2222 (pdf).

  31. Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf, by J. A. Fill, S. Janson, and M. D. Ward, Electronic Journal of Combinatorics, volume 19(2), article P18, 2012 (pdf).

  32. On the Number of 2-Protected Nodes in Tries and Suffix Trees, by J. Gaither, Y. Homma, M. Sellke, and M. D. Ward, Discrete Mathematics and Theoretical Computer Science, volume AQ (2012), 381-398 (pdf).

  33. Asymptotic Analysis of the Nörlund and Stirling Polynomials, by M. D. Ward, Applicable Analysis and Discrete Mathematics, volume 6 (2012), 95-105 (pdf).

  34. Number of survivors in the presence of a demon, by G. Louchard, H. Prodinger, and M. D. Ward, Periodica Mathematica Hungarica, volume 64 (2012), 101-117 (pdf).

  35. Towards the variance of the profile of suffix trees, by P. Nicodeme and M. D. Ward, Report of the Mini-Workshop on Random Trees, Information and Algorithms, from Mathematisches Forschungsinstitut Oberwolfach, Report 23/2011, pages 1269-1272 (pdf).

  36. Asymptotic properties of a leader election algorithm, by R. Kalpathy, H. M. Mahmoud, and M. D. Ward, Journal of Applied Probability, volume 48 (2011), 569-575 (pdf).

  37. Asymptotic rational approximation to Pi: Solution of an "Unsolved Problem" posed by Herbert Wilf, by M. D. Ward, Discrete Mathematics and Theoretical Computer Science, volume AM (2010), 591-602 (pdf).

  38. Inverse auctions: Injecting unique minima into random sets, by F. T. Bruss, G. Louchard, and M. D. Ward, ACM Transactions on Algorithms, volume 6, Article 21, December 2009, 19 pages (pdf). (See the previous version for full details before we did significant editing/trimming for publication.)

  39. On the shape of the fringe of various types of random trees, by M. Drmota, B. Gittenberger, A. Panholzer, H. Prodinger, and M. D. Ward, Mathematical Methods in the Applied Sciences, volume 32 (2009), 1207-1245 (pdf).

  40. Exploring data compression via binary trees, by M. D. Ward, Resources for Teaching Discrete Mathematics, MAA Notes volume 74 (Mathematical Association of America, 2009), 143-150 (pdf).

  41. Average-case analysis of cousins in m-ary tries, by H. M. Mahmoud and M. D. Ward, Journal of Applied Probability, volume 45 (2008), 888-900 (pdf).

  42. On correlation polynomials and subword complexity, by I. Gheorghiciuc and M. D. Ward, Discrete Mathematics and Theoretical Computer Science, volume AH (2007), 1-18 (pdf).

  43. Error resilient LZ'77 data compression: algorithms, analysis, and experiments, by S. Lonardi, W. Szpankowski, and M. D. Ward, IEEE Transactions on Information Theory, volume 53, May 2007, 1799-1813 (pdf).

  44. The average profile of suffix trees, by M. D. Ward, The Fourth Workshop on Analytic Algorithmics and Combinatorics (2007), 183-193 (pdf).

  45. Exploring the average values of Boolean functions via asymptotics and experimentation, by R. Pemantle and M. D. Ward, The Third Workshop on Analytic Algorithmics and Combinatorics (2006), 253-262 (pdf).

  46. Analysis of the multiplicity matching parameter in suffix trees, by M. D. Ward and W. Szpankowski, Discrete Mathematics and Theoretical Computer Science, volume AD (2005), 307-322 (pdf).

  47. Analysis of the average depth in a suffix tree under a Markov model, by J. Fayolle and M. D. Ward, Discrete Mathematics and Theoretical Computer Science, volume AD (2005), 95-104 (pdf).

  48. The number of distinct values of some multiplicity in sequences of geometrically distributed random variables, by G. Louchard, H. Prodinger, and M. D. Ward, Discrete Mathematics and Theoretical Computer Science, volume AD (2005), 231-256 (pdf).

  49. Error resilient LZ'77 scheme and its analysis, by S. Lonardi, W. Szpankowski, and M. D. Ward, Proceedings of the 2004 IEEE International Symposium on Information Theory (2004), 56 (pdf).

  50. Analysis of a randomized selection algorithm motivated by the LZ'77 scheme, by M. D. Ward and W. Szpankowski, The First Workshop on Analytic Algorithmics and Combinatorics (2004), 153-160 (pdf).