Degree sequences of random digraphs and bipartite graphs

DOI10.4310/JOC.2016.V7.N1.A2zbMath1331.05198arXiv1302.2446OpenAlexW1561063814MaRDI QIDQ5963385

Fiona Skerman, Brendan D. McKay

Publication date: 19 February 2016

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.2446

zbMATH Keywords

occupancybipartite graphdigraphdirected graphcontiguityrandom graphdegree sequenceallocationcoupon collection

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (6)

Power-law decay of the degree-sequence probabilities of multiple random graphs with application to graph isomorphism ⋮ Asymptotic enumeration of digraphs and bipartite graphs by degree sequence ⋮ On the Method of Typical Bounded Differences ⋮ Modularity of Erdős‐Rényi random graphs ⋮ Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence ⋮ Speed and concentration of the covering time for structured coupon collectors

This page was built for publication: Degree sequences of random digraphs and bipartite graphs