Core Concepts
The author explores the limit of the maximum entropy of a random permutation set, providing insights into its physical meaning and computational complexity.
Abstract
The content delves into the concept of Random Permutation Sets (RPS) and their entropy, proposing a new envelope function to understand uncertainty. It discusses the significance of ordered information in managing uncertainty and introduces a limit form for RPS entropy. The study compares different entropies like Shannon entropy, Deng entropy, and RPS entropy, highlighting their relationships and applications. Additionally, it presents numerical examples to validate the proposed envelope function's efficiency in approximating maximum RPS entropy.
Stats
For a sample space whose cardinality is N, the envelope of Shannon entropy is N.
In a power set with subsets up to cardinality N, the envelope of Deng entropy is 3N - 2N.
The limit form of the envelope of RPS entropy converges to e × (N!)2 as N approaches infinity.