Logical limit laws for Mallows random permutations
From MaRDI portal
Cites work
- q-exchangeability via quasi-invariance
- A central limit theorem for descents of a Mallows permutation and its inverse
- A concise introduction to mathematical logic
- A logical approach to asymptotic combinatorics. II: Monadic second-order properties
- A logical limit law for \(231\)-avoiding permutations
- Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
- Arcsine laws for random walks generated from random permutations with applications to genomics
- Counting Small Permutation Patterns
- Cycles in Mallows random permutations
- Elements of finite model theory.
- First order probabilities for Galton-Watson trees
- scientific article; zbMATH DE number 446489 (Why is no real title available?)
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 176205 (Why is no real title available?)
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 1007358 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 238432 (Why is no real title available?)
- Lengths of monotone subsequences in a Mallows permutation
- Limit theorems for longest monotone subsequences in random Mallows permutations
- Logical convergence laws via stochastic approximation and Markov processes
- Logical limit laws for layered permutations and related structures
- Logical limit laws for minor-closed classes of graphs
- Mallows permutations and finite dependence
- Mallows permutations as stable matchings
- Markov Chains
- Markov Chains
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Mathematics and computer science: coping with finiteness
- Mixing times of the biased card shuffling and the asymmetric exclusion process
- NON-NULL RANKING MODELS. I
- Nonconvergence in the theory of random orders
- On adding a list of numbers (and other one-dependent determinantal processes)
- On measures of association and a related problem
- On the cycle structure of Mallows permutations
- Pattern avoidance for random permutations
- Permutations avoiding a pattern of length three under Mallows distributions
- Phase uniqueness for the Mallows measure on permutations
- Probability and random processes.
- Quasirandom permutations are characterized by 4-point densities
- Random graph orders
- Random graphs with bounded maximum degree: asymptotic structure and a logical limit law
- Random orders
- Tangled paths: a random graph model from Mallows permutations
- The first order convergence law fails for random perfect graphs
- The height of Mallows trees
- The length of the longest common subsequence of two independent Mallows permutations
- The length of the longest increasing subsequence of a random Mallows permutation
- The logic of random regular graphs
- The Longest Chain Among Random Points in Euclidean Space
- The mathematics of causal sets
- The probability of avoiding consecutive patterns in the Mallows distribution
- The strange logic of random graphs
- The two-sided infinite extension of the Mallows model for random permutations
- Thermodynamic limit for the Mallows model on S_n
- Transfinite ordinals in recursive number theory
- Two first-order logics of permutations
- Zero-One Laws for Sparse Random Graphs
This page was built for publication: Logical limit laws for Mallows random permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864214)
