Related papers: A critical quartet for queuing couples
We study the distribution of the minimum spacing between eigenvalues of a random n by n unitary matrix. The minimum spacing scales as $n^{-4/3}$, not $n^{-2}$ as would be the case for n independent points on the unit circle, illustrating…
For a random sample of points in $\mathbb{R}$, we consider the number of pairs whose members are nearest neighbors (NN) to each other and the number of pairs sharing a common NN. The first type of pairs are called reflexive NNs whereas…
In this paper it was shown that all prime numbers lie on 96 half-lines. At the same time, it was shown that if a given number does not lie on any of the above half-lines, then it is a composite number. A corresponding linear mathematical…
Computer experiments reveal that twin primes tend to center on nonsquarefree multiples of 6 more often than on squarefree multiples of 6 compared to what should be expected from the ratio of the number of nonsquarefree multiples of 6 to the…
In this article we review recent generalisations of the central limit theorem for the sum of specially correlated (or q-independent) variables, focusing on q greater or equal than 1. Specifically, this kind of correlation turns the…
A point set $P \subset {\Bbb{R}}^d$ is {\it separated} if the minimum distance between any two points in $P$ is at least $1$. For $d \ne 4,5,$ we determine, for every $t_1,t_2 \ge 1$, and for $n$ at least a suitable $n_d$, the maximum…
The stable matching problem has been the subject of intense theoretical and empirical study since the seminal 1962 paper by Gale and Shapley. The number of stable matchings for different systems of preferences has been studied in many…
We use the fact that certain cosets of the stabilizer of points are pairwise conjugate in a symmetric group $S_n$ in order to construct recurrence relations for enumerating certain subsets of $S_n$. Occasionally one can find `closed form'…
We consider random interlacements on Z^d, with d bigger or equal to 3, when their vacant set is in a strongly percolative regime. We derive an asymptotic upper bound on the probability that the random interlacements disconnect a box of…
We discuss in detail the asymptotic distribution of sample expectiles. First, we show uniform consistency under the assumption of a finite mean. In case of a finite second moment, we show that for expectiles other then the mean, only the…
Consider a network where all nodes are distributed on a unit square following a Poisson distribution with known density $\rho$ and a pair of nodes separated by an Euclidean distance $x$ are directly connected with probability…
This paper proposes a novel, nonparametric, interpoint distance-based measure to investigate whether there exist any groups in a set of given data, and if so then, how many groups are prevailing in total. It is a cluster accuracy index…
We investigate a system of four nearest neighbour bidirectional coupled phase oscillators of dissimilar initial frequencies in a ring at the changeover into a synchronizing state. There are twenty four permutations upon assigning the…
The stable roommates problem does not necessarily have a solution, i.e. a stable matching. We had found that, for the uniformly random instance, the expected number of solutions converges to $e^{1/2}$ as $n$, the number of members, grows,…
Motivated by some cutting edge circular data such as from Smart Home technologies and roulette spins from online and casino, we construct some new rich classes of discrete distributions on the circle. We give four new general methods of…
We study the random variable B(c,n), which counts the number of balls that must be thrown into n equally-sized bins in order to obtain c collisions. The asymptotic expected value of B(1,n) is the well-known $\sqrt{n\pi/2}$ appearing in the…
It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a general class of large random markets the algorithm will find a…
High-order phenomena play crucial roles in many systems of interest, but their analysis is often highly nontrivial. There is a rich literature providing a number of alternative information-theoretic quantities capturing high-order…
We extend the jigsaw percolation model to analyze graphs where both underlying people and puzzle graphs are Erd\H{o}s-R\'enyi random graphs. Let $p_{\text{ppl}}$ and $p_{\text{puz}}$ denote the probability that an edge exists in the…
Consider a random graph G in G(n,p) and the graph property: G contains a copy of a specific graph H. (Note: H depends on n; a motivating example: H is a Hamiltonian cycle.) Let q be the minimal value for which the expected number of copies…