Narrow Results

The distribution of the "mixing time" or the "time to stationarity" in a discrete time irreducible Markov chain, starting in state i, can be defined as the number of trials to reach a state sampled from the stationary distribution of the Markov chain. Expressions for the probability generating function, and hence the probability distribution of the mixing time, starting in state i, are derived and special cases explored. This extends the results of the author regarding the expected time to mixing [Hunter, JJ (2006). Mixing times with applications to perturbed Markov chains. Linear Algebra and Its Applications, 417, 108–123] and the variance of the times to mixing, [Hunter, JJ (2008). Variances of first passage times in a Markov chain with applications to mixing times. Linear Algebra and Its Applications, 429, 1135–1162]. Some new results for the distribution of the recurrence and the first passage times in a general irreducible three-state Markov chain are also presented.

We comment on the mathematical results about the statistical behavior of Lorenz equations and its attractor, and more generally on the class of singular hyperbolic systems. The mathematical theory of such kind of systems turned out to be surprisingly difficult. It is remarkable that a rigorous proof of the existence of the Lorenz attractor was presented only around the year 2000 with a computer-assisted proof together with an extension of the hyperbolic theory developed to encompass attractors robustly containing equilibria.

We present some of the main results on the statistical behavior of such systems. We show that for attractors of three-dimensional flows, robust chaotic behavior is equivalent to the existence of certain hyperbolic structures, known as singular-hyperbolicity. These structures, in turn, are associated with the existence of physical measures: in low dimensions, robust chaotic behavior for flows ensures the existence of a physical measure.

We then give more details on recent results on the dynamics of singular-hyperbolic (Lorenz-like) attractors: (1) there exists an invariant foliation whose leaves are forward contracted by the flow (and further properties which are useful to understand the statistical properties of the dynamics); (2) there exists a positive Lyapunov exponent at every orbit; (3) there is a unique physical measure whose support is the whole attractor and which is the equilibrium state with respect to the center-unstable Jacobian; (4) this measure is exact dimensional; (5) the induced measure on a suitable family of cross-sections has exponential decay of correlations for Lipschitz observables with respect to a suitable Poincaré return time map; (6) the hitting time associated to Lorenz-like attractors satisfy a logarithm law; (7) the geometric Lorenz flow satisfies the Almost Sure Invariance Principle (ASIP) and the Central Limit Theorem (CLT); (8) the rate of decay of large deviations for the volume measure on the ergodic basin of a geometric Lorenz attractor is exponential; (9) a class of geometric Lorenz flows exhibits robust exponential decay of correlations; (10) all geometric Lorenz flows are rapidly mixing and their time-1 map satisfies both ASIP and CLT.

We study convergence of normalized ergodic sum processes to Lévy stable process in the Skorohod space with J₁-topology. Our necessary and sufficient conditions allow us to prove or disprove such convergence for specific examples.

In this paper, we study the mean return times to a given set for suspension flows. In the discrete time setting, this corresponds to the classical version of Kac’s lemma [11] that the mean of the first return time to a set with respect to the normalized probability measure is one. In the case of suspension flows we provide formulas to compute the mean return time. Positive measure sets on cross sections are also considered. In particular, this varies linearly with continuous reparametrizations of the flow and takes into account the mean escaping time from the original set. Relation with entropy and returns to positive measure sets on cross sections is also considered.

In this paper, we give a procedure to construct quantum circuits for implementing discrete-time quantum walks on a family of Cayley graphs called cubelike graphs. We construct these circuits on IBM’s Qiskit platform and demonstrate an implementation of the quantum hitting times on cubelike graphs. Based on our numerical study, we conjecture that for all families of cubelike graphs there is a linear relationship between the degree of a cubelike graph and its hitting time which holds asymptotically. This conjecture, if proved, will generalize the result of hitting times of discrete-time quantum walks on hypercubes to general family of cubelike graphs.

The purpose of this paper is to study the eigenvalues of U^t where U is a large N×N random unitary matrix and t > 0. In particular we are interested in the typical times t for which all the eigenvalues are simultaneously close to 1 in different ways thus corresponding to recurrence times in the issue of quantum measurements. Our strategy consists in rewriting the problem as a random matrix integral and use loop equations techniques to compute the first-orders of the large N asymptotic. We also connect the problem to the computation of a large Toeplitz determinant whose symbol is the characteristic function of several arc segments of the unit circle. In particular in the case of a single arc segment we recover Widom's formula. Eventually we explain why the first return time is expected to converge toward an exponential distribution when N is large. Numerical simulations are provided along the paper to illustrate the results.

Let B^(µ) denote a Brownian motion with drift µ. In this paper we study two perpetual integral functionals of B^(µ). The first one, introduced and investigated by Dufresne in [5], is