Related papers: Frogs, hats and common subsequences
The aim of this paper is to develop analytic techniques to deal with certain monotonicity of combinatorial sequences. (1) A criterion for the monotonicity of the function $\sqrt[x]{f(x)}$ is given, which is a continuous analog for one…
Given two functions $\mathbf{a}\!:\! [n] \rightarrow [n]$ and $\mathbf{b}\!:\! [n] \rightarrow [n]$ chosen uniformly at random, any word $w=w_1w_2\dots w_k\in \{a,b\}^k$ induces a random function $\mathbf{w}\!:\! [n] \rightarrow [n]$ by…
We combine concepts from random matrix theory and free probability together with ideas from the theory of commutator length in groups and maps from surfaces, and establish new connections between the two. More particularly, we study…
In this paper, we study a series of algorithmic problems related to the subsequences occurring in the strings of a given language, under the assumption that this language is succinctly represented by a grammar generating it, or an automaton…
We study the frog model on $\mathbb{Z}^d$ with drift in dimension $d \geq 2$ and establish the existence of transient and recurrent regimes depending on the transition probabilities. We focus on a model in which the particles perform…
We study the intermittent dynamics and the fluctuations of the dynamic correlation function of a simple aging system. Given its size $L$ and its coherence length $\xi$, the system can be divided into $N$ independent subsystems, where…
The frog model with a Bernoulli initial configuration is an interacting particle system on the $d$-dimensional lattice ($d \geq 2$) with two types of particles: active and sleeping. Active particles perform independent simple random walks.…
In this work we prove a shape theorem for a growing set of Simple Random Walks (SRWs), known as frog model. The dynamics of this process is described as follows: There are some active particles, which perform independent SRWs, and sleeping…
Normal mode dynamics are ubiquitous underlying the motions of diverse systems from rotating stars to crystal structures. These behaviors are composed of simple collective motions of particles which move with the same frequency and phase,…
A number of results for reactions involving subdiffusive species all with the same anomalous exponent gamma have recently appeared in the literature and can often be understood in terms of a subordination principle whereby time t in…
We study the frog model on \( \mathbb{Z} \) with geometric lifetimes, introducing a random survival parameter. Active and inactive particles are placed at the vertices of \( \mathbb{Z} \). The lifetime of each active particle follows a…
We analyze the dynamics of two atoms with a short-ranged pair interaction in a one-dimensional harmonic trap with time-dependent frequency. Our analysis is focused on two representative cases: (i) a sudden change of the trapping frequency…
We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size $n$ compressing a string of size $N$ and a pattern string of size $m$ over an alphabet of size $\sigma$, our algorithm uses…
Dynamic Time Warping (DTW) is a widely used similarity measure for comparing strings that encode time series data, with applications to areas including bioinformatics, signature verification, and speech recognition. The standard…
The longest common substring problem consists in finding a longest string that appears as a (contiguous) substring of two input strings. We consider the dynamic variant of this problem, in which we are to maintain two dynamic strings $S$…
Let $S$ be a string of length $n$ over an alphabet $\Sigma$ and let $Q$ be a subset of $\Sigma$ of size $q \geq 2$. The 'co-occurrence problem' is to construct a compact data structure that supports the following query: given an integer $w$…
A pattern p (i.e., a string of variables and terminals) matches a word w, if w can be obtained by uniformly replacing the variables of p by terminal words. The respective matching problem, i.e., deciding whether or not a given pattern…
The expected length of longest common subsequences is a problem that has been in the literature for at least twenty five years. Determining the limiting constants \gamma_k appears to be quite difficult, and the current best bounds leave…
We examine an interacting particle system on trees commonly referred to as the frog model. For its initial state, it begins with a single active particle at the root and i.i.d. $\mathrm{Poiss}(\lambda)$ many inactive particles at each…
We study the fully dynamic pattern matching problem where the pattern may contain up to kwildcard symbols, each matching any symbol of the alphabet. Both the text and the pattern are subject to updates (insert, delete, change). We design an…