Related papers: The distribution of values in the quadratic assign…
Random integers, sampled uniformly from $[1,x]$, share similarities with random permutations, sampled uniformly from $S_n$. These similarities include the Erd\H{o}s--Kac theorem on the distribution of the number of prime factors of a random…
We characterize the optimal reward functions (scoring rules) that incentivize an agent to acquire information and report it truthfully to the principal. The optimal scoring rules let the agent make a simple binary bet in single-dimensional…
Consider an $N\times n$ random matrix $Y_n=(Y^n_{ij})$ where the entries are given by $Y^n_{ij}=\frac{\sigma_{ij}(n)}{\sqrt{n}}X^n_{ij}$, the $X^n_{ij}$ being independent and identically distributed, centered with unit variance and…
We study the asymptotic behavior of two statistics defined on the symmetric group S_n when n tends to infinity: the number of elements of S_n having k records, and the number of elements of S_n for which the sum of the positions of their…
Let M be an arbitrary Hermitian matrix of order n, and k be a positive integer less than or equal to n. We show that if k is large, the distribution of eigenvalues on the real line is almost the same for almost all principal submatrices of…
In this paper, we study the distribution of the minimal distance (in the Hamming metric) of a random linear code of dimension $k$ in $\mathbb{F}_q^n$. We provide quantitative estimates showing that the distribution function of the minimal…
We determine the joint limiting distribution of adjacent spacings around a central, intermediate, or an extreme order statistic $X_{k:n}$ of a random sample of size $n$ from a continuous distribution $F$. For central and intermediate cases,…
This paper considers a distributed optimization problem over a multi-agent network, in which the objective function is a sum of individual cost functions at the agents. We focus on the case when communication between the agents is described…
Let $S_n$ be the symmetric group of all permutations of $\{1, \cdots, n\}$ with two generators: the transposition switching $1$ with $2$ and the cyclic permutation sending $k$ to $k+1$ for $1\leq k\leq n-1$ and $n$ to $1$ (denoted by…
The goal of this article is to study how much the eigenvalues of large Hermitian random matrices deviate from certain deterministic locations -- or in other words, to investigate optimal rigidity estimates for the eigenvalues. We do this in…
In this pedagogical work we reviewed the mathematical formalism and the physical interpretation, based on statistical mechanics, of the meta-heuristics called simulated annealing. Moreover, we presented the mathematical formulation of the…
We examine strategy-proof elections to select a winner amongst a set of agents, each of whom cares only about winning. This impartial selection problem was introduced independently by Holzman and Moulin and Alon et al. Fisher and Klimm…
We study the problem of fairly allocating a set of indivisible items among a set of agents. We consider the notion of (approximate) maximin share (MMS) and we provide an improved lower bound of $1/2$ (which is tight) for the case of…
We study the numerical range of an $n\times n$ cyclic shift matrix, which can be viewed as the adjacency matrix of a directed cycle with $n$ weighted arcs. In particular, we consider the change in the numerical range if the weights are…
We consider the \mnk{classical} problem of a controller activating (or sampling) sequentially from a finite number of $N \geq 2$ populations, specified by unknown distributions. Over some time horizon, at each time $n = 1, 2, \ldots$, the…
Consider an $n \times n$ non-Hermitian random matrix $M_n$ whose entries are independent real random variables. Under suitable conditions on the entries, we study the fluctuations of the entries of $f(M_n)$ as $n$ tends to infinity, where…
This paper studies the asymptotic behaviors of the pairwise angles among n randomly and uniformly distributed unit vectors in R^p as the number of points n -> infinity, while the dimension p is either fixed or growing with n. For both…
A recursive method is derived to calculate all eigenvalue correlation functions of a random hermitian matrix in the large size limit, and after smoothing of the short scale oscillations. The property that the two-point function is…
We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation grows to infinity.
We consider game-theoretically secure distributed protocols for coalition games that approximate the Shapley value with small multiplicative error. Since all known existing approximation algorithms for the Shapley value are randomized, it…