Perfect matchings in random s-uniform hypergraphs

Let E = {X₁, X₂…, X_m} where the X_i ? V for 1 ≤ i ≤ m are distinct. The hypergraph G = (V, E) is said to be s-uniform if |X₁| = s for 1 ≤ i ≤ m. A set of edges M = {X_i : i ? I } is a perfect matching if (i) i ≠ j ? I implies X_i ∩ X_i = 0, and (ii) ∪_i?I X_i = V. In this article we consider the question of whether a random s-uniform hypergraph contains a perfect matching. Let s ≥ 3 be fixed and m/n^4/3 → ∞. We show that an s-uniform hypergraph with m edges chosen uniformly from [74] contains a perfect matching with high probability. This improves an earlier result of Schmidt and Shamir who showed that m/n^3/2 → ∞ suffices. © 1995 John Wiley & Sons, Inc.     

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.     

Some Remarks on the Combinatorics of ISn

\noindent We describe the asymptotic behavior of the cardinalities of the finite symmetric inverse semigroup IS_n and its endomorphism semigroup. This is applied to show that the ratio |IS_n|/|End(IS_n)| is asymptotically 0, answering a question of Schein and Teclezghi. We also apply our results to compute the distributions of elements from IS_n with respect to certain combinatorial properties, and to compute the generating functions for |IS_n| and for the number of nilpotent elements in IS_n.     

Dynamic adjustment: an electoral method for relaxed double proportionality

We describe an electoral system for distributing seats in a parliament. It gives proportionality for the political parties and close to proportionality for constituencies. The system suggested here is a version of the system used in Sweden and other Nordic countries with permanent seats in each constituency and adjustment seats to give proportionality on the national level. In the national election of 2010 the current Swedish system failed to give proportionality between parties. We examine here one possible cure for this unwanted behavior. The main difference compared to the current Swedish system is that the number of adjustment seats is not fixed, but rather dynamically determined to be as low as possible and still insure proportionality between parties.     

Spread‐out percolation in ℝd

Fix d ≥ 2, and let X be either ℤ^d or the points of a Poisson process in ℝ^d of intensity 1. Given parameters r and p, join each pair of points of X within distance r independently with probability p. This is the simplest case of a “spread‐out” percolation model studied by Penrose [Ann Appl Probab 3 (1993) 253–276], who showed that, as r → ∞, the average degree of the corresponding random graph at the percolation threshold tends to 1, i.e., the percolation threshold and the threshold for criticality of the naturally associated branching process approach one another. Here we show that this result follows immediately from of a general result of [3] on inhomogeneous random graphs. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

Ionic-charge dependence of the intermolecular coulombic decay time scale for aqueous ions probed by the core-hole clock

Auger electron spectroscopy combined with theoretical calculations has been applied to investigate the decay of the Ca 2p core hole of aqueous Ca(2+). Beyond the localized two-hole final states on the calcium ion, originating from a normal Auger process, we have further identified the final states delocalized between the calcium ion and its water surroundings and produced by core level intermolecular Coulombic decay (ICD) processes. By applying the core-hole clock method, the time scale of the core level ICD was determined to be 33 ± 1 fs for the 2p core hole of the aqueous Ca(2+). The comparison of this time constant to those associated with the aqueous K(+), Na(+), Mg(2+), and Al(3+) ions reveals differences of 1 and up to 2 orders of magnitude. Such large variations in the characteristic time scales of the core level ICD processes is qualitatively explained by different internal decay mechanisms in different ions as well as by different ion-solvent distances and interactions.     

Novel rapid liquid chromatography tandem masspectrometry method for vemurafenib and metabolites in human plasma,including metabolite concentrations at steady state

A novel, rapid and sensitive liquid chromatography tandem–mass spectrometry method for quantification of vemurafenib in human plasma, that also for the first time allows for metabolite semi‐quantification, was developed and validated to support clinical trials and therapeutic drug monitoring. Vemurafenib was analysed by precipitation with methanol followed by a 1.9 min isocratic liquid chromatography tandem masspectrometry analysis using an Acquity BEH C₁₈ column with methanol and formic acid using isotope labelled internal standards. Analytes were detected in multireaction monitoring mode on a Xevo TQ. Semi‐quantification of vemurafenib metabolites was performed using the same analytical system and sample preparation with gradient elution. The vemurafenib method was successfully validated in the range 0.5–100 μg/mL according to international guidelines. The metabolite method was partially validated owing to the lack of commercially available reference materials. For the first time concentration levels at steady state for melanoma patients treated with vemurafenib is presented. The low abundance of vemurafenib metabolites suggests that they lack clinical significance. Copyright © 2016 John Wiley & Sons, Ltd.     

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.     

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.     

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.