Markov processes

Kemeny's constant

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. (Wikipedia).

Video thumbnail

Birth of BASIC

Professors John Kemeny and Tom Kurtz along with a band of Dartmouth undergraduates invent the Basic computer language.

From playlist Development

Video thumbnail

Gravitation (13 of 17) Orbital Velocity at the Surface of the Earth

This videos explains how to determine the velocity that an object, one meter above the Earth's surface, must be projected horizontally so that it will go all of the way around the Earth and come back to the same place. Calculate orbital velocity one meter above the Earth's surface. The o

From playlist Gravitation: Orbital Velocity, Orbital Period, Potential Energy, Kinetic Energy, Mass and Weight

Video thumbnail

6.5 The Conservation of Mechanical Energy

This video covers Section 6.5 of Cutnell & Johnson Physics 10e, by David Young and Shane Stadler, published by John Wiley and Sons. The lecture is part of the course General Physics - Life Sciences I and II, taught by Dr. Boyd F. Edwards at Utah State University. This video was produced

From playlist Lecture 6B. Work and Energy

Video thumbnail

Michael Kemeny: The moduli of singular curves on K3 surfaces

In this talk we will study the moduli space Zg of smooth genus g curves admitting a singular model on a K3 surface. Using the Mori-Mukai approach of rank two, non-Abelian Brill-Noether loci we will work out the dimension of Zg, and further we will work out the Brill-Noether theory of curve

From playlist HIM Lectures: Junior Trimester Program "Algebraic Geometry"

Video thumbnail

Monster Foam Elephant's Toothpaste- Cool Science Experiment

It has become tradition here at 9News for Steve Spangler to invite his three young scientists to join him at the end of the year to share their favorite experiment. Judging from their holiday caps, it looks like Steve and Mark are in for some holiday science cheer. About Steve Spangler

From playlist Holiday Experiments

Video thumbnail

Ronnie Nagloo 9/19/14 Part 3

Title: Model Theory and the Painlevé Equations

From playlist Fall 2014

Video thumbnail

Random walks on hyperbolic groups (Lecture 4) by Peter Haissinsky

Program Probabilistic Methods in Negative Curvature ORGANIZERS: Riddhipratim Basu, Anish Ghosh and Mahan Mj DATE: 11 March 2019 to 22 March 2019 VENUE: Madhava Lecture Hall, ICTS, Bangalore The focal area of the program lies at the juncture of three areas: Probability theory o

From playlist Probabilistic Methods in Negative Curvature - 2019

Video thumbnail

The Computer Chronicles - Robotics (1983)

Special thanks to archive.org for hosting these episodes. Downloads of all these episodes and more can be found at: http://archive.org/details/computerchronicles

From playlist The Computer Chronicles 1983 Episodes

Video thumbnail

A Discussion on General Relativity by Students of John Wheeler and Bob Dicke

General Relativity at 100: Institute for Advanced Study and Princeton University Celebrate the Enduring Reach, Power and Mysteries of Einstein’s Theory A Discussion on General Relativity by Students of John Wheeler and Bob Dicke - November 5, 2015 https://www.ias.edu/gr100 Albert Einste

From playlist General Relativity at 100

Video thumbnail

Trusted Computing Rants, Regrets, and Research

Professor Sean Smith (Department of Computer Science, Dartmouth College) discusses how we build trustworthy hardware, and how can we use that to increase the trustworthiness of broader distributed computation. He presents some things he's learned so far in academia, government, start-up, a

From playlist Center for Applied Cybersecurity Research (CACR)

Related pages

Stochastic matrix | Expected value | Probability theory | Maximum principle | Markov chain