相关论文: String Matching and 1d Lattice Gases

We study a new parametric family of distributions on the ordered simplex $\nabla^{d-1} = \{y \in \mathbb{R}^d: y_1 \geq \dots \geq y_d \geq 0, \sum_{k=1}^d y_k = 1\}$, which we call Generalized Rank Dirichlet (GRD) distributions. Their…

Lattice gauge theories (LGTs) describe a broad range of phenomena in condensed matter and particle physics. A prominent example is confinement, responsible for bounding quarks inside hadrons such as protons or neutrons. When quark-antiquark…

We present a novel approach for investigating lens phenomenology of cosmic strings in order to elaborate detection strategies in galaxy deep field images. To account for the complexity of the projected energy distribution of string networks…

We analyse a biased random walk on a 1D lattice with unequal step lengths. Such a walk was recently shown to undergo a phase transition from a state containing a single connected cluster of visited sites to one with several clusters of…

We investigate the full counting statistics (FCS) of a harmonically confined 1d short-range Riesz gas consisting of $N$ particles in equilibrium at finite temperature. The particles interact with each other through a repulsive power-law…

In this paper, we study the cycle distribution of random low-density parity-check (LDPC) codes, randomly constructed protograph-based LDPC codes, and random quasi-cyclic (QC) LDPC codes. We prove that for a random bipartite graph, with a…

We address the question of the time needed by $N$ particles, initially located on the first sites of a finite 1D lattice of size $L$, to exit that lattice when they move according to a TASEP transport model. Using analytical calculations…

Despite the successes of probabilistic models based on passing noise through neural networks, recent work has identified that such methods often fail to capture tail behavior accurately, unless the tails of the base distribution are…

We consider a discrete-time system of n coupled random vectors, a.k.a. interacting particles. The dynamics involve a vanishing step size, some random centered perturbations, and a mean vector field which induces the coupling between the…

A simple lattice gas model in one dimension is constructed in which each site can be occupied by at most one particle of any one of $D$ species. Particles interact with a randomly drawn nearest neighbor interaction. This model is capable of…

Given positive integers n and m, and a probability measure P on {0, 1, ..., m} the random intersection graph G(n,m,P) on vertex set V = {1,2, ..., n} and with attribute set W = {w_1, w_2, ..., w_m} is defined as follows. Let S_1, S_2, ...,…

Given a pattern string $P$ of length $n$ consisting of $\delta$ distinct characters and a query string $T$ of length $m$, where the characters of $P$ and $T$ are drawn from an alphabet $\Sigma$ of size $\Delta$, the {\em exact string…

We compute the joint distribution of relative velocities and separations of identical inertial particles suspended in randomly mixing and turbulent flows. Our results are obtained by matching asymptotic forms of the distribution. The method…

Let $k,d $ be positive integers. We determine a sequence of constants that are asymptotic to the probability that the cluster at the origin in a $d$-dimensional Poisson Boolean model with balls of fixed radius is of order $k$, as the…

Approximate pattern matching is a natural and well-studied problem on strings: Given a text $T$, a pattern $P$, and a threshold $k$, find (the starting positions of) all substrings of $T$ that are at distance at most $k$ from $P$. We…

A theory of systems with long-range correlations based on the consideration of binary N-step Markov chains is developed. In the model, the conditional probability that the i-th symbol in the chain equals zero (or unity) is a linear function…

Given a random text over a finite alphabet, we study the frequencies at which fixed-length words occur as subsequences. As the data size grows, the joint distribution of word counts exhibits a rich asymptotic structure. We investigate all…

We study the position of a biased tracer particle (TP) in a bath of hardcore particles moving on a lattice of arbitrary dimension and in contact with a reservoir. Starting from the master equation satisfied by the joint probability of the…

Consider a finite set of sources, each producing i.i.d. observations that follow a unique probability distribution on a finite alphabet. We study the problem of matching a finite set of observed sequences to the set of sources under the…

Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges; a prominent example is when the two random graphs are given by Erd\H{o}s-R\'{e}nyi graphs $G(n,\frac{d}{n})$.…