Related papers: Frogs, hats and common subsequences
In this paper, we consider a variant of the classical algorithmic problem of checking whether a given word $v$ is a subsequence of another word $w$. More precisely, we consider the problem of deciding, given a number $p$ (defining a…
Scrambling and thermalisation are topics of intense study in both condensed matter and high energy physics. Random unitary dynamics form a simple testing-ground for our theoretical understanding of these processes. In this work, we derive…
We consider the so-called frog model with random initial configurations. The dynamics of this model is described as follows: Some particles are randomly assigned on any site of the multidimensional cubic lattice. Initially, only particles…
We have developed an experimental setup of very simple self-propelled robots to observe collective motion emerging as a result of inelastic collisions only. A circular pool and commercial RC boats were the basis of our first setup, where we…
In this paper we study the fundamental problem of maintaining a dynamic collection of strings under the following operations: concat - concatenates two strings, split - splits a string into two at a given position, compare - finds the…
Acoustic animals (e.g., insects and frogs) aggregate and produce sounds for mating. Well-organized chorus structures like call alternation and call synchrony indicate the importance of the precise control of call timing by individual males.…
We consider the approximate pattern matching problem under edit distance. In this problem we are given a pattern $P$ of length $w$ and a text $T$ of length $n$ over some alphabet $\Sigma$, and a positive integer $k$. The goal is to find all…
We begin with a new analysis of formal words. Let w be a formal word in letters g_1,...,g_k. The word map associated with w maps the permutations s_1,...,s_k in S_n to the permutation obtained by replacing for each i, every occurrence of…
A previous analysis of fluctuations in a virtuoso (Jeff Porcaro) drum performance [R\"as\"anen et al., PLoS ONE 10(6): e0127902 (2015)] demonstrated that the rhythmic signal comprised both long range correlations and short range…
We introduce a natural generalization of the Erd\H{o}s-R\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding…
We investigate the variance of the length of the longest common subsequences of two independent random words of size $n$, where the letters of one word are i.i.d. uniformly drawn from $\{\alpha_1, \alpha_2, \cdots, \alpha_m\}$, while the…
The Fibonacci word $W$ on an infinite alphabet was introduced in [Zhang et al., Electronic J. Combinatorics 2017 24(2), 2-52] as a fixed point of the morphism $2i\rightarrow (2i)(2i+1)$, $(2i+1) \rightarrow (2i+2)$, $i\geq 0$. Here, for any…
Background: Zipf's discovery that word frequency distributions obey a power law established parallels between biological and physical processes, and language, laying the groundwork for a complex systems perspective on human communication.…
By means of molecular dynamics computer simulations we investigate the out of equilibrium relaxation dynamics of a simple glass former, a binary Lennard-Jones system, after a quench to low temperatures. We study both one time quantities and…
We address ourselves to a class of systems composed of two coupled subsystems without any intra-subsystem interaction: itinerant Fermions and localized Bosons on a lattice. Switching on an interaction between the two subsystems leads to…
A string $w$ is called a minimal absent word (MAW) for another string $T$ if $w$ does not occur in $T$ but the proper substrings of $w$ occur in $T$. For example, let $\Sigma = \{\mathtt{a, b, c}\}$ be the alphabet. Then, the set of MAWs…
Periodic orbit theory is an effective tool for the analysis of classical and quantum chaotic systems. In this paper we extend this approach to stochastic systems, in particular to mappings with additive noise. The theory is cast in the…
We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total…
We consider random walks on the set of all words over a finite alphabet such that in each step only the last two letters of the current word may be modified and only one letter may be adjoined or deleted. We assume that the transition…
Species subject to predation and environmental threats commonly exhibit variable periods of population boom and bust over long timescales. Understanding and predicting such behavior, especially given the inherent heterogeneity and…