Related papers: Statistics on bargraphs of inversion sequences of …
The n-point statistics of singularity strength variables for multiplicative branching processes is calculated from an analytic expression of the corresponding multivariate generating function. The key ingredient is a branching generating…
We propose the following model of a random graph on n vertices. Let F be a distribution in R_+^{n(n-1)/2} with a coordinate for every pair i$ with 1 \le i,j \le n. Then G_{F,p} is the distribution on graphs with n vertices obtained by…
We investigate the structure of graphs of twin-width at most $1$, and obtain the following results: - Graphs of twin-width at most $1$ are permutation graphs. In particular they have an intersection model and a linear structure. - There is…
Finding the underlying probability distributions of a set of observed sequences under the constraint that each sequence is generated i.i.d by a distinct distribution is considered. The number of distributions, and hence the number of…
We find the exponential generating function for permutations with all valleys even and all peaks odd, and use it to determine the asymptotics for its coefficients, answering a question posed by Liviu Nicolaescu. The generating function can…
Permutation tableaux are combinatorial objects related with permutations and various statistics on them. They appeared in connection with total positivity in Grassmannians, and stationary probabilities in a PASEP model. In particular they…
In the first part of the paper, we study the inversion statistic of random permutations under the family $(\mathbb{P}_\theta^{(n)})_{\theta \ge 0}$ of Ewens sampling distributions on $S_n$. We obtain a rather simple exact formula for the…
We define a generalization of the Eulerian polynomials and the Eulerian numbers by considering a descent statistic on segmented permutations coming from the study of 2-species exclusion processes and a change of basis in a Hopf algebra. We…
Consider the regular representation of the sum over all permutations weighted by the sum of their descent, inversion, and fixed point multinomials. We compute the spectrum and the multiplicities of its elements of that matrix. Note that…
By means of the generating function method, a linear recurrence relation is explicitly resolved. The solution is expressed in terms of the Stirling numbers of both the first and the second kind. Two remarkable pairs of combinatorial…
Various statistics on wreath products are defined via canonical words, "colored" right to left minima and "colored" descents. It is shown that refined counts with respect to these statistics have nice recurrence formulas of…
There are given characterizations of the exponential distribution by the properties of the independence of linear forms with random coefficients. Related results based on the constancy of regression of one statistic on a linear form are…
We study diffusions, variational principles and associated boundary value problems on directed graphs with natural weightings. Using random walks and exit times, we associate to certain subgraphs (domains) a pair of sequences, each of which…
Given a random text over a finite alphabet, we study the frequencies at which fixed-length words occur as subsequences. As the data size grows, the joint distribution of word counts exhibits a rich asymptotic structure. We investigate all…
We consider the problem of computing the joint distribution of order statistics of stochastically independent random variables in one- and two-group models. While recursive formulas for evaluating the joint cumulative distribution function…
We study the distribution of the statistics 'number of fixed points' and 'number of excedances' in permutations avoiding subsets of patterns of length 3. We solve all the cases of simultaneous avoidance of more than one pattern, giving…
Let $A(n,m)$ denote the Eulerian numbers, which count the number of permutations on $[n]$ with exactly $m$ descents, or, due to the Foata transform, the number of permutations on $[n]$ with exactly $m$ excedances. Friends-and-seats graphs,…
In statistical network analysis, models for binary adjacency matrices satisfying vertex exchangeability are commonly used. However, such models may fail to capture key features of the data-generating process when interactions, rather than…
We study three mixing properties of a graph: large algebraic connectivity, large Cheeger constant (isoperimetric number) and large spectral gap from 1 for the second largest eigenvalue of the transition probability matrix of the random walk…
We study Birkhoff sums as distributions. We obtain regularity results on such distributions for various dynamical systems with hyperbolicity, as hyperbolic linear maps on the torus and piecewise expanding maps on the interval. We also give…