Related papers: Hitting time of connectedness in the random hyperc…

For one-dimensional symmetric L\'{e}vy processes, which hit every point with positive probability, we give sharp bounds for the tail function of the first hitting time of B which is either a single point or an interval. The estimates are…

Let $\{G_i\}$ be the random graph process: starting with an empty graph $G_0$ with $n$ vertices, in every step $i \geq 1$ the graph $G_i$ is formed by taking an edge chosen uniformly at random among the non-existing ones and adding it to…

Consider a simple random walk on a realization of an Erd\H{o}s-R\'enyi graph. Assume that it is asymptotically almost surely (a.a.s.) connected. Conditional on an eigenvector delocalization conjecture, we prove a Central Limit Theorem (CLT)…

Recent results on the maximization of the charged-particle action I in a globally hyperbolic spacetime are discussed and generalized. We focus on the maximization of I over a given causal homotopy class C of curves connecting two causally…

The expected hitting time from vertex $a$ to vertex $b$, $H(a,b)$, is the expected value of the time it takes a random walk starting at $a$ to reach $b$. In this paper, we give estimates for $H(a,b)$ when the distance between $a$ and $b$ is…

We consider discrete time dynamical systems and show the link between Hitting Time Statistics (the distribution of the first time points land in asymptotically small sets) and Extreme Value Theory (distribution properties of the partial…

Convergence is proved for solutions of Dirichlet problems in regions with many small excluded sets (holes), as the holes become smaller and more numerous. The problem is formulated in the context of Markov processes associated with general…

In [A.W. Harrow and R.A. Low, Commun. Math. Phys. 291, 257-302 (2009)], it was shown that a quantum circuit composed of random 2-qubit gates converges to an approximate quantum 2-design in polynomial time. We point out and correct a flaw in…

We introduce a model of a controlled random graph process. In this model, the edges of the complete graph $K_n$ are ordered randomly and then revealed, one by one, to a player called Builder. He must decide, immediately and irrevocably,…

Let $d,n\in \mathbb{N}$ be such that $d=\omega(1)$, and $d\le n^{1-a}$ for some constant $a>0$. Consider a $d$-regular graph $G=(V, E)$ and the random graph process that starts with the empty graph $G(0)$ and at each step $G(i)$ is obtained…

The perceived randomness in the time evolution of "chaotic" dynamical systems can be characterized by universal probabilistic limit laws, which do not depend on the fine features of the individual system. One important example is the…

The probability that a max-stable process {\eta} in C[0, 1] with identical marginal distribution function F hits x \in R with 0 < F (x) < 1 is the hitting probability of x. We show that the hitting probability is always positive, unless the…

The jigsaw percolation process on graphs was introduced by Brummitt, Chatterjee, Dey, and Sivakoff as a model of collaborative solutions of puzzles in social networks. Percolation in this process may be viewed as the joint connectedness of…

The mixing time of a discrete-time quantum walk on the hypercube is considered. The mean probability distribution of a Markov chain on a hypercube is known to mix to a uniform distribution in time O(n log n). We show that the mean…

Starting from an n-by-n matrix of zeros, choose uniformly random zero entries and change them to ones, one-at-a-time, until the matrix becomes invertible. We show that with probability tending to one as n tends to infinity, this occurs at…

We make use of the Open Quantum Random Walk setting due to S. Attal, F. Petruccione, C. Sabot and I. Sinayskiy [J. Stat. Phys. (2012) 147:832-852] in order to discuss hitting times and a quantum version of the Mean Hitting Time Formula from…

In this paper we study reachability verification problems of stochastic discrete-time dynamical systems over the infinite time horizon. The reachability verification of interest in this paper is to certify specified lower and upper bounds…

It is known that w.h.p. the hitting time $\tau_{2\sigma}$ for the random graph process to have minimum degree $2\sigma$ coincides with the hitting time for $\sigma$ edge disjoint Hamilton cycles. In this paper we prove an online version of…

Let $T_1^{(\mu)}$ be the first hitting time of the point 1 by the Bessel process with index $\mu\in \R$ starting from $x>1$. Using an integral formula for the density $q_x^{(\mu)}(t)$ of $T_1^{(\mu)}$, obtained in Byczkowski, Ryznar (Studia…

We study the connectivity of random subgraphs of the $d$-dimensional Hamming graph $H(d, n)$, which is the Cartesian product of $d$ complete graphs on $n$ vertices. We sample the random subgraph with an i.i.d.\ Bernoulli bond percolation on…