2000 character limit reached
Strong times and first hitting
Published 23 Jun 2016 in math.PR | (1606.07244v1)
Abstract: We generalize the notion of strong stationary time and we give a representation formula for the hitting time to a target set in the general case of non-reversible Markov processes.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.