Related papers: Random gap processes and asymptotically complete s…
The Ewens sampling formula with parameter $\alpha$ is the distribution on $S_n$ which gives each $\pi\in S_n$ weight proportional to $\alpha^{C(\pi)}$, where $C(\pi)$ is the number of cycles of $\pi$. We show that, for any fixed $\alpha$,…
In this paper, we study the properties of the weighted entropy generating function (WEGF). We also introduce the weighted residual entropy generating function (WREGF) and establish some characterization results based on its connections with…
We focus on a data sequence produced by repetitive quantum measurement on an internal hidden quantum system, and call it a hidden Markovian process. Using a quantum version of the Perron-Frobenius theorem, we derive novel upper and lower…
The Gaussian process (GP) is a nonparametric prior distribution over functions indexed by time, space, or other high-dimensional index set. The GP is a flexible model yet its limitation is given by its very nature: it can only model…
This paper studies several properties of channel codes that approach the fundamental limits of a given (discrete or Gaussian) memoryless channel with a non-vanishing probability of error. The output distribution induced by an…
In this paper, we extend recent results about the distribution of even and odd gaps of a numerical semigroup. We find that, for any numerical semigroup, the distribution can be computed in terms of the numbers of or the sums of odd and even…
Temporal point processes offer a powerful framework for sampling from discrete distributions, yet they remain underutilized in existing literature. We show how to construct, for any target multivariate count distribution with…
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n,p) in the critical window p=n^{-1}+lambda n^{-4/3}. In particular, we show that this point process has a surprising…
Every finitely generated self-similar group naturally produces an infinite sequence of finite $d$-regular graphs $\Gamma_n$. We construct self-similar groups, whose graphs $\Gamma_n$ can be represented as an iterated zig-zag product and…
We show how to generate random derangements efficiently by two different techniques: random restricted transpositions and sequential importance sampling. The algorithm employing restricted transpositions can also be used to generate random…
We consider the distribution of cycles in two models of random permutations, that are related to one another. In the first model, cycles receive a weight that depends on their length. The second model deals with permutations of points in…
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…
We construct random point processes in the complex plane that are asymptotically close to a given doubling measure. The processes we construct are the zero sets of random entire functions that are constructed through generalised Fock…
We present an explicit construction of a Markovian random growth process on integer partitions such that given it visits some level $n$, it passes through any partition $\lambda$ of $n$ with equal probabilities. The construction has…
Cumulative weight enumerators of random linear codes are introduced, their asymptotic properties are studied, and very sharp thresholds are exhibited; as a consequence, it is shown that the asymptotic Gilbert-Varshamov bound is a very sharp…
Conformal inference is a versatile tool for building prediction sets in regression or classification. We study the false coverage proportion (FCP) in a simultaneous inference setting with a calibration sample of $n$ points and a test sample…
Let $x$ be a complex random variable such that ${\E {x}=0}$, ${\E |x|^2=1}$, ${\E |x|^{4} < \infty}$. Let $x_{ij}$, $i,j \in \{1,2,...\}$ be independet copies of $x$. Let ${\Xb=(N^{-1/2}x_{ij})}$, $1\leq i,j \leq N$ be a random matrix.…
In this paper, based on the theory of defining sets, two classes of at most six-weight linear codes over $\mathbb{F}_p$ are constructed. The weight distributions of the linear codes are determined by means of Gaussian period and Weil sums.…
In this paper, the complete moment convergence for the partial sums of moving average processes $\{X_n=\sum_{i=-\infty}^{\infty}a_iY_{i+n},n\ge 1\}$ is proved under some proper conditions, where $\{Y_i,-\infty<i<\infty\}$ is a doubly…
Let $G(n,c/n)$ and $G_r(n)$ be an $n$-node sparse random graph and a sparse random $r$-regular graph, respectively, and let ${\cal I}(n,r)$ and ${\cal I}(n,c)$ be the sizes of the largest independent set in $G(n,c/n)$ and $G_r(n)$. The…