相关论文: On approximate pattern matching for a class of Gib…

It turns out that some empirical facts in Big Data are the effects of properties of large numbers. Zipf's law 'noise' is an example of such an artefact. We expose several properties of the power law distributions and of similar distribution…

A novel type of approximants is introduced, being based on the ideas of self-similar approximation theory. The method is illustrated by the examples possessing the structure typical of many problems in applied mathematics. Good numerical…

Maximum likelihood learning with exponential families leads to moment-matching of the sufficient statistics, a classic result. This can be generalized to conditional exponential families and/or when there are hidden data. This document…

Statistical modeling is a key component in the extraction of physical results from lattice field theory calculations. Although the general models used are often strongly motivated by physics, many model variations can frequently be…

We propose a method for detecting significant interactions in very large multivariate spatial point patterns. This methodology develops high dimensional data understanding in the point process setting. The method is based on modelling the…

We propose a discrete analogue for the boundary local time of reflected diffusions in bounded Lipschitz domains. This discrete analogue, called the discrete local time, can be effectively simulated in practice and is obtained pathwise from…

We consider systems of stochastic evolutionary equations of the $p$-Laplace type. We establish convergence rates for a finite-element based space-time approximation, where the error is measured in a suitable quasi-norm. Under natural…

We apply the technique of self-similar exponential approximants based on successive truncations of continued exponentials to reconstruct functional laws of the quasi-exponential class from the knowledge of only a few terms of their power…

The Permutation Pattern Matching problem asks, given two permutations $\sigma$ on $n$ elements and $\pi$, whether $\sigma$ admits a subsequence with the same relative order as $\pi$ (or, in the counting version, how many such subsequences…

We establish higher order approximations in the Dynkin--Lamperti theorem, a limit theorem for the distribution of a killed subordinator immediately before its first passage time over a fixed level. For this purpose, we also study asymptotic…

In the following article we consider approximate Bayesian computation (ABC) for certain classes of time series models. In particular, we focus upon scenarios where the likelihoods of the observations and parameter are intractable, by which…

The law of large numbers for the empirical density for the pairs of uniformly distributed integers with a given greatest common divisor is a classic result in number theory. In this paper, we study the large deviations of the empirical…

We prove the tightness of a natural approximation scheme for an analog of the Liouville quantum gravity metric on $\mathbb R^d$ for arbitrary $d\geq 2$. More precisely, let $\{h_n\}_{n\geq 1}$ be a suitable sequence of Gaussian random…

We develop a new Gibbs sampler for a linear mixed model with a Dirichlet process random effect term, which is easily extended to a generalized linear mixed model with a probit link function. Our Gibbs sampler exploits the properties of the…

Non-Gaussian likelihoods are essential for modelling complex real-world observations but pose significant computational challenges in learning and inference. Even with Gaussian priors, non-Gaussian likelihoods often lead to analytically…

A circle pattern is a configuration of circles in the plane whose combinatorics is given by a planar graph G such that to each vertex of G corresponds a circle. If two vertices are connected by an edge in G, the corresponding circles…

We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, the population size cannot decrease, and a natural definition of recurrence is introduced. We prove a dichotomy for recurrence/transience,…

In this short paper we prove a quantitative version of the Khintchine-Groshev Theorem with congruence conditions. Our argument relies on a classical argument of Schmidt on counting generic lattice points, which in turn relies on a certain…

The approximate string matching is a fundamental and recurrent problem that arises in most computer science fields. This problem can be defined as follows: Let $D=\{x_1,x_2,\ldots x_d\}$ be a set of $d$ words defined on an alphabet…

Let $Z^2$ denote the standard lattice in the plane $R^2$. We prove that given a finite subset $S\subset R^2$ and $\eps>0$, then for all sufficiently large dilations $t>0$ there exists a rotation $\rho\colon R^2\to R^2$ around the origin…