scientific article; zbMATH DE number 3584785
From MaRDI portal
zbMath0375.62045MaRDI QIDQ4153936
Persi Diaconis, Ronald L. Graham
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the exact region determined by Spearman's footrule and Gini's gamma, Efficient nearest neighbors methods for support vector machines in high dimensional feature spaces, Isomorphic Distances Among Elections, Approximate and dynamic rank aggregation, Stein's method for concentration inequalities, Rank aggregation: new bounds for MCx, A review: The arrangement increasing partial ordering, A framework for adaptive sorting, Fast Property Testing and Metrics for Permutations, Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists, Optimal full ranking from pairwise comparisons, Exact tables of Spearman's footrule for \(N=11(1)18\) with estimate of convergence and errors for the normal approximation, Multivariate arrangement increasing functions with applications in probability and statistics, A general theory of hypothesis testing based on rankings, The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders, Depth in classical Coxeter groups, Metrics on permutations useful for positive dependence, Measures of distinctness for random partitions and compositions of an integer, Concordance between two linear orders: The Spearman and Kendall coefficients revisited, On statistical properties of Chebyshev's norm, Computing similarity distances between rankings, On the lower bound of Spearman's footrule, Heuristic stability: a permutation disarray measure, Optimal Permutation Recovery in Permuted Monotone Matrix Model, On the exact region determined by Spearman's rho and Spearman's footrule, On the distribution of Gini’s rank association index, Byzantine preferential voting, Partition–Mallows Model and Its Inference for Rank Aggregation, Collective schedules: axioms and algorithms, Approximate sorting and its applications in I/O model, Voting rules as error-correcting codes, Worst-case versus average-case design for estimation from partial pairwise comparisons, On the exact regions determined by Kendall's tau and other concordance measures, Matrix compatibility and correlation mixture representation of generalized Gini's gamma, Vulnerability in dynamically driven oscillatory networks and power grids, Modeling value disagreement, Experiments with Kemeny ranking: What works when?, The absolute order on the hyperoctahedral group, Effect of scale on long-range random graphs and chromosomal inversions, Correction methods for ties in rank correlations, An Extended Mallows Model for Ranked Data Aggregation, Local distance constrained bribery in voting, Comparing and aggregating partially resolved trees, Are performance measures equally stable?, Sorting by swaps with noisy comparisons, Rank correlation methods for missing data, Spearman's footrule and Gini's gamma: local bounds for bivariate copulas and the exact region with respect to Blomqvist's beta, On graphs associated to sets of rankings, The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders, Permutations in two dimensions that maximally separate neighbors, The determinants of \(q\)-distance matrices of trees and two quantities relating to permutations, Group preference modeling for intelligent shared environments: social welfare beyond the sum, Sum of lengths of inversions in permutations, On rank statistics: An approach via metrics on the permutation group, Iterative ranking aggregation using quality improvement of subgroup ranking, Right invariant metrics and measures of presortedness, Crossing numbers of graphs with rotation systems, On the hardness of maximum rank aggregation problems, Nonparametric measures of dependence for biometric data studies, Unnamed Item, A new method for comparing rankings through complex networks: Model and analysis of competitiveness of major European soccer leagues, An efficient approach for the rank aggregation problem, Recovering the structure of random linear graphs, Crossing Number of Graphs with Rotation Systems, On permutations with bounded drop size, Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing, Computational geometric aspects of rhythm, melody, and voice-leading, Generalized measures of association for ranked data with an application to prediction accuracy, The Markov chain Monte Carlo revolution, The generating function for total displacement, On the complexity of crossings in permutations, A class of martingales with non-symmetric limit distributions, Distance and consensus for preference relations corresponding to ordered partitions, On Computing the Total Displacement Number via Weighted Motzkin Paths, An Algorithmic View of Voting, A new measure of presortedness, Beyond pairwise comparisons in social choice: a setwise Kemeny aggregation problem, Presorting algorithms: an average-case point of view, Two special subgroups of the universal sofic group, Unnamed Item, A copula‐based risk aggregation model, On the comparison of the Spearman and Kendall metrics between linear orders., Unknotted cycles, Faster random generation of linear extensions, The Spearman footrule and a Markov chain property, Rank correlation inequalities with ties and missing data, Sorting with Recurrent Comparison Errors, Pattern-functions, statistics, and shallow permutations, On a measurable analogue of small topological full groups. II, Statistical applications of linear assignment
