Results 31 to 40 of about 56,293 (261)
Generating a random cyclic permutation [PDF]
BIT, 1988 We prove correct an algorithm that, given \(n>0\), stores in array b[0..n- 1] a random cyclic permutation of the integers in 0..n-1, with each cyclic permutation having equal probability of being stored in b. The algorithm was developed by Sattolo; our contribution is to present a more convincing proof using standard program-proving methods.
David Gries, Jinyun Xue
openaire +2 more sources
The permutation class Av(4213,2143) [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutation consists of the skew sum of a sequence of plane trees, together with an increasing sequence of points above and an increasing sequence of points to its ...
David Bevan
doaj +1 more source
On an alternative sequence comparison statistic of Steele [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 The purpose of this paper is to study a statistic that is used to compare the similarity between two strings, which is first introduced by Michael Steele in 1982.
Ümit Işlak, Alperen Y. Özdemir
doaj +1 more source
Random permutations and Brownian motion [PDF]
Pacific Journal of Mathematics, 1985 Let \(X_{ns}=X_{ns}(\sigma)\) denote the random number of cycles of length s in the permutation \(\sigma\) of a set \(\{\) 1,2,...,n\(\}\) selected randomly according to the uniform distribution and let \(Y_ n(t)=(\sum_{1\leq s\leq n^ t}X_{ns}-t \ln n)/\ln^{1/2} n\), \(0\leq t\leq 1\). The main theorem of the paper states that for each functional f: D\(
DeLaurentis, J. M., Pittel, B. G.
openaire +3 more sources
An Alternative Proof for the Expected Number of Distinct Consecutive Patterns in a Random Permutation [PDF]
Discrete Mathematics & Theoretical Computer ScienceLet $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of distinct ...
Anant Godbole, Hannah Swickheimer
doaj +1 more source
Some remarks about the number of permutations one should consider to perform a permutation test
Statistica, 2007 The main practical drawback of permutation testing is that, except for very small sample sizes, the number of all possible permutations is usually impractically large.
Marco Marozzi
doaj +1 more source
Symmetrized random permutations
, 1999 © 2001 Mathematical Sciences Research Institute. The authors thank the organizers of the workshop on Random Matrix Models and their Applications for their invitations.
Baik, Jinho, Rains, Eric M.
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric supportive care clinical trials often involve multiple clinically important outcomes, complicating trial interpretation. Hierarchical composite endpoints (HCEs) provide a framework to integrate key outcomes according to clinical importance.
Willem H. Collier +11 more
wiley +1 more source
Method for providing background traffic using IP random assigning in cyber range
Electronics Letters, 2021 This letter proposes a method for providing non‐periodic background traffic applicable to cyber ranges. Background traffic is essential to cyber ranges, but it should not be easily distinguished from malicious traffic.
Changwon Lee
doaj +1 more source
Journal of the Royal Statistical Society Series B: Statistical Methodology, 1968 Summary The problem of generating random permutations of the integers 1, 2, …, n arises, for example, when sampling a randomization distribution and when tables of permutations are required for application to experimental design. An algorithm is described which minimizes the amount of randomization necessary to generate a random ...
openaire +2 more sources