Abstract
We investigate the genus g(n,m) of the Erdös-Rényi random graph G(n,m), providing a thorough description of how this relates to the function m=m(n), and finding that there is different behaviour depending on which 'region' m falls into.
Existing results are known for when m is at most n/(2) + O(n^{2/3}) and when m is at least omega (n^{1+1/(j)}) for j in N, and so we focus on intermediate cases.
In particular, we show that g(n,m) = (1+o(1)) m/(2) whp (with high probability) when n << m = n^{1+o(1)}; that g(n,m) = (1+o(1)) mu (lambda) m whp for a given function mu (lambda) when m ~ lambda n for lambda > 1/2; and that g(n,m) = (1+o(1)) (8s^3)/(3n^2) whp when m = n/(2) + s for n^(2/3) << s << n.
We then also show that the genus of fixed graphs can increase dramatically if a small number of random edges are added. Given any connected graph with bounded maximum degree, we find that the addition of epsilon n edges will whp result in a graph with genus Omega (n), even when epsilon is an arbitrarily small constant! We thus call this the `fragile genus' property.
Existing results are known for when m is at most n/(2) + O(n^{2/3}) and when m is at least omega (n^{1+1/(j)}) for j in N, and so we focus on intermediate cases.
In particular, we show that g(n,m) = (1+o(1)) m/(2) whp (with high probability) when n << m = n^{1+o(1)}; that g(n,m) = (1+o(1)) mu (lambda) m whp for a given function mu (lambda) when m ~ lambda n for lambda > 1/2; and that g(n,m) = (1+o(1)) (8s^3)/(3n^2) whp when m = n/(2) + s for n^(2/3) << s << n.
We then also show that the genus of fixed graphs can increase dramatically if a small number of random edges are added. Given any connected graph with bounded maximum degree, we find that the addition of epsilon n edges will whp result in a graph with genus Omega (n), even when epsilon is an arbitrarily small constant! We thus call this the `fragile genus' property.
Originalsprache | englisch |
---|---|
Titel | 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018) |
Herausgeber (Verlag) | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
Seiten | 17:1--17:13 |
Seitenumfang | 17 |
ISBN (Print) | 978-3-95977-078-1 |
DOIs | |
Publikationsstatus | Veröffentlicht - 2018 |
Veranstaltung | 29th International Conference on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms: AofA 2018 - Uppsala University, Uppsala, Schweden Dauer: 25 Juni 2018 → 29 Juni 2018 |
Publikationsreihe
Name | Leibniz International Proceedings in Informatics |
---|---|
Band | 110 |
Konferenz
Konferenz | 29th International Conference on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms |
---|---|
Kurztitel | AofA 2018 |
Land/Gebiet | Schweden |
Ort | Uppsala |
Zeitraum | 25/06/18 → 29/06/18 |
Fields of Expertise
- Information, Communication & Computing