相关论文: Completing a k-1 assignment

We give a conjecture for the expected value of the optimal k-assignment in an m x n-matrix, where the entries are all exp(1)-distributed random variables or zeros. We prove this conjecture in the case there is a zero-cost $k-1$-assignment.…

We continue the study of the assignment problem for a random cost matrix. We analyse the number of $k$-cycles for the solution and their dependence on the symmetry of the random matrix. We observe that for a symmetric matrix one and…

An assignment problem is the optimization problem of finding, in an m by n matrix of nonnegative real numbers, k entries, no two in the same row or column, such that their sum is minimal. Such an optimization problem is called a random…

For a random graph on n vertices where the edges appear with individual rates, we give exact formulas for the expected time at which the number of components has gone down to k and the expected length of the corresponding minimal spanning…

Choosing control inputs randomly can result in a reduced expected cost in optimal control problems with stochastic constraints, such as stochastic model predictive control (SMPC). We consider a controller with initial randomization, meaning…

We describe the behavior of the expectation of the maximum for a random assignment process built upon a square matrix with independent entries. Under mild assumptions on the underlying distribution, the answer is expressed in terms of its…

We discuss the optimal matching solution for both the assignment problem and the matching problem in one dimension for a large class of convex cost functions. We consider the problem in a compact set with the topology both of the interval…

The minimum k-assignment of an m by n matrix X is the minimum sum of k entries of X, no two of which belong to the same row or column. If X is generated by choosing each entry independently from the exponential distribution with mean 1,…

In many applications, it is of interest to approximate data, given by mxn matrix A, by a matrix B of at most rank k, which is much smaller than m and n. The best approximation is given by singular value decomposition, which is too time…

We study random multidimensional assignment problems where the costs decompose into the sum of independent random variables. In particular, in three dimensions, we assume that the costs $W_{i,j,k}$ satisfy…

In this paper, we study the maximum likelihood estimation of the parameters of the multivariate and matrix variate symmetric Laplace distributions through group actions. The multivariate and matrix variate symmetric Laplace distributions…

The random matrix uniformly distributed over the set of all m-by-n matrices over a finite field plays an important role in many branches of information theory. In this paper a generalization of this random matrix, called k-good random…

We develop techniques to compute the k-th Moment of the Eigenvalue-statistic for a random Matrix M the entries of which do not have to be necessarily Independent. The dependence is controlled via an equivalence relation on the pairs of the…

We prove two basic conjectures on the distribution of the smallest singular value of random n times n matrices with independent entries. Under minimal moment assumptions, we show that the smallest singular value is of order n^{-1/2}, which…

This paper considers an extension of the multivariate symmetric Laplace distribution to matrix variate case. The symmetric Laplace distribution is a scale mixture of normal distribution. The maximum likelihood estimators (MLE) of the…

Beautiful formulas are known for the expected cost of random two-dimensional assignment problems, but in higher dimensions even the scaling is not known. In three dimensions and above, the problem has natural "Axial" and "Planar" versions,…

We address the noncommutative version of the Edmonds' problem, which asks to determine the inner rank of a matrix in noncommuting variables. We provide an algorithm for the calculation of this inner rank by relating the problem with the…

Building on the free-probability stochastic control framework introduced in arXiv:2502.17329, we connect optimal control problems for $n \times n$ random matrix ensembles with their infinite-dimensional, free-probability analogues. Under…

We investigate the universality of singular value and eigenvalue distributions of matrix valued functions of independent random matrices and apply these general results in several examples. In particular we determine the limit distribution…

We study the maximum of the random assignment process on rectangular matrices. We derive first-order asymptotics for the expected maximum, prove a law of large numbers under mild tail assumptions, and obtain exponential upper bounds for the…