2019
DOI: 10.3150/17-bej1017
|View full text |Cite
|
Sign up to set email alerts
|

Mallows and generalized Mallows model for matchings

Abstract: The Mallows and Generalized Mallows Models are two of the most popular probability models for distributions on permutations. In this paper we consider both models under the Hamming distance. This models can be seen as models for matchings instead of models for rankings. These models can not be factorized, which contrasts with the popular MM and GMM under Kendall's-τ and Cayley distances. In order to overcome the computational issues that the models involve, we introduce a novel method for computing the partiti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
23
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(23 citation statements)
references
References 36 publications
0
23
0
Order By: Relevance
“…In addition to adjusted R 2 , when the goal is to find the most appropriate model involving multitude subsets of regressors, a criterion of Mallows' C p statistic (Equation (2)) is generally applied [60,61]. Examples include checking matchings between the subsets [108], model averaging [109][110][111], measuring the deviations from perfect rankings [112], and model selection [113].…”
Section: Stagementioning
confidence: 99%
“…In addition to adjusted R 2 , when the goal is to find the most appropriate model involving multitude subsets of regressors, a criterion of Mallows' C p statistic (Equation (2)) is generally applied [60,61]. Examples include checking matchings between the subsets [108], model averaging [109][110][111], measuring the deviations from perfect rankings [112], and model selection [113].…”
Section: Stagementioning
confidence: 99%
“…The Mallows Models (MM) is a family of probabilistic models on the space of permutations of size n (S n ). The MM is one of the most simple and natural distributions on S n , requiring just two parameters: the concentration parameter θ ∈ R + and the location parameter, σ 0 ∈ S n [5]. The location parameter, also known as the central permutation, is the mode of the distribution.…”
Section: Distance Based Probability Modelsmentioning
confidence: 99%
“…Roughly, the sampling procedure is as follows: We center an MM in a permutation chosen u.a.r from the selected set of permutations (where θ is set according to the exploration-exploitation scheme) and sample a new permutation from this distribution. In particular, we use the Distance Sampling Algorithm, see [5] for details and implementations. As stated previously, our algorithm hybridizes an EDA with a bestfirst local search procedure.…”
Section: Hamming Based Kmm Edamentioning
confidence: 99%
“…Inspired by the generalised Mallows model (Irurozki et al, 2019), the model here using the Hamming distance can be extended to one using the weighted Hamming distance. By introducing T precision parameters λ 1 , .…”
Section: Exponential-distance Modelsmentioning
confidence: 99%