Related papers: Derangements and Generalizations: A Counting Note …
We prove that, in the coupon collector's problem, the point processes given by the times of $r$-th arrivals for coupons of each type, centered and normalized in a proper way, converge toward a non-homogeneous Poisson point process. This…
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…
The aim of this paper is to discuss Penot's problem on a generalization of Caristi's fixed point theorem. We settle this problem in the negative and we present some new theorems on the existence of fixed points of set-valued mappings in…
We study 4 problems in string matching, namely, regular expression matching, approximate regular expression matching, string edit distance, and subsequence indexing, on a standard word RAM model of computation that allows logarithmic-sized…
We consider the ground state of two species of one-dimensional critical free theories coupled together via a conformal interface. They have an internal $U(1)$ global symmetry and we investigate the quantum fluctuations of the charge across…
Motivated by questions arising in connection with branched coverings of connected smooth projective curves over finite fields, we study the proportion of fixed point free elements (derangements) in cosets of normal subgroups of primitive…
The decision problem of perfect matchings in uniform hypergraphs is famously an NP-complete problem. It has been shown by Keevash--Knox--Mycroft [STOC, 2013] that for every $\varepsilon>0$, such decision problem restricted to $k$-uniform…
It is generally known that counting statistics is not correctly described by a Gaussian approximation. Nevertheless, in neutron scattering, it is common practice to apply this approximation to the counting statistics; also at low counting…
Consider the problem of matching two independent i.i.d. samples of size $N$ from two distributions $P$ and $Q$ in $\mathbb{R}^d$. For an arbitrary continuous cost function, the optimal assignment problem looks for the matching that…
For interacting classical field theories such as general relativity exact solutions typically can only be found by imposing physically motivated (Killing) {\it symmetry} assumptions. Such highly symmetric solutions are then often used as…
The aim of this paper is to justify in dimensions two and three the ansatz of Caracciolo et al. stating that the displacement in the optimal matching problem is essentially given by the solution to the linearized equation i.e. the Poisson…
We develop a rigorous measure-theoretic framework for the analysis of fixed points of nonexpansive maps in the space $L^1(\mu)$, with explicit consideration of quantization errors arising in fixed-point arithmetic. Our central result shows…
We consider the minimization of a sum of a smooth function with a nonsmooth composite function, where the composition is applied on a random linear mapping. This random composite model encompasses many problems, and can especially capture…
Let $C$ be a nonempty closed and convex subset of a uniformly smooth and uniformly convex real Banach space $E$ with dual space $E^*$. We present a novel hybrid method for finding a common solution of a family of equilibrium problems, a…
We use representation theory of the symmetric group S_n to prove Poisson limit theorems for the distribution of fixed points for three types of non-uniform permutations. First, we give results for the commutator of g and x where g and x are…
In most computer vision and image analysis problems, it is necessary to define a similarity measure between two or more different objects or images. Template matching is a classic and fundamental method used to score similarities between…
The exact matching problem is a constrained variant of the maximum matching problem: given a graph with each edge having a weight $0$ or $1$ and an integer $k$, the goal is to find a perfect matching of weight exactly $k$. Mulmuley,…
Does a given system of linear equations with nonnegative constraints have an integer solution? This is a fundamental question in many areas. In statistics this problem arises in data security problems for contingency table data and also is…
In this paper, we consider the problem of counting and sampling structures in graphs. We define a class of "edge universal labeling problems"---which include proper $k$-colorings, independent sets, and downsets---and describe simple…
The paper is concerned with the classical occupancy scheme with infinitely many boxes, in which $n$ balls are thrown independently into boxes $1,2,...$, with probability $p_j$ of hitting the box $j$, where $p_1\geq p_2\geq...>0$ and…