相关论文: The distribution of values in the quadratic assign…

We propose and develop a novel framework for analyzing permutation-based combinatorial optimization problems, which could eventually be extended to other types of problems. Our approach is based on the decomposition of the objective…

The assumption that the elements of the cost matrix in the classical assignment problem are drawn independently from a standard Gaussian distribution motivates the study of a particular Gaussian field indexed by the symmetric permutation…

Let $x_1 < \dots < x_n$ and $y_1 < \dots < y_n$, $n \in \mathbb N$, be real numbers. We show by an example that the assignment problem $$ \max_{\sigma \in S_n} F_\sigma(x,y) := \frac12 \sum_{i,k=1}^n |x_i - x_k|^\alpha \, |y_{\sigma(i)} -…

A parking function on $[n]$ creates a permutation in $S_n$ via the order in which the $n$ cars appear in the $n$ parking spaces. Placing the uniform probability measure on the set of parking functions on $[n]$ induces a probability measure…

In this paper we characterize all distributional limits of the random quadratic form $T_n =\sum_{1\le u< v\le n} a_{u, v} X_u X_v$, where $((a_{u, v}))_{1\le u,v\le n}$ is a $\{0, 1\}$-valued symmetric matrix with zeros on the diagonal and…

We consider Gaussian distributions on certain Riemannian symmetric spaces. In contrast to the Euclidean case, it is challenging to compute the normalization factors of such distributions, which we refer to as partition functions. In some…

We investigate how the range of parameters that specify the two-particle distribution function is restricted if we require that this function be obtained from the $n^{\rm th}$ order distribution functions that are symmetric with respect to…

We introduce a rather natural family of non-uniform distributions on $PF_n$, $n\in\mathbb{N}$, the set of parking functions of length $n$. One of the motivations for this comes from a similar situation in the context of integer partitions.…

For an $n \times n$ independent-entry random matrix $X_n$ with eigenvalues $\lambda_1, \ldots, \lambda_n$, the seminal work of Rider and Silverstein asserts that the fluctuations of the linear eigenvalue statistics $\sum_{i=1}^n…

We consider composition orderings for linear functions of one variable. Given $n$ linear functions $f_1,\dots,f_n$ and a constant $c$, the objective is to find a permutation $\sigma$ that minimizes/maximizes $f_{\sigma(n)}\circ\dots\circ…

Distribution functions for random variables that depend on a parameter are computed asymptotically for ensembles of positive Hermitian matrices. The inverse Fourier transform of the distribution is shown to be a Fredholm determinant of a…

The traveling salesman problem is one of the most studied combinatorial optimization problems, because of the simplicity in its statement and the difficulty in its solution. We characterize the optimal cycle for every convex and increasing…

The second author had previously obtained explicit generating functions for moments of characteristic polynomials of permutation matrices (n points). In this paper, we generalize many aspects of this situation. We introduce random shifts of…

For a pair of coupled rectangular random matrices we consider the squared singular values of their product, which form a determinantal point process. We show that the limiting mean distribution of these squared singular values is described…

Solution and analysis of mathematical programming problems may be simplified when these problems are symmetric under appropriate linear transformations. In particular, a knowledge of the symmetries may help reduce the problem dimension, cut…

Given a countably infinite group $G$ acting on some space $X$, an increasing family of finite subsets $G_n$ and $x\in X$, a natural question to ask is what asymptotical distribution the sets $G_nx$ form. More formally, we define for a…

A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…

Let M be an nXn symetric matrix, n, even, T, an upper bound for T_OPT, an optimal tour, sigma_T, the smaller-valued perfect matching obtained from alternate edges of T expressed as a product of 2-cycles. Applying the modified Floyd-Warshall…

Motivated by the fact that circular or spherical data are often much concentrated around a location $\pmb\theta$, we consider inference about $\pmb\theta$ under "high concentration" asymptotic scenarios for which the probability of any…

Gaussian distributions can be generalized from Euclidean space to a wide class of Riemannian manifolds. Gaussian distributions on manifolds are harder to make use of in applications since the normalisation factors, which we will refer to as…