Comparing closed quotient in children singers' voices as measured by high-speed-imaging, electroglottography, and inverse filtering

The closed quotient, i.e., the ratio between the closed phase and the period, is commonly studied in voice research. However, the term may refer to measures derived from different methods, such as inverse filtering, electroglottography or high-speed digital imaging (HSDI). This investigation compares closed quotient data measured by these three methods in two boy singers. Each singer produced sustained tones on two different pitches and a glissando. Audio, electroglottographic signal (EGG), and HSDI were recorded simultaneously. The audio signal was inverse filtered by means of the decap program; the closed phase was defined as the flat minimum portion of the flow glottogram. Glottal area was automatically measured in the high speed images by the built-in camera software, and the closed phase was defined as the flat minimum portion of the area-signal. The EGG-signal was analyzed in four different ways using the matlab open quotient interface. The closed quotient data taken from the EGG were found to be considerably higher than those obtained from inverse filtering. Also, substantial differences were found between the closed quotient derived from HSDI and those derived from inverse filtering. The findings illustrate the importance of distinguishing between these quotients.     

Asymptotic bias of some election methods

Consider an election where N seats are distributed among parties with proportions p ₁,…,p _m of the votes. We study, for the common divisor and quota methods, the asymptotic distribution, and in particular the mean, of the seat excess of a party, i.e. the difference between the number of seats given to the party and the (real) number Np _i that yields exact proportionality. Our approach is to keep p ₁,…,p _m fixed and let N→∞, with N random in a suitable way. In particular, we give formulas showing the bias favouring large or small parties for the different election methods.     

Small cliques in random graphs

For d ≥ 1, a d-clique in a graph G is a complete d-vertex subgraph not contained in any larger complete subgraph of G. We investigate the limit distribution of the number of d-cliques in the binomial random graph G(n, p), p = p(n), n→∞.     

On the independence complex of square grids

The enumeration of independent sets of regular graphs is of interest in statistical mechanics, as it corresponds to the solution of hard-particle models. In 2004, it was conjectured by Fendley et al., that for some rectangular grids, with toric boundary conditions, the alternating number of independent sets is extremely simple. More precisely, under a coprimality condition on the sides of the rectangle, the number of independent sets of even and odd cardinality always differ by 1. In physics terms, this means looking at the hard-particle model on these grids at activity −1. This conjecture was recently proved by Jonsson. Here we produce other families of grid graphs, with open or cylindric boundary conditions, for which similar properties hold without any size restriction: the number of independent sets of even and odd cardinality always differ by 0, ±1, or, in the cylindric case, by some power of 2. We show that these results reflect a stronger property of the independence complexes of our graphs. We determine the homotopy type of these complexes using Forman’s discrete Morse theory. We find that these complexes are either contractible, or homotopic to a sphere, or, in the cylindric case, to a wedge of spheres. Finally, we use our enumerative results to determine the spectra of certain transfer matrices describing the hard-particle model on our graphs at activity −1. These results parallel certain conjectures of Fendley et al., proved by Jonsson in the toric case.     

Precise Logarithmic Asymptotics for the Right Tails of Some Limit Random Variables for Random Trees

For certain random variables that arise as limits of functionals of random finite trees, we obtain precise asymptotics for the logarithm of the right-hand tail. Our results are based on the facts (i) that the random variables we study can be represented as functionals of a Brownian excursion and (ii) that a large deviation principle with good rate function is known explicitly for Brownian excursion. Examples include limit distributions of the total path length and of the Wiener index in conditioned Galton-Watson trees (also known as simply generated trees). In the case of Wiener index (where we recover results proved by Svante Janson and Philippe Chassaing by a different method) and for some other examples, a key constant is expressed as the solution to a certain optimization problem, but the constant’s precise value remains unknown. Research supported by NSF grants DMS-0104167 and DMS-0406104 and by The Johns Hopkins University’s Acheson J. Duncan Fund for the Advancement of Research in Statistics.     

The size of random fragmentation trees

We consider the random fragmentation process introduced by Kolmogorov, where a particle having some mass is broken into pieces and the mass is distributed among the pieces at random in such a way that the proportions of the mass shared among different daughters are specified by some given probability distribution (the dislocation law); this is repeated recursively for all pieces. More precisely, we consider a version where the fragmentation stops when the mass of a fragment is below some given threshold, and we study the associated random tree. Dean and Majumdar found a phase transition for this process: the number of fragmentations is asymptotically normal for some dislocation laws but not for others, depending on the position of roots of a certain characteristic equation. This parallels the behavior of discrete analogues with various random trees that have been studied in computer science. We give rigorous proofs of this phase transition, and add further details. The proof uses the contraction method. We extend some previous results for recursive sequences of random variables to families of random variables with a continuous parameter; we believe that this extension has independent interest.     

Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs

General upper tail estimates are given for counting edges in a random induced subhypergraph of a fixed hypergraph ℋ, with an easy proof by estimating the moments. As an application we consider the numbers of arithmetic progressions and Schur triples in random subsets of integers. In the second part of the paper we return to the subgraph counts in random graphs and provide upper tail estimates in the rooted case.     

Convergence of Discrete Snakes

The discrete snake is an arborescent structure built with the help of a conditioned Galton-Watson tree and random i.i.d. increments Y. In this paper, we show that if and , then the discrete snake converges weakly to the Brownian snake (this result was known under the hypothesis ). Moreover, if this condition fails, and the tails of Y are sufficiently regular, we show that the discrete snake converges weakly to an object that we name jumping snake. In both case, the limit of the occupation measure is shown to be the integrated super-Brownian excursion. The proofs rely on the convergence of the codings of discrete snake with the help of two processes, called tours.     

Coupling and Poisson approximation

We give an overview of the Stein-Chen method for establishing Poisson approximations of various random variables. Couplings of certain variables are used to gives explicit bounds for the total variation distance between the distribution of a random variable and a Poisson variable. Some applications are given. In some cases, explicit couplings may be used to obtain good estimates; in other applications it suffices to show the existence of couplings with certain monotonicity properties.Supported by the Göran Gustafsson Foundation for Research in Natural Sciences and Medicine.     

Limit theorems for triangular urn schemes

We study a generalized Pólya urn with balls of two colours and a triangular replacement matrix; the urn is not required to be balanced. We prove limit theorems describing the asymptotic distribution of the composition of the urn after a long time. Several different types of asymptotics appear, depending on the ratio of the diagonal elements in the replacement matrix; the limit laws include normal, stable and Mittag-Leffler distributions as well as some less familiar ones. The results are in some cases similar to, but in other cases strikingly different from, the results for irreducible replacement matrices.