Related papers: Frogs, hats and common subsequences
We study a population of $N$ particles, which evolve according to a diffusion process and interact through a dynamical network. In turn, the evolution of the network is coupled to the particles' positions. In contrast with the mean-field…
The performance of a dynamic dictionary is measured mainly by its update time, lookup time, and space consumption. In terms of update time and lookup time there are known constructions that guarantee constant-time operations in the worst…
Language models for speech recognition typically use a probability model of the form Pr(a_n | a_1, a_2, ..., a_{n-1}). Stochastic grammars, on the other hand, are typically used to assign structure to utterances. A language model of the…
In this paper, we extend the notion of gapped strings to elastic-degenerate strings. An elastic-degenerate string can been seen as an ordered collection of k > 1 seeds (substrings/subpatterns) interleaved by elastic-degenerate symbols such…
Intrachain contact formation rates, fundamental to the dynamics of biopolymer self-organization such as protein folding, can be monitored in the laboratory through fluorescence quenching measurements. The common approximations for the…
In combinatorics on words, the well-studied factor complexity function $\rho_{\infw{x}}$ of a sequence $\infw{x}$ over a finite alphabet counts, for every nonnegative integer $n$, the number of distinct length-$n$ factors of $\infw{x}$. In…
The dynamics of many glassy systems are known to exhibit string-like hopping motions each consisting of a line of particles displacing one and other. By using molecular dynamics simulations of glassy polymers, we show that these motions…
For any $T \geq 1$, there are constants $R=R(T) \geq 1$ and $\zeta=\zeta(T)>0$ and a randomized algorithm that takes as input an integer $n$ and two strings $x,y$ of length at most $n$, and runs in time $O(n^{1+\frac{1}{T}})$ and outputs an…
A droplet bouncing on the surface of a vibrating liquid bath can move horizontally guided by the wave it produces on impacting the bath. The wave itself is modified by the environment, and thus the interactions of the moving droplet with…
Subdiffusion in a system in which mobile particles $A$ can chemically react with static particles $B$ according to the rule $A+B\rightarrow B$ is considered within a persistent random walk model. This model, which assumes a correlation…
Exact results are derived on the averaged dynamics of a class of random quantum-dynamical systems in continuous space. Each member of the class is characterized by a Hamiltonian which is the sum of two parts. While one part is…
The present study uses a computational approach to examine the role of semantic constraints in normal reading. This methodology avoids confounds inherent in conventional measures of predictability, allowing for theoretically deeper accounts…
The problem we consider is the following: Given an infinite word $w$ on an ordered alphabet, construct the sequence $\nu_w=(\nu[n])_n$, equidistributed on $[0,1]$ and such that $\nu[m]<\nu[n]$ if and only if $\sigma^m(w)<\sigma^n(w)$, where…
In this paper we investigate the problem of detecting, counting, and enumerating (generating) all maximum length plateau-$k$-rollercoasters appearing as a subsequence of some given word (sequence, string), while allowing for plateaus. We…
The supersonic motion of gravitating objects through a gaseous medium constitutes a classical problem in theoretical astrophysics. Its application covers a broad range of objects and scales from planets up to galaxies. Especially the…
Free association is a task that requires a subject to express the first word to come to their mind when presented with a certain cue. It is a task which can be used to expose the basic mechanisms by which humans connect memories. In this…
The paper proposes dynamic parallel algorithms for connectivity and bipartiteness of undirected graphs that require constant time and $O(n^{1/2+\epsilon})$ work on the CRCW PRAM model. The work of these algorithms almost matches the work of…
We present an algorithm that takes an unannotated corpus as its input, and returns a ranked list of probable morphologically related pairs as its output. The algorithm tries to discover morphologically related pairs by looking for pairs…
In this letter a new solvable model of synchronization dynamics is introduced. It consists of a system of long range interacting tops with random precession frequencies. The model allows for an explicit study of orientational effects in…
Let $w$ be a finite word over the alphabet $\{0,1\}$. For any natural number $n$, let $s_w(n)$ denote the number of occurrence of $w$ in the binary expansion of $n$ as a scattered subsequence. We study the behavior of the partial sum…