998 research outputs found

    On sorting by 3-bounded transpositions

    Get PDF
    AbstractHeath and Vergara [Sorting by short block moves, Algorithmica 28 (2000) 323–352] proved the equivalence between sorting by 3-bounded transpositions and sorting by correcting skips and correcting hops. This paper explores various algorithmic as well as combinatorial aspects of correcting skips/hops, with the aim of understanding 3-bounded transpositions better.We show that to sort any permutation via correcting hops and skips, ⌊n/2⌋ correcting skips suffice. We also present a tighter analysis of the 43 approximation algorithm of Heath and Vergara, and a possible simplification. Along the way, we study the class Hn of those permutations of Sn which can be sorted using correcting hops alone, and characterize large subsets of this class. We obtain a combinatorial characterization of the set Gn⊆Sn of all correcting-hop-free permutations, and describe a linear-time algorithm to optimally sort such permutations. We also show how to efficiently sort a permutation with a minimum number of correcting moves

    Random induced subgraphs of Cayley graphs induced by transpositions

    Get PDF
    In this paper we study random induced subgraphs of Cayley graphs of the symmetric group induced by an arbitrary minimal generating set of transpositions. A random induced subgraph of this Cayley graph is obtained by selecting permutations with independent probability, λn\lambda_n. Our main result is that for any minimal generating set of transpositions, for probabilities λn=1+ϵnn−1\lambda_n=\frac{1+\epsilon_n}{n-1} where n−1/3+δ≤ϵn0n^{-{1/3}+\delta}\le \epsilon_n0, a random induced subgraph has a.s. a unique largest component of size ℘(ϵn)1+ϵnn−1n!\wp(\epsilon_n)\frac{1+\epsilon_n}{n-1}n!, where ℘(ϵn)\wp(\epsilon_n) is the survival probability of a specific branching process.Comment: 18 pages, 1 figur

    Sparse Tensor Transpositions

    Full text link
    We present a new algorithm for transposing sparse tensors called Quesadilla. The algorithm converts the sparse tensor data structure to a list of coordinates and sorts it with a fast multi-pass radix algorithm that exploits knowledge of the requested transposition and the tensors input partial coordinate ordering to provably minimize the number of parallel partial sorting passes. We evaluate both a serial and a parallel implementation of Quesadilla on a set of 19 tensors from the FROSTT collection, a set of tensors taken from scientific and data analytic applications. We compare Quesadilla and a generalization, Top-2-sadilla to several state of the art approaches, including the tensor transposition routine used in the SPLATT tensor factorization library. In serial tests, Quesadilla was the best strategy for 60% of all tensor and transposition combinations and improved over SPLATT by at least 19% in half of the combinations. In parallel tests, at least one of Quesadilla or Top-2-sadilla was the best strategy for 52% of all tensor and transposition combinations.Comment: This work will be the subject of a brief announcement at the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '20
    • …
    corecore