Cover Image

Lower and Upper Expected Hitting Times for Weighted Imprecise Markov Chains

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sangalli, Marco, Krak, Thomas
Format:	Preprint
Published:	2026
Subjects:	Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Computing Lower and Upper Hitting Probabilities for Imprecise Markov Chains
by: Sangalli, Marco, et al.
Published: (2025)

Relation between Hitting Times and Probabilities for Imprecise Markov Chains
by: Sangalli, Marco, et al.
Published: (2026)

Upper Expected Meeting Times for Interdependent Stochastic Agents
by: Sangalli, Marco, et al.
Published: (2025)

Towards conservative inference in credal networks using belief functions: the case of credal chains
by: Sangalli, Marco, et al.
Published: (2025)

Reversible Imprecise Markov Chains
by: Škulj, Damjan
Published: (2025)

Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains
by: Mertens, Hannah, et al.
Published: (2024)

On a Class of Partitions with Lower Expected Star Discrepancy and Its Upper Bound than Jittered Sampling
by: Xu, Xiaoda, et al.
Published: (2025)

Talagrand Meets Talagrand: Upper and Lower Bounds on Expected Soft Maxima of Gaussian Processes with Finite Index Sets
by: Chu, Yifeng, et al.
Published: (2025)

Tighter Bounds on the Expected Absorbing Time of Ungarian Markov Chains
by: Shen, Eric
Published: (2024)

Imprecise Markov Semigroups and their Ergodicity
by: Caprio, Michele, et al.
Published: (2024)

Last Hitting Time Distributions for Solvable Diffusions
by: Campolieti, Giuseppe, et al.
Published: (2025)

High-Precision Framework for Expected Hitting Times Analysis in the Dice-Sum Process
by: Krityakierne, Tipaluck, et al.
Published: (2026)

Perturbations of Markov Chains
by: Rudolf, Daniel, et al.
Published: (2024)

Can a Higher Order Markov Chain Be Treated as a First Order Markov Chain?
by: Xu, Jianhong
Published: (2025)

Non Asymptotic Mixing Time Analysis of Non-Reversible Markov Chains
by: Naeem, Muhammad Abdullah
Published: (2025)

Optimistic Estimation of Convergence in Markov Chains with the Average-Mixing Time
by: Wolfer, Geoffrey, et al.
Published: (2024)

Propagation of Chaos for Nonlinear Markov Chains
by: Vuckovic, James
Published: (2026)

Algorithmic Randomness in Continuous-Time Markov Chains
by: Huang, Xiang, et al.
Published: (2019)

Approximations of Geometrically Ergodic Reversible Markov Chains
by: Negrea, Jeffrey, et al.
Published: (2017)

Expected First Return Times for Random Walks on Bounded Grids
by: An, Nan
Published: (2025)

Markov Chains with Rewinding
by: Azarmehr, Amir, et al.
Published: (2026)

The Importance Markov Chain
by: Andral, Charly, et al.
Published: (2022)

Neural Continuous-Time Markov Chain: Discrete Diffusion via Decoupled Jump Timing and Direction
by: Li, Jingyuan, et al.
Published: (2026)

The Law of Large Numbers for Time-inhomogeneous Markov Chains under General Conditions
by: Lau, Aaron, et al.
Published: (2026)

Entropy Contractions in Markov Chains: Half-Step, Full-Step and Continuous-Time
by: Caputo, Pietro, et al.
Published: (2024)

The Arnoldi Aggregation for Approximate Transient Distributions of Markov Chains
by: Sonnentag, Patrick, et al.
Published: (2025)

Towards a Banach Space Chernoff Bound for Markov Chains via Chaining Arguments
by: Rao, Shravas
Published: (2025)

Continuity for Limit Profiles of Reversible Markov Chains
by: Nestoridi, Evita
Published: (2025)

A Lower Bound on the Expected Number of Distinct Patterns in a Random Permutation
by: Borrás-Serrano, Verónica, et al.
Published: (2026)

Geometry and Duality of Alternating Markov Chains
by: Mithal, Deven, et al.
Published: (2024)

Hitting time mixing for the random transposition walk
by: Jain, Vishesh, et al.
Published: (2024)

Finding the Smallest Possible Exact Aggregation of a Markov Chain
by: Sonnentag, Patrick
Published: (2025)

Perturbation Analysis of Markov Chain Monte Carlo for Graphical Models
by: Lin, Na, et al.
Published: (2023)

A Unified Stability Theory for Classical and Monotone Markov Chains
by: Kamihigashi, Takashi, et al.
Published: (2024)

Estimation of First Returning Speed in Null Recurrent Continuous-Time Markov Chains
by: Wang, Huixi, et al.
Published: (2025)

On the Precision of the Spectral Profile Bound for the Mixing Time of Continuous State Markov Chains
by: Sichani, Elnaz Karimian, et al.
Published: (2024)

Hitting times in the binomial random graph
by: Granet, Bertille, et al.
Published: (2024)

Hitting probability for Reflected Brownian Motion at Small Target
by: Fan, Yuchen
Published: (2024)

Hitting Probabilities and the Ekstr{ö}m-Persson conjecture
by: Järvenpää, Esa, et al.
Published: (2025)

Graph Disjointness with Applications to Reversible Markov Chains
by: Xiang, Yang, et al.
Published: (2026)