相关论文: On approximate pattern matching for a class of Gib…
We consider Gibbs measures on the configuration space $S^{\mathbb{Z}^d}$, where mostly $d\geq 2$ and $S$ is a finite set. We start by a short review on concentration inequalities for Gibbs measures. In the Dobrushin uniqueness regime, we…
We consider a random walk in a random environment (RWRE) on the strip of finite width $\mathbb{Z} \times \{1,2,\ldots,d\}$. We prove both quenched and averaged large deviation principles for the position and the hitting times of the RWRE.…
A behavior of one class of mappings with finite distortion at a neighborhood of the origin is investigated. There is proved a lower estimate of distortion of a distance under mappings mentioned above.
In many applications involving spatial point patterns, we find evidence of inhibition or repulsion. The most commonly used class of models for such settings are the Gibbs point processes. A recent alternative, at least to the statistical…
We prove for Gibbs-Markov maps that the number of visits to a sequence of shrinking sets with bounded cylindrical lengths converges in distribution to a Poisson law. Applying to continued fractions, this result extends Doeblin's Poisson…
We investigate, theoretically and experimentally,the properties of diffraction spectra of Fibonacci lattices with arbitrary spacings. We show that, by means of a suitable composition rule, a Fibonacci sequence can be mapped into another one…
We consider a random walk in random environment with random holding times, that is, the random walk jumping to one of its nearest neighbors with some transition probability after a random holding time. Both the transition probabilities and…
Understanding the statistics of collisions among locally confined gas particles poses a major challenge. In this work we investigate $\mathbb Z^d$-map lattices coupled by collision with simplified local dynamics that offer significant…
This paper is an overview of the classical level crossing problem which is studied extensively in the literature and is fundamental in many branches of applied probability. We discuss a number of approximations with an emphasis on their…
In this work we study variational properties of approximate solutions of scalar conservation laws. Solutions of this type are described by a kinetic equation which is similar to the kinetic representation of admissible weak solutions due to…
The Gibbs sampler (GS) is a crucial algorithm for approximating complex calculations, and it is justified by Markov chain theory, the alternating projection theorem, and $I$-projection, separately. We explore the equivalence between these…
Probably we have observed a new simple phenomena dealing with approximations to two real numbers.
Let $\log^{2+\varepsilon} n \le d \le n/2$ for some fixed $\varepsilon \in (0,1)$, and let $M_n$ be an $n\times n$ random matrix with entries in ${0,1}$, where each row is independently and uniformly sampled from the set of all vectors in…
Gibbs-type exchangeable random partitions, which is a class of multiplicative measures on the set of positive integer partitions, appear in various contexts, including Bayesian statistics, random combinatorial structures, and stochastic…
Large deviation principles and related results are given for a class of Markov chains associated to the "leaves" in random recursive trees and preferential attachment random graphs, as well as the "cherries" in Yule trees. In particular,…
The Zipf's law is the major regularity of statistical linguistics that served as a prototype for rank-frequency relations and scaling laws in natural sciences. Here we show that the Zipf's law -- together with its applicability for a single…
Laplace's first law of errors, which states that the frequency of an error can be represented as an exponential function of the error magnitude, was overlooked for many decades but was recently shown to describe the statistical behavior of…
The discrete distribution of the length of longest increasing subsequences in random permutations of $n$ integers is deeply related to random matrix theory. In a seminal work, Baik, Deift and Johansson provided an asymptotics in terms of…
We investigate the large intersection properties of the set of points that are approximated at a certain rate by a family of affine subspaces. We then apply our results to various sets arising in the metric theory of Diophantine…
Laplace's method approximates a target density with a Gaussian distribution at its mode. It is computationally efficient and asymptotically exact for Bayesian inference due to the Bernstein-von Mises theorem, but for complex targets and…