相关论文: String Matching and 1d Lattice Gases
The analysis of strings of $n$ random variables with geometric distribution has recently attracted renewed interest: Archibald et al. consider the number of distinct adjacent pairs in geometrically distributed words. They obtain the…
The equilibrium statistical mechanics of one-dimensional lattice gases with interactions of arbitrary range and shape between first-neighbor atoms is solved exactly on the basis of statistically interacting vacancy particles. Two sets of…
We study the statistics of the force felt by a particle in the class of spatially correlated distribution of identical point-like particles, interacting via a $1/r^2$ pair force (i.e. gravitational or Coulomb), and obtained by randomly…
The problem addressed concerns the determination of the average number of successive attempts of guessing a word of a certain length consisting of letters with given probabilities of occurrence. Both first- and second-order approximations…
An analysis of the random lattice gas in the annealed limit is presented. The statistical mechanics of disordered lattice systems is briefly reviewed. For the case of the lattice gas with an arbitrary uniform interaction potential and…
Considering the optimal alignment of two i.i.d. random sequences of length $n$, we show that when the scoring function is chosen randomly, almost surely the empirical distribution of aligned letter pairs in all optimal alignments converges…
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…
We study the problem of approximating a discrete probability distribution, such as the next-token distribution of a large language model, by a dyadic distribution induced by a binary tree under encoding rate constraints. The objective is to…
We describe an approach to robust domain-independent syntactic parsing of unrestricted naturally-occurring (English) input. The technique involves parsing sequences of part-of-speech and punctuation labels using a unification-based grammar…
Word matches are often used in sequence comparison methods, either as a measure of sequence similarity or in the first search steps of algorithms such as BLAST or BLAT. The D2 statistic is the number of matches of words of k letters between…
We consider a Lattice Gas model in which the sites interact via infinite-ranged random couplings independently distributed with a Gaussian probability density. This is the Lattice Gas analogue of the well known Sherrington-Kirkpatrick Ising…
We have investigated the non-equilibrium nature of a lattice gas system consisting of a regular lattice of charged particles driven by an external electric field. For a big system, an exact solution cannot be obtained using a master…
We solve a non-equilibrium statistical mechanics problem exactly, namely, the single-file dynamics of N hard-core interacting particles (the particles cannot pass each other) of size \Delta diffusing in a one dimensional system of finite…
We investigate numerically the configurational statistics of strings. The algorithm models an ensemble of global $U(1)$ cosmic strings, or equivalently vortices in superfluid $^4$He. We use a new method which avoids the specification of…
We derive exact density functionals for systems of hard rods with first-neighbor interactions of arbitrary shape but limited range on a one-dimensional lattice. The size of all rods is the same integer unit of the lattice constant. The…
This paper introduces a convenient strategy for coding and predicting sequences of independent, identically distributed random variables generated from a large alphabet of size $m$. In particular, the size of the sample is allowed to be…
We examine the dynamic spreading of a dense overdamped suspension of particles under power law repulsive potentials, often called Riesz gases. That is, potentials that decay with distance as 1/r^k where k\in (-2,\infty]. Depending on the…
We consider a 1D lattice gas model in which the atoms interact via an infinite number of cluster interactions within contiguous atomic chains plus the next nearest neighbor pairwise interaction. All interactions are of arbitrary strength.…
We consider the problem of estimating the probability of an observed string drawn i.i.d. from an unknown distribution. The key feature of our study is that the length of the observed string is assumed to be of the same order as the size of…
Let a lattice gas of constant density, described by the symmetric simple exclusion process, be brought in contact with a "target": a spherical absorber of radius $R$. Employing the macroscopic fluctuation theory (MFT), we evaluate the…