Random Permutations

Random Permutations is a probabilistic combinatorial model that specifies a uniform probability distribution over the set of all permutations of a given finite set, distinguishing it from deterministic permutation models by assigning equal likelihood to each possible ordering.

401

Publications

25.7K

Citations

679

Authors

381

Institutions

Publications per year

2017–2026

62

Authors

679

  1. YD
    Yong Deng

    University of Electronic Science and Technology of China, China

    8 publications · 294 citations

    8

    h-index

  2. PD
    Persi Diaconis

    Stanford University, United States

    8 publications · 1.1K citations

    8

    h-index

  3. ST
    Simon Tavaré

    University of Cambridge, United Kingdom

    7 publications · 443 citations

    7

    h-index

  4. SJ
    Svante Janson

    Uppsala University, Sweden

    6 publications · 131 citations

    6

    h-index

  5. DU
    Daniel Ueltschi

    University of Warwick, United Kingdom

    6 publications · 290 citations

    6

    h-index

1–5 of 679

Venues

  1. Random Structures and Algorithms

    17 publications · 451 citations

    14

    h-index

  2. Combinatorics Probability Computing

    15 publications · 492 citations

    12

    h-index

  3. arXiv (Cornell University)

    Repository · 14 publications · 309 citations

    11

    h-index

  4. The Electronic Journal of Combinatorics

    11 publications · 361 citations

    11

    h-index

  5. The Annals of Applied Probability

    9 publications · 673 citations

    9

    h-index

1–5