Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence

preprint2020arXivOpen access

Abstract

We prove an asymptotic formula for the number of orientations with given out-degree (score) sequence for a graph GG. The graph GG is assumed to have average degrees at least n1/3+εn^{1/3 + \varepsilon} for some ε>0\varepsilon > 0, and to have strong mixing properties, while the maximum imbalance (out-degree minus in-degree) of the orientation should be not too large. Our enumeration results have applications to the study of subdigraph occurrences in random orientations with given imbalance sequence. As one step of our calculation, we obtain new bounds for the maximum likelihood estimators for the Bradley-Terry model of paired comparisons.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.