Persistence Probabilities for Auto-Regressive Markov chains
Institut des Hautes Etudes Scientifiques (IHES) via YouTube
Python, Prompt Engineering, Data Science — Build the Skills Employers Want Now
Power BI Fundamentals - Create visualizations and dashboards from scratch
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore the mathematical analysis of first crossing times in auto-regressive Markov chains through this 53-minute research lecture from Institut des Hautes Etudes Scientifiques. Examine the investigation of zero-crossing behavior in auto-regressive Markov chains with atomless innovations, focusing on the random variable T representing the first crossing time. Learn about the log-concavity assumptions applied to innovation laws and discover how these conditions lead to log-convex probability distributions for positive drifts, establishing connections to Baxter-Spitzer factorization similar to random walk theory. Understand the contrasting behavior observed with negative drifts, where log-convexity properties break down completely. Delve into advanced conjectures regarding complete monotonicity of probability laws for positive drifts and the potential relationship between discrete Baxter-Spitzer factorization and continuous Wiener-Hopf factorization. Gain insights into cutting-edge research in probability theory and stochastic processes from Thomas Simon of Université de Lille, presented as part of the mathematical research community's ongoing exploration of Markov chain persistence phenomena.
Syllabus
Thomas Simon - Persistence probabilities for auto-regressive Markov chains
Taught by
Institut des Hautes Etudes Scientifiques (IHES)