Results 11 to 20 of about 90 (88)
Large expanders in high genus unicellular maps [PDF]
, 2022 We study large uniform random maps with one face whose genus grows linearly with the number of edges. They can be seen as a model of discrete hyperbolic geometry.
Louf, Baptiste
core +1 more source
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
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
An Overlapping theorem with applications [PDF]
, 2007 12 páginas.-- 2000 Mathematics Subject Classification. 60C05.We establish a general and optimal lower bound for the complete sum of the probabilities of k-intersections of n events.
J. Cilleruelo +3 more
core +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
Characterization of stationary probability measures for Variable Length Markov Chains [PDF]
, 2018 By introducing a key combinatorial structure for words produced by a Variable Length Markov Chain (VLMC), the longest internal suffix, precise characterizations of existence and uniqueness of a stationary probability measure for a VLMC chain are given ...
Pouyanne, Nicolas +3 more
core +1 more source
A PROOF OF ANDREWS’ CONJECTURE ON PARTITIONS WITH NO SHORT SEQUENCES
Forum of Mathematics, Sigma, 2019 Our main result establishes Andrews’ conjecture for the asymptotic of the generating function for the number of integer partitions of $n$ without $k$ consecutive parts.
DANIEL M. KANE, ROBERT C. RHOADES
doaj +1 more source
Extended Fibonacci numbers and polynomials with probability applications
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 50, Page 2681-2693, 2004., 2004 The extended Fibonacci sequence of numbers and polynomials is introduced and studied. The generating function, recurrence relations, an expansion in terms of multinomial coefficients, and several properties of the extended Fibonacci numbers and polynomials are obtained.
Demetrios L. Antzoulakos
wiley +1 more source
Forum of Mathematics, Pi, 2016 We prove that proper coloring distinguishes between block factors and finitely dependent stationary processes. A stochastic process is finitely dependent if variables at sufficiently well-separated locations are independent; it is a block factor if it ...
ALEXANDER E. HOLROYD, THOMAS M. LIGGETT
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2007 Let a and b be two positive integers. A culminating path is a path of Z^2 that starts from (0,0), consists of steps (1,a) and (1,-b), stays above the x-axis and ends at the highest ordinate it ever reaches.
Mireille Bousquet-Mélou, Yann Ponty
doaj +1 more source