English
Related papers

Related papers: On the Limiting Distribution for the Longest Alter…

200 papers

We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…

Probability · Mathematics 2007-05-23 Anna Rudas , Balint Toth , Benedek Valko

In their study of cyclic pattern containment, Domagalski et al. conjecture differential equations for the generating functions of circular permutations avoiding consecutive patterns of length 3. In this note, we prove and significantly…

Combinatorics · Mathematics 2021-07-13 Sergi Elizalde , Bruce Sagan

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…

Combinatorics · Mathematics 2023-06-22 Harry Crane , Stephen DeSalvo

In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group of degree n, the word length in terms of S of every permutation is bounded above by a polynomial of n. We prove this conjecture for…

Group Theory · Mathematics 2012-05-09 John Bamberg , Nick Gill , Thomas Hayes , Harald Helfgott , Ákos Seress , Pablo Spiga

We study the longest increasing subsequence problem for random permutations avoiding the pattern $312$ and another pattern $\tau$ under the uniform probability distribution. We determine the exact and asymptotic formulas for the average…

Combinatorics · Mathematics 2020-01-28 Toufik Mansour , Gökhan Yıldırım

Computing the similarity between two probability distributions is a recurring theme across control. We introduce a unified family of distances between the probability distributions of two random variables that is based on the discrepancy…

Systems and Control · Electrical Eng. & Systems 2025-10-03 Alexandros E. Tzikas , Arec Jamgochian , Nazim Kemal Ure , Mykel J. Kochenderfer , Stephen P. Boyd

We establish a comprehensive probability theory for coherent transport of random waves through arbitrary linear media. The transmissivity distribution for random coherent waves is a fundamental B-spline with knots at the transmission…

Optics · Physics 2025-11-07 Yunrui Wang , Cheng Guo

Another new family of continuous probability distribution is proposed by using Generalized Marshal-Olkin distribution as the base line distribution in the Kumaraswamy-G distribution. This family includes (Cordeiro and de Castro, 2011) and…

Statistics Theory · Mathematics 2016-09-16 Laba Handique , Subrata Chakraborty

Under the Riemann Hypothesis, we connect the distribution of $k$-free numbers with the derivative of the Riemann zeta-function at nontrivial zeros of $\zeta(s)$. Moreover, with additional assumptions, we prove the existence of a limiting…

Number Theory · Mathematics 2016-06-01 Xianchang Meng

Let K_n denote the smaller mode of the nth row of Stirling numbers of the second kind S(n, k). Using a probablistic argument, it is shown that for all n>=2, [exp(w(n))]-2<=K_n<=[exp(w(n))]+1, where [x] denotes the integer part of x, and…

Combinatorics · Mathematics 2009-09-12 Yaming Yu

We study the asymptotic behavior of the long cycles of a random permutation of $n$ objects with respect to multiplicative measures with polynomial growing cycle weights. We show that the longest cycle and the length differences between the…

Probability · Mathematics 2020-02-04 Dirk Zeindler

Let f_1,f_2,..., be functions chosen independently and uniformly from the set of all functions from a set of cardinality n into itself. Let g_t be the composition of the first t functions, and let T be the smallest t for which g_t is…

Combinatorics · Mathematics 2007-05-23 W. M. Y. Goh , P. Hitczenko , E. Schmutz

The concept of pattern avoidance respectively containment in permutations can be extended to permutations on multisets in a straightforward way. In this note we present a direct proof of the already known fact that the well-known…

Combinatorics · Mathematics 2013-06-24 Marie-Louise Bruner

We consider the distributions of the lengths of the longest monotone and alternating subsequences in classes of permutations of size $n$ that avoid a specific pattern or set of patterns, with respect to the uniform distribution on each such…

Combinatorics · Mathematics 2017-10-12 Neal Madras , Gökhan Yıldırım

We consider a random permutation drawn from the set of 132-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after scaling by $n^{\lambda(\sigma)/2}$ where…

Probability · Mathematics 2016-05-25 Svante Janson

We determine the scaling limit for permutations conditioned to have longest decreasing subsequence of length at most $d$. These permutations are also said to avoid the pattern $(d+1)d \cdots 2 1$ and they can be written as a union of $d$…

Probability · Mathematics 2023-01-09 Christopher Hoffman , Douglas Rizzolo , Erik Slivken

In this paper, we propose a new distribution with unitary support which can be characterized as a ratio of the type $W=X_1/(X_1+X_2)$, where $(X_1, X_2)^\top$ follows a bivariate extreme distribution with Fr\'echet margins, that is, $X_1$…

Methodology · Statistics 2025-01-03 Roberto Vila , Felipe Quintino

Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…

Combinatorics · Mathematics 2017-09-26 Samantha Dahlberg

The notion of $r$-crossing and $r$-nesting of a complete matching was introduced and a symmetry property was proved by Chen et al. [Trans. Amer. Math. Soc. 359 (2007) 1555-1575]. We consider random matchings of large size and study their…

Probability · Mathematics 2015-03-19 Jinho Baik , Robert Jenkins

In this work, we study the problem of approximating the distance to subsequence-freeness in the sample-based distribution-free model. For a given subsequence (word) $w = w_1 \dots w_k$, a sequence (text) $T = t_1 \dots t_n$ is said to…

Data Structures and Algorithms · Computer Science 2023-05-03 Omer Cohen Sidon , Dana Ron