SearcharxivSearch

arXiv subjects

Michal Bassan

Publications and source records attributed to Michal Bassan.

4 recordsLinked to original sources

To see the forest for the trees: On the infinite divisibility of unlabeled forests

Inspired by Stufler's recent probabilistic proof of Otter's asymptotic number of unlabeled trees, we revisit work of Palmer and Schwenk, and study unlabeled forests from a probabilistic point of view. We show that the number of trees in a random forest converges, with all of its moments, to a shifted compound Poisson. We also find the asymptotic proportion of forests that are trees. The key fact is that the number of trees $t_n$ and forests $f_n$ are related by a L\'evy process. As such, the results by Palmer and Schwenk follow by an earlier and far-reaching limit theory by Hawkes and Jenkins. We also show how this limit theory implies results by Schwenk and by Meir and Moon, related to degrees in large random trees. Our arguments apply, more generally, to the enumeration of sub-exponentially weighted integer partitions, or, in fact, any setting where the underlying L\'evy process follows the one big jump principle.

math.PR

Tournament score sequences, Erd\H{o}s-Ginzburg-Ziv numbers, and the L\'evy-Khintchine method

We give a short proof of a recent result of Claesson, Dukes, Frankl\'in and Stef\'ansson, connecting the number $S_n$ of score sequences and the Erd\H{o}s-Ginzburg-Ziv numbers $N_n$ from additive number theory. Our proof utilizes the lattice path representation of score sequences by Erd\H{o}s and Moser, and remarks by Kleitman added to an article of Moser regarding cyclic shifts of such paths. The connection between $S_n$ and $N_n$ is an instance of the L\'evy-Khintchine formula from probability theory. We highlight the utility of such formulas, by giving a short proof of Moser's conjecture that $S_n\sim C4^n/n^{5/2}$, where $C$ is described in terms of $N_n$.

math.CO

Graphical sequences and plane trees

Balister, the second author, Groenland, Johnston and Scott recently showed that there are asymptotically $C4^n/n^{3/4}$ many unordered sequences that occur as degree sequences of graphs. Combining limit theory for infinitely divisible distributions with a new bijective connection between a class of random walk trajectories and a subset counting formula from additive number theory, we describe $C$ in terms of Walkup's number of rooted plane trees. The bijection is related to an instance of the L\'evy-Khintchine formula. Our main result complements a result of Stanley, that ordered graphical sequences are related to quasi-forests.

math.CO

Non-constant ground configurations in the disordered ferromagnet

The disordered ferromagnet is a disordered version of the ferromagnetic Ising model in which the coupling constants are non-negative quenched random. A ground configuration is an infinite-volume configuration whose energy cannot be reduced by finite modifications. It is a long-standing challenge to ascertain whether the disordered ferromagnet on the $\mathbb{Z}^D$ lattice admits non-constant ground configurations. We answer this affirmatively in dimensions $D\ge 4$, when the coupling constants are sampled independently from a sufficiently concentrated distribution. The obtained ground configurations are further shown to be translation-covariant with respect to $\mathbb{Z}^{D-1}$ translations of the disorder. Our result is proved by showing that the finite-volume interface formed by Dobrushin boundary conditions is localized, and converges to an infinite-volume interface. This may be expressed in purely combinatorial terms, as a result on the fluctuations of certain minimal cutsets in the lattice $\mathbb{Z}^D$ endowed with independent edge capacities.

math-ph