1 citations · 1 across the 5 of their papers we have counts for
5 papers
The Escape Rate of Favorite Edges of Simple Random Walk
Chen-Xu Hao
Consider a simple symmetric random walk on the integer lattice . Let denote a favorite edge of the random walk at time . In this paper, we study the escape ra…
Favorite Downcrossing Sites of One-Dimensional Simple Random Walk
Chen-Xu Hao, Ze-Chun Hu, Ting Ma +1
Random walk is a very important Markov process and has important applications in many fields.For a one-dimensional simple symmetric random walk , a site is called a favo…
Three Favorite Edges Occurs Infinitely Often for One-Dimensional Simple Random Walk
Chen-Xu Hao, Ze-Chun Hu, Ting Ma +1
For a one-dimensional simple symmetric random walk , an edge (between points and ) is called a favorite edge at time if its local time at achieves the m…
Limiting behaviors for longest consecutive switches in an IID Bernoulli sequence
Chen-Xu Hao, Ting Ma
In this paper we mainly discuss sharp lower and upper bounds for the length of longest consecutive switches in IID Bernoulli sequences. This work is an extension of results in Erdő…
On the length of the longest consecutive switches
Chen-Xu Hao, Ze-Chun Hu, Ting Ma
An unbiased coin is tossed times independently and sequentially. In this paper, we will study the length of the longest consecutive switches, and prove that the limit behaviors…