Related papers: Frogs, hats and common subsequences
We theoretically study the role of excitatory and inhibitory interactions in the aggregations of male frogs. In most frogs, males produce sounds to attract conspecific females, which activates the calling behavior of other males and results…
We provide sufficient conditions for the validity of a dichotomy, i.e. zero-one law, between recurrence and transience of general frog models. In particular, the results cover frog models with i.i.d. numbers of frogs per site where the frog…
We show how the tracer motion of tagged, distinguishable particles can effectively describe transport in various homogeneous quantum many-body systems with constraints. We consider systems of spinful particles on a one-dimensional lattice…
The word-stock of a language is a complex dynamical system in which words can be created, evolve, and become extinct. Even more dynamic are the short-term fluctuations in word usage by individuals in a population. Building on the recent…
Computational models of collective behavior in birds has allowed us to infer interaction rules directly from experimental data. Using a generic form of these rules we explore the collective behavior and emergent dynamics of a simulated…
A longest common extension (LCE) query on a string computes the length of the longest common suffix or prefix at two given positions. A dynamic LCE algorithm maintains a data structure that allows efficient LCE queries on a string that can…
In this paper we revisit the classical regular expression matching problem, namely, given a regular expression $R$ and a string $Q$, decide if $Q$ matches one of the strings specified by $R$. Let $m$ and $n$ be the length of $R$ and $Q$,…
In this paper, we propose a new \emph{dynamic compressed index} of $O(w)$ space for a dynamic text $T$, where $w = O(\min(z \log N \log^*M, N))$ is the size of the signature encoding of $T$, $z$ is the size of the Lempel-Ziv77 (LZ77)…
We investigate the dynamics of a tagged particle embedded in a strongly interacting confined liquid enclosed between two opposing flat walls. Using the Zwanzig-Mori projection operator formalism we obtain an equation of motion for the…
Based on the Heisenberg-picture analog of the master equation, we develop a method for computing the exact time dependence of noise-averaged observables for general noninteracting fermionic systems with noisy fluctuations. Upon noise…
Jamming is a phenomenon shared by a wide variety of systems, such as granular materials, foams, and glasses in their high density regime. This has motivated the development of a theoretical framework capable of explaining many of their…
An extended gravitational object embedded in a parent system comprised of gas and collisionless particles may undergo both dynamical friction (DF) and mass loss by tidal forces. If the object is compact enough, it can increase its mass…
We propose algorithms that, given the input string of length $n$ over integer alphabet of size $\sigma$, construct the Burrows-Wheeler transform (BWT), the permuted longest-common-prefix (PLCP) array, and the LZ77 parsing in…
We present a data structure representing a dynamic set S of w-bit integers on a w-bit word RAM. With |S|=n and w > log n and space O(n), we support the following standard operations in O(log n / log w) time: - insert(x) sets S = S + {x}. -…
The Fr\'echet distance is a similarity measure between two curves $A$ and $B$: Informally, it is the minimum length of a leash required to connect a dog, constrained to be on $A$, and its owner, constrained to be on $B$, as they walk…
Tree-adjoining grammars are a generalization of context-free grammars that are well suited to model human languages and are thus popular in computational linguistics. In the tree-adjoining grammar recognition problem, given a grammar…
In this article we establish for the superdiffusive regime $p \in (1/2,1)$ that the fluctuations of a general step-reinforced random walk around $a_n \hat{W}$, where $(a_n)_{n \in \mathbb{N}}$ is a non-negative sequence of order $n^p$ and…
An RNA sequence is a word over an alphabet on four elements $\{A,C,G,U\}$ called bases. RNA sequences fold into secondary structures where some bases match one another while others remain unpaired. Pseudoknot-free secondary structures can…
Letting $w$ denote a finite, nonempty word, let $\text{red}(w)$ denote the word obtained from $w$ by replacing every subword $s$ of $w$ of the form $cc \cdots c$ for a given character $c$ (such that there is no character immediately to the…
We introduce a family of particle systems on sparse graphs where local interactions occur via hitting times, providing a dynamic and tractable model for default cascades in large sparsely-connected financial networks. Building on the…