Related papers: Probabilistic Consequences of Some Polynomial Recu…
Recurrence coefficients of semi-classical orthogonal polynomials (orthogonal polynomials related to a weight function $w$ such that $w'/w$ is a rational function) are shown to be solutions of non linear differential equations with respect…
We analyse the statistical properties of genealogical trees in a neutral model of a closed population with sexual reproduction and non-overlapping generations. By reconstructing the genealogy of an individual from the population evolution,…
In this paper, we present a probabilistic extension of the Fubini polynomials and numbers associated with a random variable satisfying some appropriate moment conditions. We obtain the exponential generating function and an integral…
We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who found a phase transition: the number of fragmentations is…
We consider generalized closest return times of a complex polynomial of degree at least two. Most previous studies on this subject have focused on the properties of polynomials with particular return times, especially the Fibonacci numbers.…
We study multivariable Christoffel-Darboux kernels, which may be viewed as reproducing kernels for antisymmetric orthogonal polynomials, and also as correlation functions for products of characteristic polynomials of random Hermitian…
The hierarchical and recursive expressive capability of rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. On the other hand, such hierarchical…
Boltzmann samplers and the recursive method are prominent algorithmic frameworks for the approximate-size and exact-size random generation of large combinatorial structures, such as maps, tilings, RNA sequences or various tree-like…
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…
There has been significant interest in studying the asymptotics of certain generalised moments, called the moments of moments, of characteristic polynomials of random Haar-distributed unitary and symplectic matrices, as the matrix size $N$…
We analyze statistical properties of the complex system with conditions which manifests through specific constraints on the column/row sum of the matrix elements. The presence of additional constraints besides symmetry leads to new…
Weighted recursive trees are built by adding successively vertices with predetermined weights to a tree: each new vertex is attached to a parent chosen at random with probability proportional to its weight. In the case where the total…
Applying a method to reconstruct a phylogenetic tree from random data provides a way to detect whether that method has an inherent bias towards certain tree `shapes'. For maximum parsimony, applied to a sequence of random 2-state data, each…
Taking a combinatorial point of view on cyclotomic polynomials leads to a larger class of polynomials we shall call the inclusion-exclusion polynomials. This gives a more appropriate setting for certain types of questions about the…
This article is motivated by the following satisfiability question: pick uniformly at random an and/or Boolean expression of length n, built on a set of k_n Boolean variables. What is the probability that this expression is satisfiable?…
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…
We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…
Phylogenetic invariants are certain polynomials in the joint probability distribution of a Markov model on a phylogenetic tree. Such polynomials are of theoretical interest in the field of algebraic statistics and they are also of practical…
In 2017-2020 Jordanova and co-authors investigate probabilities for p-outside values and determine them in many particular cases. They show that these probabilities are closely related to the concept for heavy tails. Tukey's boxplots are…
In this paper we start a systematic study of quantum field theory on random trees. Using precise probability estimates on their Galton-Watson branches and a multiscale analysis, we establish the general power counting of averaged Feynman…