相关论文: Large Deviations Principle for Self-Intersection L…
In this paper, we obtain a large and moderate deviation principle for the law of the maximum of a random Dyck path. Our result extend the results of Chung, Kennedy, Kaigh and Khorunzhiy and Marckert.
We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…
In this work, we establish the existence of large deviation principles of random walk in strongly mixing environments. The quenched and annealed rate functions have the same zero set whose shape is either a singleton point or a line…
The asymptotic shape theorem for the contact process in random environment gives the existence of a norm $\mu$ on $\Rd$ such that the hitting time $t(x)$ is asymptotically equivalent to $\mu(x)$ when the contact process survives. We provide…
We study numerically the distributions of the length $L$ of the longest increasing subsequence (LIS) for the two cases of random permutations and of one-dimensional random walks. Using sophisticated large-deviation algorithms, we are able…
We study downward deviations of the maximum local time of the discrete-time simple random walk on $\mathbb{Z}^d$, $d\ge 3$. In our previous paper \cite{li2026ldmaxlocal}, the corresponding upper bound was established, while the matching…
Consider an intersection measure $\ell_t ^{\mathrm{IS}}$ of $p$ independent (possibly different) $m$-symmetric Hunt processes up to time $t$ in a metric measure space $E$ with a Radon measure $m$. We derive a Donsker-Varadhan type large…
We investigate a model of continuous-time simple random walk paths in $\mathbb{Z}^d$ undergoing two competing interactions: an attractive one towards the large values of a random potential, and a self-repellent one in the spirit of the…
Using the discrepancy metric, we analyze the rate of convergence of a random walk on the circle generated by d rotations, and establish sharp rates that show that badly approximable d-tuples in R^d give rise to walks with the fastest…
We introduce the notion of \emph{localization at the boundary} for conditioned random walks in i.i.d. and uniformly elliptic random environment on $\mathbb{Z}^d$, in dimensions two and higher. Informally, this means that the walk spends a…
We give a local central limit theorem for simple random walks on Z^d, including Gaussian error estimates. The detailed proof combines standard large deviation techniques with Cramer-Edgeworth expansions for lattice distributions.
We study some properties of the local time of the asymmetric Bernoulli walk on the line. These properties are very similar to the corresponding ones of the simple symmetric random walks in higher ($d\geq3$) dimension, which we established…
We derive a large deviation principle for families of random variables in the basin of attraction of spectrally positive stable distributions by proving a uniform version of the Tauberian theorem for Laplace-Stieltjes transforms. The main…
Consider a random walk in a time-dependent random environment on the lattice Zd. Recently, Rassoul-Agha, Seppalainen and Yilmaz [RSY11] proved a general large deviation principle under mild ergodicity assumptions on the random environment…
Shot noise processes are used in applied probability to model a variety of physical systems in, for example, teletraffic theory, insurance and risk theory and in the engineering sciences. In this work we prove a large deviation principle…
In this paper, we study the asymptotic behavior of randomly perturbed path-dependent stochastic differential equations with small parameter $\vartheta_{\varepsilon}$, when $\varepsilon \rightarrow 0$, $\vartheta_\varepsilon$ goes to $0$.…
We study large deviations for the renormalized self-intersection local time of d-dimensional stable processes of index \beta \in (2d/3,d]. We find a difference between the upper and lower tail. In addition, we find that the behavior of the…
Large deviation results are given for a class of perturbed nonhomogeneous Markov chains on finite state space which formally includes some stochastic optimization algorithms. Specifically, let {P_n} be a sequence of transition matrices on a…
In this work we determine a process-level Large Deviation Principle (LDP) for a model of interacting particles indexed by a lattice $\mathbb{Z}^d$. The connections are random, sparse and unscaled, so that the system converges in the large…
A large deviation principle is established for a general class of stochastic flows in the small noise limit. This result is then applied to a Bayesian formulation of an image matching problem, and an approximate maximum likelihood property…