相关论文: The distribution of values in the quadratic assign…
We study how the order of N independent random walks in one dimension evolves with time. Our focus is statistical properties of the inversion number m, defined as the number of pairs that are out of sort with respect to the initial…
The paper is devoted to the study of some well-knonw combinatorial functions on the symmetric group $\sn$ --- the major index $\maj$, the descent number $\des$, and the inversion number $\inv$ --- from the representation-theoretic point of…
We consider the problem of approximating two, possibly unrelated probability distributions from a single complex-valued function $\psi$ and its Fourier transform. We show that this problem always has a solution within a specified degree of…
In random matrix theory, the spacing distribution functions $p^{(n)}(s)$ are well fitted by the Wigner surmise and its generalizations. In this approximation the spacing functions are completely described by the behavior of the exact…
The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional fixed-point equation. We give an algorithm for perfect…
The concept of median/consensus has been widely investigated in order to provide a statistical summary of ranking data, i.e. realizations of a random permutation $\Sigma$ of a finite set, $\{1,\; \ldots,\; n\}$ with $n\geq 1$ say. As it…
We show that any smooth permutation $\sigma\in S_n$ is characterized by the set ${\mathbf{C}}(\sigma)$ of transpositions and $3$-cycles in the Bruhat interval $(S_n)_{\leq\sigma}$, and that $\sigma$ is the product (in a certain order) of…
Let $H$ be a Hilbert space and $H_1,...,H_n$ be closed subspaces of $H$. Set $H_0:=H_1\cap H_2\cap...\cap H_n$ and let $P_k$ be the orthogonal projection onto $H_k$, $k=0,1,...,n$. The paper is devoted to the study of functions…
The eigenvalues of an arbitrary quaternionic matrix have a joint probability distribution function first derived by Ginibre. We show that there exists a mapping of this system onto a fermionic field theory and then use this mapping to…
Many recent approximation algorithms for different variants of the traveling salesman problem (asymmetric TSP, graph TSP, s-t-path TSP) exploit the well-known fact that a solution of the natural linear programming relaxation can be written…
In this paper, we introduce maximum composition ordering problems. The input is $n$ real functions $f_1,\dots,f_n:\mathbb{R}\to\mathbb{R}$ and a constant $c\in\mathbb{R}$. We consider two settings: total and partial compositions. The…
In this work we consider the mean field traveling salesman problem, where the intercity distances are taken to be i.i.d. with some distribution $F$. This paper focus on the \emph{nearest neighbor tour} which is to move to the nearest…
In this paper we investigate the distribution of the set of values of a quadratic form Q, at integral points. In particular we are interested in the n-point correlations of the this set. The asymptotic behaviour of the counting function…
We consider the problem of detecting the presence of a submatrix with larger-than-usual values in a large data matrix. This problem was considered in (Butucea and Ingster, 2013) under a one-parameter exponential family, and one of the test…
For a natural number n, let M(n) denote the maximum exponent of any prime power dividing n, and let m(n) denote the minimum exponent of any prime power dividing n. We study the second moments of these arithmetic functions and establish…
We study the covariance property of quadratic time-frequency distributions with respect to the action of the extended symplectic group. We show how covariance is related, and in fact in competition, with the possibility of damping the…
In the maximum traveling salesman problem (Max TSP) we are given a complete undirected graph with nonnegative weights on the edges and we wish to compute a traveling salesman tour of maximum weight. We present a fast combinatorial $\frac…
The aim of the paper is to compare different approximation algorithms for the travelling salesperson problem. We pick the most popular and widespread methods known in the literature and contrast them with a novel approach (the polygonal…
Optimal transport (OT) based data analysis is often faced with the issue that the underlying cost function is (partially) unknown. This paper is concerned with the derivation of distributional limits for the empirical OT value when the cost…
A probability distribution is n-divisible if its nth convolution root exists. While modeling the dependence structure between several (re)insurance losses by an additive risk factor model, the infinite divisibility, that is the…