Search Results

You are looking at 1 - 3 of 3 items for :

  • "hitting time" x
  • All content x
Clear All

We show that in almost every random graph process, the hitting time for havingk edge-disjoint spanning trees equals the hitting time for having minimum degreek.

Restricted access

Abstract  

Firstly, we compute the distribution function for the hitting time of a linear time-dependent boundary ta + bt, a ≥ 0, b ∈ ℝ, by a reflecting Brownian motion. The main tool hereby is Doob’s formula which gives the probability that Brownian motion started inside a wedge does not hit this wedge. Other key ingredients are the time inversion property of Brownian motion and the time reversal property of diffusion bridges. Secondly, this methodology can also be applied for the three-dimensional Bessel process. Thirdly, we consider Bessel bridges from 0 to 0 with dimension parameter δ > 0 and show that the probability that such a Bessel bridge crosses an affine boundary is equal to the probability that this Bessel bridge stays below some fixed value.

Restricted access

Abstract  

Let {X n d }n≥0be a uniform symmetric random walk on Zd, and Π(d) (a,b)={X n d ∈ Zd : a ≤ n ≤ b}. Suppose f(n) is an integer-valued function on n and increases to infinity as n↑∞, and let

\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$E_n^{\left( d \right)} = \left\{ {\prod {^{\left( d \right)} } \left( {0,n} \right) \cap \prod {^{\left( d \right)} } \left( {n + f\left( n \right),\infty } \right) \ne \emptyset } \right\}$$ \end{document}
Estimates on the probability of the event
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$E_n^{\left( d \right)}$$ \end{document}
are obtained for
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$d \geqq 3$$ \end{document}
. As an application, a necessary and sufficient condition to ensure
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$P\left( {E_n^{\left( d \right)} ,{\text{i}}{\text{.o}}{\text{.}}} \right) = 0\quad {\text{or}}\quad {\text{1}}$$ \end{document}
is derived for
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$d \geqq 3$$ \end{document}
. These extend some results obtained by Erdős and Taylor about the self-intersections of the simple random walk on Zd.

Restricted access