Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Sprinkling with random regular graphs

Simple item page
dc.contributor.authorIsaev, Mikhailen
dc.contributor.authorMcKay, Brendan D.en
dc.contributor.authorSouthwell, Angusen
dc.contributor.authorZhukovskii, Maksimen
dc.date.accessioned2025-05-23T03:23:41Z
dc.date.available2025-05-23T03:23:41Z
dc.date.issued2025en
dc.description.abstractWe conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices tends to infinity. We verify this conjecture for the cases when the graphs are sufficiently dense or sparse. We also prove an asymptotic formula for the expected number of spanning regular subgraphs in a random regular graph.en
dc.description.sponsorshipM. I. supported by Australian Research Council grant DP220103074. B. D. M. supported by Australian Research Council grant DP250101611.en
dc.description.statusPeer-revieweden
dc.format.extent20en
dc.identifier.issn1083-6489en
dc.identifier.otherWOS:001415005500001en
dc.identifier.otherORCID:/0000-0002-3553-0496/work/184023107en
dc.identifier.scopus85217547613en
dc.identifier.urihttp://www.scopus.com/inward/record.url?scp=85217547613&partnerID=8YFLogxKen
dc.identifier.urihttps://hdl.handle.net/1885/733751071
dc.language.isoenen
dc.rights© 2025 The Author(s)en
dc.sourceElectronic Journal of Probabilityen
dc.subjectRandom regular graphsen
dc.subjectSandwich conjectureen
dc.subjectSprinklingen
dc.titleSprinkling with random regular graphsen
dc.typeJournal articleen
dspace.entity.typePublicationen
local.bibliographicCitation.lastpage20en
local.bibliographicCitation.startpage1en
local.contributor.affiliationIsaev, Mikhail; University of New South Walesen
local.contributor.affiliationMcKay, Brendan D.; School of Computing, ANU College of Systems and Society, The Australian National Universityen
local.contributor.affiliationSouthwell, Angus; Monash Universityen
local.contributor.affiliationZhukovskii, Maksim; University of Sheffielden
local.identifier.citationvolume30en
local.identifier.doi10.1214/25-EJP1272en
local.identifier.pure75544135-86eb-48d8-8877-0bc75f6c33d0en
local.identifier.urlhttps://www.scopus.com/pages/publications/85217547613en
local.type.statusPublisheden

Downloads

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS