Related papers: On approximate pattern matching for a class of Gib…
This paper investigates the large deviation problem in the sample path space of the nearest-neighbor random walks on regular trees. We establish the sample path large deviation principle for the law of the distance from a nearest random…
In this paper, for a generalised shift operator introduced earlier, we prove theorem of coincidence of classes of functions defined by the order of best approximation by algebraical polynomials and the generalised Lipschitz classes defined…
We consider large random trees under Gibbs distributions and prove a Large Deviation Principle (LDP) for the distribution of degrees of vertices of the tree. The LDP rate function is given explicitly. An immediate consequence is a Law of…
In this paper we prove an existence theorem concerning linear forms of a given Diophantine type and apply it to study the structure of the spectrum of lattice exponents.
Minkowski's First Theorem and Dirichlet's Approximation Theorem provide upper bounds on certain minima taken over lattice points contained in domains of Euclidean spaces. We study the distribution of such minima and show, under some…
Given a text $T$ of length $n$ and a pattern $P$ of length $m$, the approximate pattern matching problem asks for computation of a particular \emph{distance} function between $P$ and every $m$-substring of $T$. We consider a…
We consider a family of determinantal random point processes on the two-dimensional lattice and prove that members of our family can be interpreted as a kind of Gibbs ensembles of nonintersecting paths. Examples include probability measures…
Finite fields form an important chapter in abstract algebra, and mathematics in general. We aim to provide a geometric and intuitive model for finite fields, involving algebraic numbers, in order to make them accessible and interesting to a…
We consider a Fermi-Pasta-Ulam-Tsingou lattice with randomly varying coefficients. We discover a relatively simple condition which when placed on the nature of the randomness allows us to prove that small amplitude/long wavelength solutions…
A discrete-time totally asymmetric simple exclusion process on a lattice with open boundaries is considered. There are particles of different types. The type of a particle is characterized by the probability that a particle moves to a…
We study a new class of matrix models, formulated on a lattice. On each site are $N$ states with random energies governed by a Gaussian random matrix Hamiltonian. The states on different sites are coupled randomly. We calculate the density…
This paper addresses the issue of inversion in cases where (1) the observation system is modeled by a linear transformation and additive noise, (2) the problem is ill-posed and regularization is introduced in a Bayesian framework by an a…
Detecting and counting copies of permutation patterns are fundamental algorithmic problems, with applications in the analysis of rankings, nonparametric statistics, and property testing tasks such as independence and quasirandomness…
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…
An assumed density approximate likelihood is derived for a class of partially observed stochastic compartmental models which permit observational over-dispersion. This is achieved by treating time-varying reporting probabilities as latent…
In this paper we study the distribution of hitting and return times for observations of dynamical systems. We apply this results to get an exponential law for the distribution of hitting and return times for rapidly mixing random dynamical…
We aim to fill a gap in the proof of an inequality relating two exponents of uniform Diophantine approximation stated in a paper by Bugeaud. We succeed to verify the inequality in several instances, in particular for small dimension.…
Gram's Law describes a pattern that frequently occurs in the distribution of the non-trivial zeros of the Riemann zeta function along the critical line. Whenever Gram's Law holds true, it reduces the difficulty of computing the…
In this paper we study the distribution of hitting times for a class of random dynamical systems. We prove that for invariant measures with super-polynomial decay of correlations hitting times to dynamically defined cylinders satisfy…
We consider the problem of recovering an unknown matching between a set of $n$ randomly placed points in $\mathbb{R}^d$ and random perturbations of these points. This can be seen as a model for particle tracking and more generally, entity…