{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T19:12:07Z","timestamp":1769281927038,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T00:00:00Z","timestamp":1712188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T00:00:00Z","timestamp":1712188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s00493-024-00086-3","type":"journal-article","created":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T12:01:41Z","timestamp":1712232101000},"page":"699-740","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Upper Tail Behavior of the Number of Triangles in Random Graphs with Constant Average Degree"],"prefix":"10.1007","volume":"44","author":[{"given":"Shirshendu","family":"Ganguly","sequence":"first","affiliation":[]},{"given":"Ella","family":"Hiesmayr","sequence":"additional","affiliation":[]},{"given":"Kyeongsik","family":"Nam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,4]]},"reference":[{"issue":"1","key":"86_CR1","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF02761855","volume":"38","author":"N Alon","year":"1981","unstructured":"Alon, N.: On the number of subgraphs of prescribed type of graphs with a given number of edges. Israel J. Math. 38(1), 116\u2013130 (1981)","journal-title":"Israel J. Math."},{"issue":"4","key":"86_CR2","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1002\/rsa.21007","volume":"59","author":"L Andreis","year":"2021","unstructured":"Andreis, L., K\u00f6nig, W., Patterson, R.I.A.: A large-deviations principle for all the cluster sizes of a sparse Erd\u0151s\u2013R\u00e9nyi graph. Random Struct. Algorith. 59(4), 522\u2013553 (2021)","journal-title":"Random Struct. Algorith."},{"key":"86_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00440-022-01180-7","volume":"186","author":"L Andreis","year":"2023","unstructured":"Andreis, L., K\u00f6nig, W., Langhammer, H., Patterson, R.I.A.: A large-deviations principle for all the components in a sparse inhomogeneous random graph. Probab. Theory Relat. Fields 186, 1\u2013100 (2023)","journal-title":"Probab. Theory Relat. Fields"},{"issue":"5","key":"86_CR4","doi-asserted-by":"publisher","first-page":"2404","DOI":"10.1214\/20-AOP1427","volume":"48","author":"F Augeri","year":"2020","unstructured":"Augeri, F.: Nonlinear large deviation bounds with applications to Eigner matrices and sparse Erd\u0151s\u2013R\u00e9nyi graphs. Ann. Probab. 48(5), 2404\u20132448 (2020)","journal-title":"Ann. Probab."},{"issue":"1","key":"86_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1214\/16-AAP1205","volume":"27","author":"BB Bhattacharya","year":"2017","unstructured":"Bhattacharya, B.B., Diaconis, P., Mukherjee, S.: Universal limit theorems in graph coloring problems with connections to extremal combinatorics. Ann. Appl. Probab. 27(1), 337\u2013394 (2017)","journal-title":"Ann. Appl. Probab."},{"key":"86_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.aim.2017.08.003","volume":"319","author":"BB Bhattacharya","year":"2017","unstructured":"Bhattacharya, B.B., Ganguly, S., Lubetzky, E., Zhao, Y.: Upper tails and independence polynomials in random graphs. Adv. Math. 319, 313\u2013347 (2017)","journal-title":"Adv. Math."},{"key":"86_CR7","first-page":"197","volume-title":"Mathematical Proceedings of the Cambridge Philosophical Society","author":"B Bollob\u00e1s","year":"1981","unstructured":"Bollob\u00e1s, B.: Threshold functions for small subgraphs. In: Green, B.J. (ed.) Mathematical Proceedings of the Cambridge Philosophical Society, vol. 90, pp. 197\u2013206. Cambridge University Press, Cambridge (1981)"},{"key":"86_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs, Volume\u00a073 of Cambridge Studies in Advanced Mathematics","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs, Volume\u00a073 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge (2001)"},{"key":"86_CR9","unstructured":"Chakraborty, S., van\u00a0der Hofstad, R., den Hollander, F.: Sparse random graphs with many triangles. arXiv:2112.06526 (2021)"},{"issue":"4","key":"86_CR10","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1002\/rsa.20381","volume":"40","author":"S Chatterjee","year":"2012","unstructured":"Chatterjee, S.: The missing log in large deviations for triangle counts. Random Struct. Algorith. 40(4), 437\u2013451 (2012)","journal-title":"Random Struct. Algorith."},{"issue":"4","key":"86_CR11","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1090\/bull\/1539","volume":"53","author":"S Chatterjee","year":"2016","unstructured":"Chatterjee, S.: An introduction to large deviations for random graphs. Bull. Am. Math. Soc. (N.S.) 53(4), 617\u2013642 (2016)","journal-title":"Bull. Am. Math. Soc. (N.S.)"},{"key":"86_CR12","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.aim.2016.05.017","volume":"299","author":"S Chatterjee","year":"2016","unstructured":"Chatterjee, S., Dembo, A.: Nonlinear large deviations. Adv. Math. 299, 396\u2013450 (2016)","journal-title":"Adv. Math."},{"issue":"7","key":"86_CR13","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1016\/j.ejc.2011.03.014","volume":"32","author":"S Chatterjee","year":"2011","unstructured":"Chatterjee, S., Varadhan, S.R.S.: The large deviation principle for the Erd\u0151s\u2013R\u00e9nyi random graph. Eur. J. Comb. 32(7), 1000\u20131017 (2011)","journal-title":"Eur. J. Comb."},{"key":"86_CR14","unstructured":"Chowdhury, M.B.R.: Universality in prelimiting tail behavior for regular subgraph counts in the Poisson regime. arXiv:2304.01162 (2023)"},{"key":"86_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2020.107289","volume":"373","author":"N Cook","year":"2020","unstructured":"Cook, N., Dembo, A.: Large deviations of subgraph counts for sparse Erd\u0151s\u2013R\u00e9nyi graphs. Adv. Math. 373, 107289 (2020)","journal-title":"Adv. Math."},{"issue":"4","key":"86_CR16","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1002\/rsa.20440","volume":"41","author":"B Demarco","year":"2012","unstructured":"Demarco, B., Kahn, J.: Tight upper tail bounds for cliques. Random Struct. Algorith. 41(4), 469\u2013487 (2012)","journal-title":"Random Struct. Algorith."},{"issue":"4","key":"86_CR17","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1002\/rsa.20382","volume":"40","author":"B DeMarco","year":"2012","unstructured":"DeMarco, B., Kahn, J.: Upper tails for triangles. Random Struct. Algorith. 40(4), 452\u2013459 (2012)","journal-title":"Random Struct. Algorith."},{"issue":"10","key":"86_CR18","doi-asserted-by":"publisher","first-page":"2089","DOI":"10.1215\/00127094-2021-0067","volume":"171","author":"M Harel","year":"2022","unstructured":"Harel, M., Mousset, F., Samotij, W.: Upper tails via high moments and entropic stability. Duke Math. J. 171(10), 2089\u20132192 (2022)","journal-title":"Duke Math. J."},{"issue":"3","key":"86_CR19","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1002\/rsa.10031","volume":"20","author":"S Janson","year":"2002","unstructured":"Janson, S., Ruci\u0144ski, A.: The infamous upper tail. Random Struct. Algorith. 20(3), 317\u2013342 (2002)","journal-title":"Random Struct. Algorith."},{"issue":"4","key":"86_CR20","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s00493-004-0038-3","volume":"24","author":"S Janson","year":"2004","unstructured":"Janson, S., Ruci\u0144ski, A.: The deletion method for upper tail estimates. Combinatorica 24(4), 615\u2013640 (2004)","journal-title":"Combinatorica"},{"key":"86_CR21","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Rucinski, A.: Random Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York (2000)"},{"key":"86_CR22","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF02771528","volume":"142","author":"S Janson","year":"2004","unstructured":"Janson, S., Oleszkiewicz, K., Ruci\u0144ski, A.: Upper tails for subgraph counts in random graphs. Israel J. Math. 142, 61\u201392 (2004)","journal-title":"Israel J. Math."},{"issue":"5","key":"86_CR23","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1016\/j.aim.2008.03.023","volume":"218","author":"P Keevash","year":"2008","unstructured":"Keevash, P.: Shadows and intersections: stability and new proofs. Adv. Math. 218(5), 1685\u20131703 (2008)","journal-title":"Adv. Math."},{"issue":"2","key":"86_CR24","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/rsa.10113","volume":"24","author":"JH Kim","year":"2004","unstructured":"Kim, J.H., Vu, V.H.: Divide and conquer martingales and the number of triangles in a random graph. Random Struct. Algorith. 24(2), 166\u2013174 (2004)","journal-title":"Random Struct. Algorith."},{"issue":"3","key":"86_CR25","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1002\/rsa.20658","volume":"50","author":"E Lubetzky","year":"2017","unstructured":"Lubetzky, E., Zhao, Y.: On the variational problem for upper tails in sparse random graphs. Random Struct. Algorith. 50(3), 420\u2013436 (2017)","journal-title":"Random Struct. Algorith."},{"key":"86_CR26","volume-title":"Elementary Methods in Number Theory","author":"MB Nathanson","year":"2008","unstructured":"Nathanson, M.B.: Elementary Methods in Number Theory, vol. 195. Springer, New York (2008)"},{"issue":"1","key":"86_CR27","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1017\/S0963548399004113","volume":"9","author":"D Reimer","year":"2000","unstructured":"Reimer, D.: Proof of the van den Berg-Kesten conjecture. Comb. Probab. Comput. 9(1), 27\u201332 (2000)","journal-title":"Comb. Probab. Comput."},{"issue":"3","key":"86_CR28","first-page":"317","volume":"20","author":"M \u0160ileikis","year":"2012","unstructured":"\u0160ileikis, M.: On the upper tail of counts of strictly balanced subgraphs. Electr. J. Comb. 20(3), 317\u2013342 (2012)","journal-title":"Electr. J. Comb."},{"issue":"3","key":"86_CR29","doi-asserted-by":"publisher","first-page":"556","DOI":"10.2307\/3213860","volume":"22","author":"J Van Den Berg","year":"1985","unstructured":"Van Den Berg, J., Kesten, H.: Inequalities with applications to percolation and reliability. J. Appl. Probab. 22(3), 556\u2013569 (1985)","journal-title":"J. Appl. Probab."},{"issue":"1","key":"86_CR30","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1017\/S0963548300004545","volume":"10","author":"HV Van","year":"2001","unstructured":"Van, H.V.: A large deviation result on the number of small subgraphs of a random graph. Comb. Probab. Comput. 10(1), 79\u201394 (2001)","journal-title":"Comb. Probab. Comput."},{"key":"86_CR31","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s11856-017-1546-3","volume":"221","author":"L Warnke","year":"2017","unstructured":"Warnke, L.: Upper tails for arithmetic progressions in random subsets. Israel J. Math. 221, 317\u2013365 (2017)","journal-title":"Israel J. Math."},{"key":"86_CR32","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.jctb.2019.05.003","volume":"140","author":"L Warnke","year":"2020","unstructured":"Warnke, L.: On the missing log in upper tail estimates. J. Comb. Theory Ser. B 140, 98\u2013146 (2020)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00086-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-024-00086-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00086-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T17:05:36Z","timestamp":1721840736000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-024-00086-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,4]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["86"],"URL":"https:\/\/doi.org\/10.1007\/s00493-024-00086-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,4]]},"assertion":[{"value":"11 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}