Abstract Sources Results and Conclusions Jessica Porath  Department of Mathematics  University of Wisconsin-Eau Claire Faculty Mentor: Dr. Don Reynolds.

Slides:



Advertisements
Similar presentations
Markov chains Assume a gene that has three alleles A, B, and C. These can mutate into each other. Transition probabilities Transition matrix Probability.
Advertisements

ETSU Fall 2014 Enrollment Projections
Academic Scholars/Other Scholarships PHF Conference Center July 22, 2014 Oklahoma State Regents for Higher Education.
Prologue x2OZYhttp:// x2OZY.
Overview of Actions Taken by the NCAA Division I Board of Directors – October 2011 Adopted increased initial-eligibility standards. Adopted increased two-year.
Continuous-Time Markov Chains Nur Aini Masruroh. LOGO Introduction  A continuous-time Markov chain is a stochastic process having the Markovian property.
1 A class of Generalized Stochastic Petri Nets for the performance Evaluation of Mulitprocessor Systems By M. Almone, G. Conte Presented by Yinglei Song.
Fundamental Introduction NCAA Division III Bylaw 14
Topics Review of DTMC Classification of states Economic analysis
Our Group Members Ben Rahn Janel Krenz Lori Naiberg Chad Seichter Kyle Colden Ivan Lau.
11 - Markov Chains Jim Vallandingham.
10.3 Absorbing Markov Chains
Андрей Андреевич Марков. Markov Chains Graduate Seminar in Applied Statistics Presented by Matthias Theubert Never look behind you…
Markov Processes MBAP 6100 & EMEN 5600 Survey of Operations Research Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder,
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 16-1 © 2006 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 16.
Planning under Uncertainty
Markov Analysis Chapter 16
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 60 Chapter 8 Markov Processes.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Discrete time Markov chains (Sec )
CSE 3504: Probabilistic Analysis of Computer Systems Topics covered: Discrete time Markov chains (Sec )
Nonlinear Filtering of Stochastic Volatility Aleksandar Zatezalo, University of Rijeka, Faculty of Philosophy in Rijeka, Rijeka, Croatia
INDR 343 Problem Session
From Recruitment to Retention: Focusing Campus Efforts to Promote Transfer Student Success National Institute for the Study of Transfer Students January.
A Comparison of Basic Math Education in China and the United States.
A Longitudinal Analysis of the College Transfer Pathway at McMaster Karen Menard Ying Liu Jin Zhang Marzena Kielar Office of Institutional Research and.
The Impact of CReSIS Summer Research Programs that Influence Students’ Choice of a STEM Related Major in College By: Alica Reynolds, Jessica.
Exploring Honors Students’ Levels of Academic Motivation, Perfectionism, and Test Anxiety Hannah Geis, Kelly Hughes, and Brittany Weber, Faculty Advisor:
The Fractal World of Student Engagement 26 th Annual Georgia Perimeter College Mathematics Conference February 15, 2013 Patricia (Patti) Gregg, Ph.D. Acting.
June 17, % of our high school students indicate their intention to go on to college. - OUS Post High School Plan Survey, 2003.
ISECON 2008 Strategies for Increasing IT Enrollment: Recruiting, Retaining and Encouraging the Transfer of Women and Underrepresented Groups to Four-Year.
Public Management Quantitative Method in HRM Monday, October 05, 2015 Hun Myoung Park, Ph.D. Public Management & Policy Analysis Program Graduate School.
2.4 Sequences and Summations
Student Affairs 08/10. Enrollment 11,648 undergraduate students –9,855 Full Time –1,793 Part Time 2,222 graduate students –1,237 Full Time – 985 Part.
Robert Edge  Dr. James Walker  Mathematics  University of Wisconsin-Eau Claire Universal Image Quality PSNR IQI BEST IQI BOATASWDRJPEGASWDRJPEG 1:
The 29th Conference ARAB-ACRAO 29 March - 3 April 2009 Comparison of Student Flow in Different Colleges of Kuwait University Using Absorbing Markov Analysis.
Abstract: The definition of effective teaching is fluid and dependent on the teaching environment and its community members (faculty, students and administrators).
PHARMACOECONOMIC EVALUATIONS & METHODS MARKOV MODELING IN DECISION ANALYSIS FROM THE PHARMACOECONOMICS ON THE INTERNET ®SERIES ©Paul C Langley 2004 Maimon.
Cost Benefits of Dual Enrollment By: Jessica Key Cost Benefits of Dual Enrollment By: Jessica Key.
Undergraduate Academic Advising UNDERGRADUATE ACADEMIC ADVISING AT September 2015.
Relevant Subgraph Extraction Longin Jan Latecki Based on : P. Dupont, J. Callut, G. Dooms, J.-N. Monette and Y. Deville. Relevant subgraph extraction from.
Discrete Time Markov Chains
High School Transition Lesson ECAPs Important Terms Graduation requirements.
Markov Chains and Absorbing States
Applicant’s Profile Study for Improving Undergraduate Enrollment at the University of Puerto Rico at Mayagüez Dr. David González Barreto Dr. Antonio A.
Markov Chains Part 4. The Story so far … Def: Markov Chain: collection of states together with a matrix of probabilities called transition matrix (p ij.
Markov Chains Part 3. Sample Problems Do problems 2, 3, 7, 8, 11 of the posted notes on Markov Chains.
10.1 Properties of Markov Chains In this section, we will study a concept that utilizes a mathematical model that combines probability and matrices to.
Stochastic Processes and Transition Probabilities D Nagesh Kumar, IISc Water Resources Planning and Management: M6L5 Stochastic Optimization.
Abstract Sources Results and Conclusions Jessica Porath  Department of Mathematics  University of Wisconsin-Eau Claire Faculty Mentor: Dr. Don Reynolds.
11. Markov Chains (MCs) 2 Courtesy of J. Bard, L. Page, and J. Heyl.
15 October 2012 Eurecom, Sophia-Antipolis Thrasyvoulos Spyropoulos / Absorbing Markov Chains 1.
Goldstein/Schnieder/Lay: Finite Math & Its Applications, 9e 1 of 60 Chapter 8 Markov Processes.
Chapter 9: Markov Processes
Comparative Analysis of Aggregate Educational Data Between Children in Foster Care and the General Population Florida Department of Children and Families.
Grade statistics Libby Shapira, ICBS
Crowley ISD Freshman College Preparation Plan Robert L. Young Postsecondary Coordinator.
Background Results Conclusions Method
Community College of Baltimore County
The Basics of High School
Markov Chains.
The Basics of High School
2016 MI AIR Conference Holland Michigan Presenters:
Chapter 5 Markov Analysis
Lecture 4: Algorithmic Methods for G/M/1 and M/G/1 type models
Academic Advising College of Engineering and Computing Fall 2018.
Applying FERPA in Real Life Settings
Slides by John Loucks St. Edward’s University.
CS723 - Probability and Stochastic Processes
Predicting Student Enrollment Using Markov Chain Modeling in SAS
Presentation transcript:

Abstract Sources Results and Conclusions Jessica Porath  Department of Mathematics  University of Wisconsin-Eau Claire Faculty Mentor: Dr. Don Reynolds Jessica Porath  Department of Mathematics  University of Wisconsin-Eau Claire Faculty Mentor: Dr. Don Reynolds Markov Chains and Student Academic Progress Developing the Transition Matrix  For a student who graduated from 1999 though 2005, the average expected amount of time spent at UWEC was generally decreasing.  Based on the mean of the data for graduates between 1999 and 2005, a student enrolling in UWEC as a freshman can expect to spend an average of years before graduating.  The fundamental matrix also gives information about the expected time until graduation for students entering UWEC as a sophomore, junior, or senior. With data obtained from enrollment records, absorbing Markov chains are used to model the academic progress of students attending the University of Wisconsin-Eau Claire over a specific period of time. Useful statistics, such as the amount of time a student enrolling in UWEC as a freshman can expect to spend before graduating, are derived from the Markov model. With this information, the University may more accurately measure the academic progress of its students, and thus better reflect on its own institutional effectiveness. An absorbing Markov chain consists of:  A list of a finite number, r, of states of existence from which there are periodic transitions  At least one of these states is an absorbing state where, once reached, it is impossible to leave.  Transition from each non-absorbing state to some absorbing state is possible and the probability that the process will eventually reach an absorbing state is 1.  A transition matrix P= [p ij ]  M(r,r)  The entry p ij is the probability of moving from the i th state to the j th state.  If the states are numbered so that the absorbing states are listed first then the transition matrix will be of the following form: P =  Then the matrix P n = gives the probabilities of moving between states after n steps.  Thus, the Q n submatrix is the portion of the transition matrix corresponding to the nonabsorbing states such that each entry gives the frequency of a visit to that position after n steps.  In order to calculate the total number of visits to a specific state until absorption, we need to sum the same entry for every possible power of Q. Thus, if the system begins in the j th nonabsorbing state, the expected number of visits to the i th nonabsorbing state is the ij-entry of I + Q + Q 2 + Q  This series of matrices will converge in the sense that the entries of the partial sums each converge.  In strict analogy with the convergence of the geometric series of real numbers, this geometric series of matrices converges to (I-Q) -1 (called the fundamental matrix) provided that each entry in Q is less than 1.  Four non-absorbing states:  Freshman Class (fewer than 30 credits)  Sophomore Class (30 to 59 credits)  Junior Class (60 to 89 credits)  Senior Class (90 or more credits)  One absorbing state (way a student may leave the system):  Graduation  Data files were obtained from the UWEC Registrar’s Office that identified the entrance year and the class rank for every student enrolled from 1997 through The entries in P were determined by analyzing these data.  The following assumptions were then made:  Only full-time students were considered. A student in the same class (except for the Senior class) for three years was assumed not to be full-time.  Students who transferred or dropped out permanently were not considered.  Senior class students who failed to return were assumed to have graduated.  The entries in the transition matrix are the weighted averages of the probabilities of moving from one state to another from 1999 to P =  Then the fundamental matrix is: (I-Q) -1 = =  The sum of the entries in the diagonal of the fundamental matrix will give us the average amount of time a student enrolling in UWEC as a freshman can expect to spend before graduating.  = years Background We would like to thank the Office of Research and Sponsored Programs at the University of Wisconsin- Eau Claire for supporting our research.  Maki, Daniel P., and Thompson Maynard. Mathematical Models and Applications. New Jersey: Prentice-Hall,  Messer, Robert. Linear Algebra: The Gateway to Mathematics. New York: Harper Collins College,  Williams, Gareth. Linear Algebra with Applications. Massachusetts: Jones and Bartlett Publishers, Future Research Directions Further studies are being done to investigate how demographics affect a student’s academic progress. We are using the same Markov model, but instead of looking at the entire group of full-time students, we will examine specific groups based on gender and ethnicity. Lastly, we will compare the statistics derived from the models of these groups with each other and with the general results we previously calculated.