Results 11 to 20 of about 56,293 (261)
Harmonic Bernoulli strings and random permutations
Lietuvos Matematikos Rinkinys, 2004 We examine fairly special b-harmonic Bernoulli strings appearing in n observations. It is shown that their count number can be used to define a random process converging to the Brownian motion as n tends to infinity.
Eugenius Manstavičius
doaj +3 more sources
Random Infinite Permutations and the Cyclic Time Random Walk [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 The random stirring process is a natural random walk on the set of permutations of the vertex set of a graph. The cyclic time random walk is a self interacting random walk on a graph.
Omer Angel
doaj +1 more source
Coherent random permutations with record statistics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 A two-parameter family of random permutations of $[n]$ is introduced, with distribution conditionally uniform given the counts of upper and lower records. The family interpolates between two versions of Ewens' distribution.
Alexander Gnedin
doaj +1 more source
Patterns in Random Permutations [PDF]
Combinatorica, 2020 Every k entries in a permutation can have one of k! different relative orders, called patterns. How many times does each pattern occur in a large random permutation of size n? The distribution of this k!-dimensional vector of pattern densities was studied by Janson, Nakamura, and Zeilberger (2015).
openaire +3 more sources
A new generation tree for permutations, preserving the number of fixed points [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We describe a new uniform generation tree for permutations with the specific property that, for most permutations, all of their descendants in the generation tree have the same number of fixed points.
Philippe Duchon, Romaric Duvignau
doaj +1 more source
Permutation-Based Block Code for Short Packet Communication Systems
Sensors, 2022 This paper presents an approach to the construction of block error-correcting code for data transmission systems with short packets. The need for this is driven by the necessity of information interaction between objects of machine-type communication ...
Emil Faure +5 more
doaj +1 more source
Cycle type of random permutations: a toolkit
Discrete Analysis, 2022 Cycle type of random permutations: a toolkit, Discrete Analysis 2022:9, 36 pp. What does a random permutation look like? This general question has led to a great deal of research, and this article provides a convenient single reference for many results,
Kevin Ford
doaj +1 more source
Quantum routing with fast reversals [PDF]
Quantum, 2021 We present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use of previous methods for rapidly reversing the order of qubits along a path. Given nearest-neighbor interactions on a path of length
Aniruddha Bapat +5 more
doaj +1 more source
A code for square permutations and convex permutominoes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 In this article we consider square permutations, a natural subclass of permutations defined in terms of geometric conditions, that can also be described in terms of pattern avoiding permutations, and convex permutoninoes, a related subclass of ...
Enrica Duchi
doaj +1 more source
Asymptotic behavior of some statistics in Ewens random permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model considered here is Ewens sampling model, which generalizes uniform random permutations.
Valentin Feray
doaj +1 more source