Related Research Articles
In probability theory and related fields, a stochastic or random process is a mathematical object usually defined as a sequence of random variables in a probability space, where the index of the sequence often has the interpretation of time. Stochastic processes are widely used as mathematical models of systems and phenomena that appear to vary in a random manner. Examples include the growth of a bacterial population, an electrical current fluctuating due to thermal noise, or the movement of a gas molecule. Stochastic processes have applications in many disciplines such as biology, chemistry, ecology, neuroscience, physics, image processing, signal processing, control theory, information theory, computer science, and telecommunications. Furthermore, seemingly random changes in financial markets have motivated the extensive use of stochastic processes in finance.
Monte Carlo methods, or Monte Carlo experiments, are a broad class of computational algorithms that rely on repeated random sampling to obtain numerical results. The underlying concept is to use randomness to solve problems that might be deterministic in principle. The name comes from the Monte Carlo Casino in Monaco, where the primary developer of the method, physicist Stanislaw Ulam, was inspired by his uncle's gambling habits.
A Markov chain or Markov process is a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. Informally, this may be thought of as, "What happens next depends only on the state of affairs now." A countably infinite sequence, in which the chain moves state at discrete time steps, gives a discrete-time Markov chain (DTMC). A continuous-time process is called a continuous-time Markov chain (CTMC). Markov processes are named in honor of the Russian mathematician Andrey Markov.
A hidden Markov model (HMM) is a Markov model in which the observations are dependent on a latent Markov process. An HMM requires that there be an observable process whose outcomes depend on the outcomes of in a known way. Since cannot be observed directly, the goal is to learn about state of by observing By definition of being a Markov model, an HMM has an additional requirement that the outcome of at time must be "influenced" exclusively by the outcome of at and that the outcomes of and at must be conditionally independent of at given at time Estimation of the parameters in an HMM can be performed using maximum likelihood. For linear chain HMMs, the Baum–Welch algorithm can be used to estimate the parameters.
In statistics, Markov chain Monte Carlo (MCMC) is a class of algorithms used to draw samples from a probability distribution. Given a probability distribution, one can construct a Markov chain whose elements' distribution approximates it – that is, the Markov chain's equilibrium distribution matches the target distribution. The more steps that are included, the more closely the distribution of the sample matches the actual desired distribution.
David Harold Blackwell was an American statistician and mathematician who made significant contributions to game theory, probability theory, information theory, and statistics. He is one of the eponyms of the Rao–Blackwell theorem. He was the first African American inducted into the National Academy of Sciences, the first African American full professor at the University of California, Berkeley, and the seventh African American to receive a Ph.D. in mathematics. In 2012, President Barack Obama posthumously awarded Blackwell the National Medal of Science.
Stephen Elliott Fienberg was a professor emeritus in the Department of Statistics, the Machine Learning Department, Heinz College, and Cylab at Carnegie Mellon University. Fienberg was the founding co-editor of the Annual Review of Statistics and Its Application and of the Journal of Privacy and Confidentiality.
A hidden semi-Markov model (HSMM) is a statistical model with the same structure as a hidden Markov model except that the unobservable process is semi-Markov rather than Markov. This means that the probability of there being a change in the hidden state depends on the amount of time that has elapsed since entry into the current state. This is in contrast to hidden Markov models where there is a constant probability of changing state given survival in the state up to that time.
U. Narayan Bhat is an Indian-born Mathematician, known for his contributions to queueing theory and reliability theory.
Gareth Owen Roberts FRS FLSW is a statistician and applied probabilist. He is Professor of Statistics in the Department of Statistics and Director of the Centre for Research in Statistical Methodology (CRiSM) at the University of Warwick. He is an established authority on the stability of Markov chains, especially applied to Markov chain Monte Carlo (MCMC) theory methodology for a wide range of latent statistical models with applications in spatial statistics, infectious disease epidemiology and finance.
Robert Vincent ("Bob") Hogg was an American statistician and professor of statistics of the University of Iowa. Hogg is known for his widely used textbooks on statistics and on mathematical statistics. Hogg has received recognition for his research on robust and adaptive nonparametric statistics and for his scholarship on total quality management and statistics education.
Cyrus Derman was an American mathematician and amateur musician who did research in Markov decision process, stochastic processes, operations research, statistics and a variety of other fields.
Albert Turner Bharucha-Reid was an American mathematician and theorist who worked extensively on probability theory, Markov chains, and statistics. The author of more than 70 papers and 6 books, his work touched on such diverse fields as economics, physics, and biology.
In probability theory, Kemeny’s constant is the expected number of time steps required for a Markov chain to transition from a starting state i to a random destination state sampled from the Markov chain's stationary distribution. Surprisingly, this quantity does not depend on which starting state i is chosen. It is in that sense a constant, although it is different for different Markov chains. When first published by John Kemeny in 1960 a prize was offered for an intuitive explanation as to why the quantity was constant.
Stuart Alan Geman is an American mathematician, known for influential contributions to computer vision, statistics, probability theory, machine learning, and the neurosciences. He and his brother, Donald Geman, are well known for proposing the Gibbs sampler, and for the first proof of convergence of the simulated annealing algorithm.
Priscilla E. (Cindy) Greenwood is a Canadian mathematician who is a professor emeritus of mathematics at the University of British Columbia. She is known for her research in probability theory.
Richard Lewis Tweedie was an Australian statistician.
Wen-Yi Wendy Lou is a biostatistician who works as a professor in the Dalla Lana School of Public Health of the University of Toronto. Her research interests include the theory of runs and patterns in sequence data and applications of statistics to health care.
Luke Tierney is an American statistician and computer scientist. A fellow of the Institute of Mathematical Statistics since 1988 and of the American Statistical Association since 1991, Tierney is currently a professor of statistics at the University of Iowa. Through his past work on programming languages such as R and Lisp, Tierney now holds a position on the developing team known as the R Core.
Daniel S. Nettleton is an American statistical genomicist.
References
- ↑ "Dean L. Isaacson". Milaca High School. Retrieved 23 June 2024.
- 1 2 Krapfl, Anne (14 May 2009). "Honoring a previous leader". Iowa State University. Retrieved 23 June 2024.
- ↑ "Receptions: Dean Isaacson". Iowa State University. 19 May 2002. Retrieved 23 June 2024.
- ↑ "KOEHLER WILL DIRECT IOWA STATE'S STATISTICS DEPARTMENT". Iowa State University. 6 November 2002. Retrieved 23 June 2024.
- ↑ "Koehler Named Interim Chair of Department of Statistics". Iowa State University College of Agriculture and Life Sciences. 5 November 2002. Retrieved 23 June 2024.
- ↑ "Dean L Isaacson". Iowa State University Department of Statistics. Retrieved 23 June 2024.
- ↑ "ASA Fellows". American Statistical Association. Retrieved 23 June 2024.
- ↑ "Isaacson, DeHart to join hall of famers". Union-Times. 5 September 2013. Retrieved 23 June 2024.
- ↑ Reviews of Markov Chains: Theory and Applications include:
- Karr, Alan F. (July 1978). "Markov Chains: Theory and Applications (Dean L. Isaacson and Richard W. Madsen)". SIAM Review. 20 (3): 606–607. doi:10.1137/1020086. ProQuest 926182037
- Bartholomew, D. J. (March 1977). "Markov Chains: Theory and Applications. By D. L. Isaacson and R. W. Madsen. New York and London, Wiley, 1976. x, 256 p. 24·5 cm. £14·55". Royal Statistical Society. Journal. Series A: General. 140 (2): 244–245. doi:10.2307/2344895. JSTOR 2344895.
- Unwin, Anthony (1977). "Markov Chains — Theory and Applications". Journal of the Operational Research Society. 28 (1): 236–237. doi:10.1057/jors.1977.44.
- McGinnis, Robert (May 1977). "Reviewed Work: Markov Chains Theory and Applications. by Dean L. Isaacson, Richard W. Madsen". Contemporary Sociology. 6 (3). doi:10.2307/2064802. JSTOR 2064802. S2CID 117130350.
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
