Results 11 to 20 of about 1,308 (81)
Asymptotic distribution of fixed points of pattern-avoiding involutions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 For a variety of pattern-avoiding classes, we describe the limiting distribution for the number of fixed points for involutions chosen uniformly at random from that class.
Samuel Miner +2 more
doaj +1 more source
Expected Number of Distinct Subsequences in Randomly Generated Binary Strings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 When considering binary strings, it's natural to wonder how many distinct subsequences might exist in a given string. Given that there is an existing algorithm which provides a straightforward way to compute the number of distinct subsequences in a fixed
Yonah Biers-Ariel +2 more
doaj +1 more source
Fuss-Catalan numbers in noncommutative probability
Documenta Mathematica, 2010 We prove that if p, r ∈ R, p ≥ 1 and 0 ≤ r ≤ p then the Fuss-Catalan sequence ( mp+r m ) r mp+r is positive definite. We study the family of the corresponding probability measures μ(p, r) on R from the point of view of noncommutative probability.
W. Mlotkowski
semanticscholar +1 more source
A study on the q-Euler numbers and the fermionic q-integrals of the product of several type $q$-Bernstein polynomials on Zp [PDF]
, 2003 In this paper, we investigate some interesting properties of q-Berstein polynomials realted to q-Euler numbers by using the fermionic q-integral on Zp.Comment: 7 ...
Kim, Taekyun
core +6 more sources
Support and density of the limit $m$-ary search trees distribution [PDF]
, 2012 The space requirements of an $m$-ary search tree satisfies a well-known phase transition: when $m\leq 26$, the second order asymptotics is Gaussian. When $m\geq 27$, it is not Gaussian any longer and a limit $W$ of a complex-valued martingale arises.
Chauvin, Brigitte +2 more
core +7 more sources
Pattern Avoidance for Random Permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences and a ...
Harry Crane, Stephen DeSalvo
doaj +1 more source
Limit distribution of degrees in random family trees [PDF]
, 2010 In a one-parameter model for evolution of random trees, which also includes the Barabasi-Albert random tree, almost sure behavior and the limiting distribution of the degree of a vertex in a fixed position are examined. Results about Polya urn models are
Backhausz, Agnes
core +2 more sources
The Largest Component in Critical Random Intersection Graphs
Discussiones Mathematicae Graph Theory, 2018 In this paper, through the coupling and martingale method, we prove the order of the largest component in some critical random intersection graphs is n23$n^{{2 \over 3}}$ with high probability and the width of scaling window around the critical ...
Wang Bin, Wang Longmin, Xiang Kainan
doaj +1 more source
Second Errata to “Processes on Unimodular Random Networks”
Electronic Journal of Probability, 2019 We correct a few more minor errors in our paper, Electron. J. Probab. 12 , Paper 54 (2007), 1454–1508. spanning forests; sofic groups. AMS MSC 2010: Primary 60C05, Secondary 60K99; 05C80. Our first set of errata, Electron. J. Probab.
D. Aldous, R. Lyons
semanticscholar +1 more source
Variance and Covariance of Several Simultaneous Outputs of a Markov Chain [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The partial sum of the states of a Markov chain or more generally a Markov source is asymptotically normally distributed under suitable conditions. One of these conditions is that the variance is unbounded.
Sara Kropf
doaj +1 more source