Random permutations of countable sets
The main objective of this paper is a study of random decompositions of random point configurations on \(\mathbb R^ d\) into finite clusters. This is achieved by constructing for each configuration \(Z\) a random permutation of \(Z\) with finite cycles; these cycles then form the cluster decomposition of \(Z\). It is argued that a good candidate for a random permutation of \(Z\) is a Gibbs measure for a certain specification, and conditions are given for the existence and uniqueness of such a Gibbs measure. These conditions are then verified for certain random configurations \(Z\).
- Gaussian random permutation and the boson point process
- Gibbs measures on permutations over one-dimensional discrete point sets
- Finite cycle Gibbs measures on permutations of \(\mathbb Z^d\)
- Regenerative random permutations of integers
- On a model of random cycles
- Spatial random permutations and infinite cycles
- The band structure of a model of spatial random permutation
- An integral characterization of random permutations. A point process approach
- Generating Countable Sets of Permutations
- Random combinatorial objects
This page was built for publication: Random permutations of countable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756299)