Related papers: On the intriguing search for good permutations
The de Bruijn graph, its sequences, and their various generalizations, have found many applications in information theory, including many new ones in the last decade. In this paper, motivated by a coding problem for emerging memory…
Frequent sequence mining methods often make use of constraints to control which subsequences should be mined. A variety of such subsequence constraints has been studied in the literature, including length, gap, span, regular-expression, and…
Many methods that build powerful variational distributions based on unadjusted Langevin transitions exist. Most of these were developed using a wide range of different approaches and techniques. Unfortunately, the lack of a unified analysis…
We introduce a new framework for solving an important class of computational problems involving finite permutation groups, which includes calculating set stabilisers, intersections of subgroups, and isomorphisms of combinatorial structures.…
Despite the fact that the field of pattern avoiding permutations has been skyrocketing over the last two decades, there are very few exhaustive generating algorithms for such classes of permutations. In this paper we introduce the notions…
Diffusion generative models have excelled at diverse image generation and reconstruction tasks across fields. A less explored avenue is their application to discriminative tasks involving regression or classification problems. The…
Some 40 years ago Khmaladze introduced a transform which greatly facilitated the distribution free goodness of fit testing of statistical hypotheses. In the last decade, he has published a related transform, broadly offering an alternative…
The partial sums of integer sequences that count the occurrences of a specific pattern in the binary expansion of positive integers have been investigated by different authors since the 1950s. In this note, we introduce generalized pattern…
This paper introduces a new latent variable generative model able to handle high dimensional longitudinal data and relying on variational inference. The time dependency between the observations of an input sequence is modelled using…
In this paper we describe a general method to derive formulas relating the gap probability of some classical determinantal random point process (Airy, Pearcey and Hermite) with the gap probability of the processes related to the same…
Data analysts commonly utilize statistics to summarize large datasets. While it is often sufficient to explore only the summary statistics of a dataset (e.g., min/mean/max), Anscombe's Quartet demonstrates how such statistics can be…
This paper proposes a new theory and methodology to tackle the problem of unifying distributed analyses and inferences on shared parameters from multiple sources, into a single coherent inference. This surprisingly challenging problem…
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecular structures are mined to discover fragments useful as…
We investigate dissipative dynamical systems under the influence of an external driving with two or more frequencies. Our main quantities of interest are long-time averages of expectation values which turn out to exhibit universal features.…
In the present paper we extend Champernowne's construction of normal numbers to provide sequences which are generic for a given invariant probability measure, which need not be the maximal one. We present a construction together with…
We give a concise historical background to Montmort's matching problem and its modern variants such as the hat-check problem, then develop a unified counting framework for fixed-point-free allocations. Using elementary recurrence and…
We describe a method to probe the spectral fluctuations of a transition over broad ranges of frequencies and timescales with the high spectral resolution of Fourier spectroscopy, and a temporal resolution as high as the excited state…
A method based on orthogonal function series interpolation of the square root probability density to analyze higher dimensional scattered data is presented. The method is targeted for the use-case when the model and/or data are available…
The aim of this article is to investigate the issues of multiplicative inverses and composition in the set of formal Laurent series. We show the lack of general uniqueness of inverses of formal Laurent series; necessary and sufficient…
Truncated Fourier Transforms (TFTs), first introduced by Van der Hoeven, refer to a family of algorithms that attempt to smooth "jumps" in complexity exhibited by FFT algorithms. We present an in-place TFT whose time complexity, measured in…