Search arXivSearch

arXiv · 2212.03811

Generalized Lorenz dominance orders

Abstract

We extend the discrete majorization theory by working with non-normalized Lorenz curves. Then we prove two generalizations of the Muirhead theorem. These not only use elementary transfers but also local increases. Together these operations are described as elementary impact increases. The first generalization shows that if an array X is dominated, in the generalized sense, by an array Y then Y can be derived from X by a finite number of elementary impact increases and this in such a way that each step transforms an array into a new one which is strictly larger in the generalized majorization sense. The other one shows that if the dominating array, Y, is ordered decreasingly then elementary impact increases starting from the dominated array, X, lead to the dominating one. Here each step transforms an array to a new one for which the decreasingly ordered version dominates the previous one and is dominated by Y.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Leo Egghe, Ronald Rousseau. 2022-12-07. Generalized Lorenz dominance orders. https://arxiv.org/abs/2212.03811

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Flip Dynamics for Sampling Colorings: Improving $(11/6-ε)$ Using a Simple Metric

We present improved bounds for randomly sampling $k$-colorings of graphs with maximum degree $Δ$; our results hold without any further structural assumptions on the graph. The Glauber dynamics is a simple single-site update Markov chain. Jerrum (1995) proved an optimal $O(n\log{n})$ mixing-time bound for Glauber dynamics whenever $k>2Δ$ where $Δ$ is the maximum degree of the input graph. This bound was improved by Vigoda (1999) to $k>(11/6)Δ$ using a "flip" dynamics which recolors (small) maximal two-colored components in each step. Vigoda's result was the best known for general graphs for 20 years until Chen et al. (2019) established optimal mixing of the flip dynamics for $k>(11/6-\varepsilon)Δ$ where $\varepsilon\approx 10^{-5}$. We present the first substantial improvement over these results. We prove an optimal mixing-time bound of $O(n\log{n})$ for the flip dynamics when $Δ\geq125$ and $k\geq1.809Δ$. This yields, through recent spectral independence results, an optimal $O(n\log{n})$ mixing time for the Glauber dynamics for every fixed $Δ\geq125$ in the same range of $k/Δ$. Our proof utilizes path coupling with a simple weighted Hamming distance for "unblocked" neighbors.

cs.DM

Factorisability of Low Dimensional Non-Negative Integer Matrices

We consider the problem of determining if a given two-dimensional nonnegative integer matrix $M$ is the product of two such matrices, excluding trivial units. A matrix $M$ with no such factorisation is called prime and therefore belongs to the minimal (infinite rank) generator of $2 \times 2$ matrices over the natural numbers, otherwise it is called composite. We also consider the problem of finding a (non-unique) factorisation of a composite matrix. Our results have applications in computational group theory and the theory of codes, where such matrices are called incidence matrices. We analyse the complexity of primality and finding a factorisation for a composite matrix, providing a first efficient algorithm.

cs.DM