Related papers: Computing the distribution of the maximum in balls…
Studies on the propagation of malware in mobile networks have revealed that the spread of malware can be highly inhomogeneous. Platform diversity, contact list utilization by the malware, clustering in the network structure, etc. can also…
There seems to be an upper limit to predicting the outcome of matches in (semi-)professional sports. Recent work has proposed that this is due to chance and attempts have been made to simulate the distribution of win percentages to identify…
Sum-of-norms clustering is a convex optimization problem whose solution can be used for the clustering of multivariate data. We propose and study a localized version of this method, and show in particular that it can separate arbitrarily…
Healthcare systems are facing serious challenges in balancing their human resources to cope with volatile service demand, while at the same time providing necessary job satisfaction to the healthcare workers. We propose in this paper a…
We prove that the probability that a sum of independent random variables in $\mathbb{R}^d$ with bounded densities lies in a ball is maximized by taking uniform distributions on balls. This in turn generalizes a result by Rogozin on the…
The apportionment problem deals with the fair distribution of a discrete set of $k$ indivisible resources (such as legislative seats) to $n$ entities (such as parties or geographic subdivisions). Highest averages methods are a frequently…
Calculation of the distribution of the average value of a Gaussian random field in a finite domain is carried out for different cases. The results of the calculation demonstrate a strong dependence of the width of the distribution on the…
A characterization of the exponential distribution based on equidistribution conditions for maxima of random samples with consecutive sizes n-1 and n for an arbitrary and fixed n>2 is proved. This solves an open problem stated recently in…
We consider the mass-dependent aggregation process (k+1)X -> X, given a fixed number of unit mass particles in the initial state. One cluster is chosen proportional to its mass and is merged into one either with k-neighbors in one…
This article examines how diseases on random networks spread in time. The disease is described by a probability distribution function for the number of infected and recovered individuals, and the probability distribution is described by a…
In the classical balls-and-bins model, $m$ balls are allocated into $n$ bins one by one uniformly at random. In this note, we consider the $d$-thinning variant of this model, in which the process is regulated in an on-line fashion as…
The $k$-Means clustering problem on $n$ points is NP-Hard for any dimension $d\ge 2$, however, for the 1D case there exists exact polynomial time algorithms. Previous literature reported an $O(kn^2)$ time dynamic programming algorithm that…
We describe a maximum-likelihood method for determining the mass distribution in spherical stellar systems from the radial velocities of a population of discrete test particles. The method assumes a parametric form for the mass distribution…
For non-uniformly hyperbolic dynamical systems we consider the time series of maxima along typical orbits. Using ideas based upon quantitative recurrence time statistics we prove convergence of the maxima (under suitable normalization) to…
We use the holonomic ansatz to estimate the asymptotic behavior, in $T$, of the average maximal number of balls in a bin that is obtained when one throws uniformly at random (without replacement) $r$ balls into $n$ bins, $T$ times. Our…
Possibility theory is proposed as an uncertainty representation framework for distributed learning in multi-agent systems and robot swarms. In particular, we investigate its application to the best-of-n problem where the aim is for a…
Constrained submodular set function maximization problems often appear in multi-agent decision-making problems with a discrete feasible set. A prominent example is the problem of multi-agent mobile sensor placement over a discrete domain.…
Constrained submodular set function maximization problems often appear in multi-agent decision-making problems with a discrete feasible set. A prominent example is the problem of multi-agent mobile sensor placement over a discrete domain.…
We develop novel clustering algorithms for functional data when the number of clusters $K$ is unknown and also when it is prefixed. These algorithms are developed based on the Maximum Mean Discrepancy (MMD) measure between two sets of…
For a variant of the algorithm in [Pit19] (arXiv:1903.10816) to compute the approximate density or distribution function of a linear mixture of independent random variables known by a finite sample, it is presented a proof of the functional…