Related papers: Random multi-index matching problems
Typical behavior of the linear programming problem (LP) is studied as a relaxation of the minimum vertex cover problem, which is a type of the integer programming problem (IP). To deal with the LP and IP by statistical mechanics, a…
Recently, hybrid metaheuristics have become a trend in operations research. A successful example combines the Greedy Randomized Adaptive Search Procedures (GRASP) and data mining techniques, where frequent patterns found in high-quality…
The reweighting method is widely used in numerical studies of QCD, in particular, for the cases in which the conventional Monte-Carlo method cannot be applied directly, e.g., finite density QCD. However, the application range of the…
The Multi-Objective Mixed-Integer Programming (MOMIP) problem is one of the most challenging. To derive its Pareto optimal solutions one can use the well-known Chebyshev scalarization and Mixed-Integer Programming (MIP) solvers. However,…
A wide class of problems in combinatorics, computer science and physics can be described along the following lines. There are a large number of variables ranging over a finite domain that interact through constraints that each bind a few…
Time-dependent gravity data from satellite missions like GRACE-FO reveal mass redistribution in the system Earth at various time scales: long-term climate change signals, inter-annual phenomena like El Nino, seasonal mass transports and…
Random embeddings project high-dimensional spaces to low-dimensional ones; they are careful constructions which allow the approximate preservation of key properties, such as the pair-wise distances between points. Often in the field of…
We consider the superconformal quantum mechanics associated to BPS black holes in type IIB Calabi-Yau compactifications. This quantum mechanics describes the dynamics of D-branes in the near-horizon attractor geometry of the black hole. In…
Model-based design of experiments (MBDoE) is a powerful framework for selecting and calibrating science-based mathematical models from data. This work extends popular MBDoE workflows by proposing a convex mixed integer (non)linear…
We consider a class of simple one parameter families of interval maps, and we study how metric (resp. topological) entropy changes as the parameter varies. We show that in many cases the entropy displays a semi-regular behaviour, i.e. it is…
The task of estimating a matrix given a sample of observed entries is known as the \emph{matrix completion problem}. Most works on matrix completion have focused on recovering an unknown real-valued low-rank matrix from a random sample of…
Large-scale hypothesis testing has become a ubiquitous problem in high-dimensional statistical inference, with broad applications in various scienfitic disciplines. One relevant application is constituted by imaging mass spectrometry (IMS)…
The persistent null results at dark matter (DM) direct-detection experiments have pushed the popular weakly interacting massive particle (WIMP) DM to tight corners. Generic WIMP models with direct-detection rate below the current upper…
We study random simplicial complexes in the multi-parameter upper model. In this model simplices of various dimensions are taken randomly and independently, and our random simplicial complex $Y$ is then taken to be the minimal simplicial…
Models with many signals, high-dimensional models, often impose structures on the signal strengths. The common assumption is that only a few signals are strong and most of the signals are zero or close (collectively) to zero. However, such…
We consider the moment space $\mathcal{M}_n^{K}$ corresponding to $p \times p$ complex matrix measures defined on $K$ ($K=[0,1]$ or $K=\D$). We endow this set with the uniform law. We are mainly interested in large deviations principles…
A mixed-integer linear programming (MILP) formulation is presented for parameter estimation of the Potts model. Two algorithms are developed; the first method estimates the parameters such that the set of ground states replicate the…
It is well known that selecting a good Mixed Integer Programming (MIP) formulation is crucial for an effective solution with state-of-the art solvers. While best practices and guidelines for constructing good formulations abound, there is…
We consider the task of estimating a conditional density using i.i.d. samples from a joint distribution, which is a fundamental problem with applications in both classification and uncertainty quantification for regression. For joint…
We study pairs and m--tuples of compositions of a positive integer n with parts restricted to a subset P of positive integers. We obtain some exact enumeration results for the number of tuples of such compositions having the same number of…