We investigate the asymptotical behaviour of the transition probabilities of the simple random walk on the 2-comb. In particular we obtain space-time uniform asymptotical estimates which show the lack of symmetry of this walk better than local limit estimates. Our results also point out the impossibility of getting Jones-type non-Gaussian estimates.
Persistence probabilities for MA(1) sequences with uniform innovations
Technical University of Darmstadt(达姆施塔特工业大学);CNRS, Université d’Angers(法国国家科学研究中心,昂热大学);International Research Laboratory France-Vietnam in Mathematics and its Applications, CNRS - VAST - VIASM(法越数学及其应用国际研究实验室)
We establish the unimodality and the asymptotic strong unimodality of the ordinary multinomials and give their smallest mode leading to the expression of the maximal probability of convolution powers of the discrete uniform distribution. We conclude giving the generating functions of the sequence of generalized ordinary multinomials and for an extension of the sequence of maximal probabilities for convolution power of discrete uniform distribution.
Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability π. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that {(X_n,S_n),n\geq0} is a Markov random walk. In this paper, we prove a uniform Markov renewal theorem with an estimate on the rate of convergence. This result is applied to boundary crossing problems for {(X_n,S_n),n\geq0}. To be more precise, for given b\geq0, define the stopping time τ=τ(b)=inf{n:S_n>b}. When a drift μof the random walk S_n is 0, we derive a one-term Ed…
Comparison results are obtained for the inclusion probabilities in some unequal probability sampling plans without replacement. For either successive sampling or Hájek's rejective sampling, the larger the sample size, the more uniform the inclusion probabilities in the sense of majorization. In particular, the inclusion probabilities are more uniform than the drawing probabilities. For the same sample size, and given the same set of drawing probabilities, the inclusion probabilities are more uniform for rejective sampling than for successive sampling. This last result confirms a conjecture of …
We show that the uniform norm of generalized grey Brownian motion over the unit interval has an analytic density, excluding the special case of fractional Brownian motion. Our main result is an asymptotic expansion for the small ball probability of generalized grey Brownian motion, which extends to other norms on path space. The decay rate is not exponential but polynomial, of degree two. For the uniform norm and the Hölder norm, we also prove a large deviations estimate.
This paper studies transition probabilities from a Borel subset of a Polish space to a product of two Borel subsets of Polish spaces. For such transition probabilities it introduces and studies the property of semi-uniform Feller continuity. This paper provides several equivalent definitions of semi-uniform Feller continuity and establishes its preservation under integration. The motivation for this study came from the theory of Markov decision processes with incomplete information, and this paper provides fundamental results useful for this theory.
We compute the Green's function on the double cover of ${\mathbb Z}^2$, branched over a vertex or a face. We use this result to compute the local statistics of the "trunk" of the uniform spanning tree on the square lattice, i.e., the limiting probabilities of cylinder events conditional on the path connecting far away points passing through a specified edge. We also show how to compute the local statistics of large-scale triple points of the uniform spanning tree, where the trunk branches. The method reduces the problem to a dimer system with isolated monomers, and we compute the inverse Kaste…
We show that certain topologically defined uniform spanning tree probabilities for graphs embedded in an annulus can be computed as linear combinations of Pfaffians of matrices involving the line-bundle Green's function, where the coefficients count cover-inclusive Dyck tilings of skew Young diagrams.
We prove an estimate for the probability that a simple random walk in a simply connected subset A of Z^2 starting on the boundary exits A at another specified boundary point. The estimates are uniform over all domains of a given inradius. We apply these estimates to prove a conjecture of S. Fomin in 2001 concerning a relationship between crossing probabilities of loop-erased random walk and Brownian motion.
In this paper we consider some generalizations of the classical d-dimensional Brownian risk model. This contribution derives some non-asymptotic bounds for simultaneous ruin probabilities of interest. In addition, we obtain non-asymptotic bounds also for the case of general trend functions and convolutions of our original risk model.
In this paper we study the asymptotic decay of finite time ruin probabilities for an insurance company that faces heavy-tailed claims, uses predictable investment strategies and makes investments in risky assets whose prices evolve according to quite general semimartingales. We show that the ruin problem corresponds to determining hitting probabilities for the solution to a randomly perturbed stochastic integral equation. We derive a large deviation result for the hitting probabilities that holds uniformly over a family of semimartingales and show that this result gives the asymptotic decay of…
Suppose that S is an asymptotically stable random walk with norming sequence c_{n} and that T_{x} is the time that S first enters (x,\inf), where x\ge 0. The asymptotic behaviour of P(T_0=n) has been described in a recent paper of Vatutin and Wachtel, \cite{vw}, and here we build on that result to give three estimates for P(T_{x}=n), which hold uniformly as n\to\inf in the regions x=o(c_{n}), x=O(c_{n}), and x/c_{n}\to\inf, respectively.
In this paper we consider an irreducible random walk on the integer lattice $\mathbb{Z}$ that is in the domain of normal attraction of a strictly stable process with index $α\in (1, 2)$ and obtain the asymptotic form of the distribution of the hitting time of the origin and that of the transition probability for the walk killed when it hits a finite set. The asymptotic forms obtained are valid uniformly in the natural domain of the space and time variables.
We study simple random walk on the uniform spanning tree on Z^2 . We obtain estimates for the transition probabilities of the random walk, the distance of the walk from its starting point after n steps, and exit times of both Euclidean balls and balls in the intrinsic graph metric. In particular, we prove that the spectral dimension of the uniform spanning tree on Z^2 is 16/13 almost surely.
In this work limit probabilities of first-order properties of the random $s$-uniform hypergraph in the binomial model $G^{s}(n,p)$ are studied. We give a complete discription of all positive $α$ such that $G^{s}(n,n^{-α})$ obeys Zero-One Law. Moreover, for any rational $ρ\geq 1/(s-1)$ we prove the existence of a strictly balanced $s$-uniform hypergraph with the density $ρ$.
We investigate the asymptotic of ruin probabilities when the company combines the life- and non-life insurance businesses and invests its reserve into a risky asset with stochastic volatility and drift driven by a two-state Markov process. Using the technique of the implicit renewal theory we obtain the rate of convergence to zero of the ruin probabilities.
We investigate asymptotic behaviour of probabilities of large deviations for normalized combinatorial sums. We find a zone in which these probabilities are equivalent to the tail of the standard normal law. Our conditions are similar to the classical Bernstein condition. The range of the zone of the normal convergence can be of power order.
For the exactly solvable model of exponential last passage percolation on $\mathbb{Z}^2$, consider the geodesic $Γ_n$ joining $(0,0)$ and $(n,n)$ for large $n$. It is well known that the transversal fluctuation of $Γ_n$ around the line $x=y$ is $n^{2/3+o(1)}$ with high probability. We obtain the exponent governing the decay of the small ball probability for $Γ_{n}$ and establish that for small $δ$, the probability that $Γ_{n}$ is contained in a strip of width $δn^{2/3}$ around the diagonal is $\exp (-Θ(δ^{-3/2}))$ uniformly in high $n$. We also obtain optimal small deviation estimates for the …
This paper studies the tail probability of weighted sums of the form $\sum_{i=1}^n c_i X_i$, where random variables $X_i$'s are either independent or pairwise quasi-asymptotical independent with heavy tails. Using $h$-insensitive function, the uniform asymptotic equivalence of the tail probabilities of $\sum_{i=1}^n c_iX_i$, $\max_{1\le k\le n}\sum_{i=1}^k c_iX_i$ and $\sum_{i=1}^n c_iX_i^+$ is established, where $X_i$'s are independent and follow the long-tailed distribution, and $c_i$'s take value in a broad interval. Some further uniform asymptotic results for the weighted sums of $X_i$'s w…
Many problems in computing, service, and manufacturing systems can be modeled via infinite repeating Markov chains with an infinite number of levels and a finite number of phases. Many such chains are quasi-birth-death processes (QBDs) with transitions that are skip-free in level, in that one can only transition between consecutive levels, and unidirectional in phase, in that one can only transition from lower-numbered phases to higher-numbered phases. We present a procedure, which we call Clearing Analysis on Phases (CAP), for determining the limiting probabilities of such Markov chains exact…
In this thesis the properties of two kinds of non-uniform random recursive trees are studied. In the first model weights are assigned to each node, thus altering the attachment probabilities. We will call these trees weighted recursive trees. In the second model a different distribution rather than the uniform one is chosen on the symmetric group, namely a riffle shuffle distribution. These trees will be called biased recursive trees. For both of these models the number of branches, the number of leaves, the depth of nodes and some other properties are studied. The focus is on asymptotic resul…
Department of Mathematics, University of Rochester(罗切斯特大学数学系);Institute of Mathematics at NAS RA(亚美尼亚国家科学院数学研究所);Yerevan State University(亚美尼亚国立耶莱van大学);Department of Mathematics, Binghamton University(宾夕法尼亚大学伯灵顿分校数学系)