{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T21:51:42Z","timestamp":1791323502270,"version":"4.3.1"},"reference-count":79,"publisher":"Institute of Mathematical Statistics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann. Statist."],"published-print":{"date-parts":[[2026,8,1]]},"abstract":"Exchangeable random graphs, which include some of the most widely studied network models, have emerged as the mainstay of statistical network analysis in recent years. Graphons, which are the central objects in graph limit theory, provide a natural way to sample exchangeable random graphs. It is well known that network moments (motif\/subgraph counts) identify a graphon (up to an isomorphism); hence, understanding the sampling distribution of subgraph counts in random graphs sampled from a graphon is pivotal for nonparametric network inference. Although there are a few results regarding the asymptotic normality of subgraph counts in graphon models, for many commonly appearing graphons this distribution is degenerate. This degeneracy phenomenon was overlooked until very recently and its consequences in network inference have remained unexplored. Toward this, we obtain the following results: We derive the joint asymptotic distribution of any finite collection of network moments in random graphs sampled from a graphon, which includes both the nondegenerate case (where the distribution is Gaussian) as well as the degenerate case (where the distribution has both Gaussian or non-Gaussian components). This provides the higher-order fluctuation theory for subgraph counts in the graphon model. Furthermore, we develop a novel multiplier bootstrap for graphons that consistently approximates the limiting distribution of the network moments (both in the Gaussian and non-Gaussian regimes). Using this and a procedure for testing degeneracy, we construct joint confidence sets for any finite collection of motif densities. This provides a general framework for statistical inference based on network moments in the graphon model. Examples and simulations are provided to validate the general theory. To illustrate the broad scope of our results, we also consider the problem of detecting global structure (i.e., testing whether the graphon is a constant function) based on small subgraphs. We propose a consistent test for this problem, invoking celebrated results on quasirandom graphs, and derive its limiting distribution both under the null and the alternative.<\/jats:p>","DOI":"10.1214\/26-aos2644","type":"journal-article","created":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T08:21:21Z","timestamp":1787041281000},"page":"2136-2163","source":"Crossref","is-referenced-by-count":1,"title":["Higher-order graphon theory: Fluctuations, degeneracies and inference"],"prefix":"10.1214","volume":"54","author":[{"given":"Anirban","family":"Chatterjee","sequence":"first","affiliation":[{"name":"Department of Statistics, University of Chicago"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Soham","family":"Dan","sequence":"additional","affiliation":[{"name":"Scale AI, San Francisco"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bhaswar B.","family":"Bhattacharya","sequence":"additional","affiliation":[{"name":"Department of Statistics and Data Science, University of Pennsylvania"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"108","reference":[{"key":"15","doi-asserted-by":"publisher","unstructured":"Borgs, C.<\/small>, Chayes, J. T.<\/small>, Lov\u00e1sz, L.<\/small>, S\u00f3s, V. T.<\/small> and Vesztergombi, K.<\/small> (2008). Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing. Adv. Math.<\/i> 219<\/b> 1801\u20131851.","DOI":"10.1016\/j.aim.2008.07.008"},{"key":"16","doi-asserted-by":"publisher","unstructured":"Borgs, C.<\/small>, Chayes, J. T.<\/small>, Lov\u00e1sz, L.<\/small>, S\u00f3s, V. T.<\/small> and Vesztergombi, K.<\/small> (2012). Convergent sequences of dense graphs II. Multiway cuts and statistical physics. Ann. of Math<\/i>. (2) 176<\/b> 151\u2013219.","DOI":"10.4007\/annals.2012.176.1.2"},{"key":"61","doi-asserted-by":"crossref","unstructured":"Milo, R.<\/small>, Shen-Orr, S.<\/small>, Itzkovitz, S.<\/small>, Kashtan, N.<\/small>, Chklovskii, D.<\/small> and Alon, U.<\/small> (2002). Network motifs: Simple building blocks of complex networks. Science<\/i> 298<\/b> 824\u2013827.","DOI":"10.1126\/science.298.5594.824"},{"key":"25","unstructured":"Diaconis, P.<\/small> and Janson, S.<\/small> (2008). Graph limits and exchangeable random graphs. Rend. Mat. Appl<\/i>. (7) 28<\/b> 33\u201361."},{"key":"55","doi-asserted-by":"publisher","unstructured":"Lov\u00e1sz, L.<\/small> and Szegedy, B.<\/small> (2006). Limits of dense graph sequences. J. Combin. Theory Ser. B<\/i> 96<\/b> 933\u2013957.","DOI":"10.1016\/j.jctb.2006.05.002"},{"key":"9","doi-asserted-by":"publisher","unstructured":"Bhattacharyya, S.<\/small> and Bickel, P. J.<\/small> (2015). Subsampling bootstrap of count features of networks. Ann. Statist.<\/i> 43<\/b> 2384\u20132411.","DOI":"10.1214\/15-AOS1338"},{"key":"28","doi-asserted-by":"publisher","unstructured":"F\u00c9RAY, V.<\/small>, M\u00c9LIOT, P.-L.<\/small> and NIKEGHBALI, A.<\/small> (2020). Graphons, permutons and the Thoma simplex: Three mod-Gaussian moduli spaces. Proc. Lond. Math. Soc<\/i>. (3) 121<\/b> 876\u2013926.","DOI":"10.1112\/plms.12344"},{"key":"14","doi-asserted-by":"publisher","unstructured":"Borgs, C.<\/small>, Chayes, J.<\/small> and Lov\u00e1sz, L.<\/small> (2010). Moments of two-variable functions and the uniqueness of graph limits. Geom. Funct. Anal.<\/i> 19<\/b> 1597\u20131619.","DOI":"10.1007\/s00039-010-0044-0"},{"key":"35","doi-asserted-by":"publisher","unstructured":"Hoff, P. D.<\/small>, Raftery, A. E.<\/small> and Handcock, M. S.<\/small> (2002). Latent space approaches to social network analysis. J. Amer. Statist. Assoc.<\/i> 97<\/b> 1090\u20131098.","DOI":"10.1198\/016214502388618906"},{"key":"2","doi-asserted-by":"crossref","unstructured":"Alon, U.<\/small> (2007). Network motifs: Theory and experimental approaches. Nat. Rev. Genet.<\/i> 8<\/b> 450\u2013461.","DOI":"10.1038\/nrg2102"},{"key":"22","unstructured":"CRANE, H.<\/small> (2018). Probabilistic Foundations of Statistical Network Analysis<\/i>. Monographs on Statistics and Applied Probability<\/i> 157<\/b>. CRC Press, Boca Raton, FL."},{"key":"37","doi-asserted-by":"crossref","unstructured":"HOLLAND, P. W.<\/small> and LEINHARDT, S.<\/small> (1971). Transitivity in structural models of small groups. Comp. Group Stud.<\/i> 2<\/b> 107\u2013124.","DOI":"10.1177\/104649647100200201"},{"key":"40","doi-asserted-by":"publisher","unstructured":"HUNTER, D. R.<\/small>, HANDCOCK, M. S.<\/small>, BUTTS, C. T.<\/small>, GOODREAU, S. M.<\/small> and MORRIS, M.<\/small> (2008). ergm: A package to fit, simulate and diagnose exponential-family models for networks. J. Stat. Softw.<\/i> 24<\/b> nihpa54860.","DOI":"10.18637\/jss.v024.i03"},{"key":"69","doi-asserted-by":"crossref","unstructured":"PR\u017dULJ, N.<\/small> (2007). Biological network comparison using graphlet degree distribution. Bioinformatics<\/i> 23<\/b> e177\u2013e183.","DOI":"10.1093\/bioinformatics\/btl301"},{"key":"77","doi-asserted-by":"publisher","unstructured":"WEGNER, A. E.<\/small>, OSPINA-FORERO, L.<\/small>, GAUNT, R. E.<\/small>, DEANE, C. M.<\/small> and REINERT, G.<\/small> (2018). Identifying networks with common organizational principles. J. Complex Netw.<\/i> 6<\/b> 887\u2013913.","DOI":"10.1093\/comnet\/cny003"},{"key":"20","doi-asserted-by":"publisher","unstructured":"CHATTERJEE, S.<\/small> and DIACONIS, P.<\/small> (2013). Estimating and understanding exponential random graph models. Ann. Statist.<\/i> 41<\/b> 2428\u20132461.","DOI":"10.1214\/13-AOS1155"},{"key":"26","doi-asserted-by":"publisher","unstructured":"EDEN, T.<\/small>, LEVI, A.<\/small>, RON, D.<\/small> and SESHADHRI, C.<\/small> (2017). Approximately counting triangles in sublinear time. SIAM J. Comput.<\/i> 46<\/b> 1603\u20131646.","DOI":"10.1137\/15M1054389"},{"key":"47","unstructured":"KLUSOWSKI, J. M.<\/small> and WU, Y.<\/small> (2018). Counting motifs with graph sampling. In Conference on Learning Theory<\/i> 1966\u20132011."},{"key":"3","unstructured":"ATHREYA, A.<\/small>, FISHKIND, D. E.<\/small>, TANG, M.<\/small>, PRIEBE, C. E.<\/small>, PARK, Y.<\/small>, VOGELSTEIN, J. T.<\/small>, LEVIN, K.<\/small>, LYZINSKI, V.<\/small>, QIN, Y.<\/small> et al. (2017). Statistical inference on random dot product graphs: A survey. J. Mach. Learn. Res.<\/i> 18<\/b> Paper No. 226, 92 pp."},{"key":"27","doi-asserted-by":"publisher","unstructured":"FANG, X.<\/small> and R\u00d6LLIN, A.<\/small> (2015). Rates of convergence for multivariate normal approximation with applications to dense graphs and doubly indexed permutation statistics. Bernoulli<\/i> 21<\/b> 2157\u20132189.","DOI":"10.3150\/14-BEJ639"},{"key":"36","doi-asserted-by":"publisher","unstructured":"Holland, P. W.<\/small>, Laskey, K. B.<\/small> and Leinhardt, S.<\/small> (1983). Stochastic blockmodels: First steps. Soc. Netw.<\/i> 5<\/b> 109\u2013137.","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"43","doi-asserted-by":"publisher","unstructured":"Janson, S.<\/small> (1997). Gaussian Hilbert Spaces<\/i>. Cambridge Tracts in Mathematics<\/i> 129<\/b>. Cambridge Univ. Press, Cambridge.","DOI":"10.1017\/CBO9780511526169"},{"key":"68","doi-asserted-by":"publisher","unstructured":"Penrose, M.<\/small> (2003). Random Geometric Graphs<\/i>. Oxford Studies in Probability<\/i> 5<\/b>. Oxford Univ. Press, Oxford.","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"5","doi-asserted-by":"publisher","unstructured":"Barbour, A. D.<\/small>, Karo\u0144ski, M.<\/small> and Ruci\u0144ski, A.<\/small> (1989). A central limit theorem for decomposable random variables with applications to random graphs. J. Combin. Theory Ser. B<\/i> 47<\/b> 125\u2013145.","DOI":"10.1016\/0095-8956(89)90014-2"},{"key":"71","doi-asserted-by":"publisher","unstructured":"Ruci\u0144ski, A.<\/small> (1988). When are small subgraphs of a random graph normally distributed? Probab. Theory Related Fields<\/i> 78<\/b> 1\u201310.","DOI":"10.1007\/BF00718031"},{"key":"1","doi-asserted-by":"publisher","unstructured":"Aldous, D. J.<\/small> (1981). Representations for partially exchangeable arrays of random variables. J. Multivariate Anal.<\/i> 11<\/b> 581\u2013598.","DOI":"10.1016\/0047-259X(81)90099-3"},{"key":"10","doi-asserted-by":"crossref","unstructured":"Bickel, P. J.<\/small> and Chen, A.<\/small> (2009). A nonparametric view of network models and Newman\u2013Girvan and other modularities. Proc. Natl. Acad. Sci. USA<\/i> 106<\/b> 21068\u201321073.","DOI":"10.1073\/pnas.0907096106"},{"key":"11","doi-asserted-by":"publisher","unstructured":"Bickel, P. J.<\/small>, Chen, A.<\/small> and Levina, E.<\/small> (2011). The method of moments and degree distributions for network models. Ann. Statist.<\/i> 39<\/b> 2280\u20132301.","DOI":"10.1214\/11-AOS904"},{"key":"31","doi-asserted-by":"publisher","unstructured":"Gao, C.<\/small>, Lu, Y.<\/small> and Zhou, H. H.<\/small> (2015). Rate-optimal graphon estimation. Ann. Statist.<\/i> 43<\/b> 2624\u20132652.","DOI":"10.1214\/15-AOS1354"},{"key":"38","unstructured":"Hoover, D. N.<\/small> (1982). Row-column exchangeability and a generalized model for probability. In Exchangeability in Probability and Statistics<\/i> (Rome<\/i>, 1981) 281\u2013291. North-Holland, Amsterdam."},{"key":"49","doi-asserted-by":"publisher","unstructured":"Lei, J.<\/small> (2016). A goodness-of-fit test for stochastic block models. Ann. Statist.<\/i> 44<\/b> 401\u2013424.","DOI":"10.1214\/15-AOS1370"},{"key":"54","doi-asserted-by":"publisher","unstructured":"Lov\u00e1sz, L.<\/small> (2012). Large Networks and Graph Limits<\/i>. American Mathematical Society Colloquium Publications<\/i> 60<\/b>. Amer. Math. Soc., Providence, RI.","DOI":"10.1090\/coll\/060"},{"key":"74","doi-asserted-by":"publisher","unstructured":"Tang, M.<\/small>, Athreya, A.<\/small>, Sussman, D. L.<\/small>, Lyzinski, V.<\/small> and Priebe, C. E.<\/small> (2017). A nonparametric two-sample hypothesis testing problem for random graphs. Bernoulli<\/i> 23<\/b> 1599\u20131630.","DOI":"10.3150\/15-BEJ789"},{"key":"13","doi-asserted-by":"publisher","unstructured":"Bollob\u00e1s, B.<\/small>, Janson, S.<\/small> and Riordan, O.<\/small> (2007). The phase transition in inhomogeneous random graphs. Random Structures Algorithms<\/i> 31<\/b> 3\u2013122.","DOI":"10.1002\/rsa.20168"},{"key":"75","unstructured":"WASSERMAN, S.<\/small> and FAUST, K.<\/small> (1994). Social Network Analysis<\/i>: Methods and Applications<\/i>. Cambridge Univ. Press, Cambridge."},{"key":"64","doi-asserted-by":"publisher","unstructured":"MUKHERJEE, S.<\/small> and XU, Y.<\/small> (2023). Statistics of the two star ERGM. Bernoulli<\/i> 29<\/b> 24\u201351.","DOI":"10.3150\/21-bej1448"},{"key":"76","doi-asserted-by":"crossref","unstructured":"WATTS, D. J.<\/small> and STROGATZ, S. H.<\/small> (1998). Collective dynamics of \u2018small-world\u2019 networks. Nature<\/i> 393<\/b> 440\u2013442.","DOI":"10.1038\/30918"},{"key":"78","doi-asserted-by":"publisher","unstructured":"ZHANG, Y.<\/small> and XIA, D.<\/small> (2022). Edgeworth expansions for network moments. Ann. Statist.<\/i> 50<\/b> 726\u2013753.","DOI":"10.1214\/21-aos2125"},{"key":"57","doi-asserted-by":"crossref","unstructured":"LUNDE, R.<\/small> and SARKAR, P.<\/small> (2023). Subsampling Sparse Graphons under Minimal Assumptions. Biometrika<\/i> 110<\/b> 15\u201332.","DOI":"10.1093\/biomet\/asac032"},{"key":"70","doi-asserted-by":"publisher","unstructured":"RUBIN-DELANCHY, P.<\/small>, CAPE, J.<\/small>, TANG, M.<\/small> and PRIEBE, C. E.<\/small> (2022). A statistical interpretation of spectral embedding: The generalised random dot product graph. J. R. Stat. Soc. Ser. B. Stat. Methodol.<\/i> 84<\/b> 1446\u20131473.","DOI":"10.1111\/rssb.12509"},{"key":"50","doi-asserted-by":"publisher","unstructured":"LEI, J.<\/small> (2021). Network representation using graph root distributions. Ann. Statist.<\/i> 49<\/b> 745\u2013768.","DOI":"10.1214\/20-aos1976"},{"key":"7","doi-asserted-by":"publisher","unstructured":"BHATTACHARYA, B. B.<\/small>, CHATTERJEE, A.<\/small> and JANSON, S.<\/small> (2023). Fluctuations of subgraph counts in graphon based random graphs. Combin. Probab. Comput.<\/i> 32<\/b> 428\u2013464.","DOI":"10.1017\/s0963548322000335"},{"key":"34","doi-asserted-by":"publisher","unstructured":"HLADK\u00dd, J.<\/small>, PELEKIS, C.<\/small> and \u0160ILEIKIS, M.<\/small> (2021). A limit theorem for small cliques in inhomogeneous random graphs. J. Graph Theory<\/i> 97<\/b> 578\u2013599.","DOI":"10.1002\/jgt.22673"},{"key":"63","doi-asserted-by":"publisher","unstructured":"MUKHERJEE, S.<\/small> (2020). Degeneracy in sparse ERGMs with functions of degrees as sufficient statistics. Bernoulli<\/i> 26<\/b> 1016\u20131043.","DOI":"10.3150\/19-BEJ1135"},{"key":"33","doi-asserted-by":"publisher","unstructured":"GREEN, A.<\/small> and SHALIZI, C. R.<\/small> (2022). Bootstrapping exchangeable random graphs. Electron. J. Stat.<\/i> 16<\/b> 1058\u20131095.","DOI":"10.1214\/21-ejs1896"},{"key":"51","doi-asserted-by":"publisher","unstructured":"LEVIN, K.<\/small> and LEVINA, E.<\/small> (2025). Bootstrapping networks with latent space structure. Electron. J. Stat.<\/i> 19<\/b> 745\u2013791.","DOI":"10.1214\/25-ejs2347"},{"key":"60","doi-asserted-by":"publisher","unstructured":"MAUGIS, P. A.<\/small> (2024). Central limit theorems for local network statistics. Biometrika<\/i> 111<\/b> 743\u2013754.","DOI":"10.1093\/biomet\/asad080"},{"key":"4","doi-asserted-by":"publisher","unstructured":"AUSTERN, M.<\/small> and ORBANZ, P.<\/small> (2022). Limit theorems for distributions invariant under groups of transformations. Ann. Statist.<\/i> 50<\/b> 1960\u20131991.","DOI":"10.1214\/21-aos2165"},{"key":"6","doi-asserted-by":"publisher","unstructured":"BHATTACHARYA, A.<\/small>, BISHNU, A.<\/small>, GHOSH, A.<\/small> and MISHRA, G.<\/small> (2021). On triangle estimation using tripartite independent set queries. Theory Comput. Syst.<\/i> 65<\/b> 1165\u20131192.","DOI":"10.1007\/s00224-021-10043-y"},{"key":"12","doi-asserted-by":"crossref","unstructured":"BOGUN\u00c1, M.<\/small> and PASTOR-SATORRAS, R.<\/small> (2003). Class of correlated random networks with hidden variables. Phys. Rev. E<\/i> 68<\/b> 036112.","DOI":"10.1103\/PhysRevE.68.036112"},{"key":"17","unstructured":"BRAVO-HERMSDORFF, G.<\/small>, GUNDERSON, L. M.<\/small>, MAUGIS, P.-A.<\/small> and PRIEBE, C. E.<\/small> (2023). Quantifying network similarity using graph cumulants. J. Mach. Learn. Res.<\/i> 24<\/b> Paper No. [187], 27 pp."},{"key":"18","doi-asserted-by":"crossref","unstructured":"CHATTERJEE, A.<\/small>, DAN, S.<\/small> and BHATTACHARYA, B. B.<\/small> (2026). Supplement to \u201chigher-order graphon theory: Fluctuations, degeneracies and inference.\u201d https:\/\/doi.org\/10.1214\/26-AOS2644SUPP<\/a>","DOI":"10.1214\/26-AOS2644SUPP"},{"key":"19","unstructured":"CHATTERJEE, S.<\/small>, CHATTERJEE, A.<\/small>, CHAKRABORTY, A.<\/small> and BHATTACHARYA, B. B.<\/small> (2025). Asymptotic normality of subgraph counts in sparse inhomogeneous random graphs. Preprint. Available at arXiv:2512.12937<\/a>."},{"key":"21","doi-asserted-by":"publisher","unstructured":"CHUNG, F. R. K.<\/small>, GRAHAM, R. L.<\/small> and WILSON, R. M.<\/small> (1989). Quasi-random graphs. Combinatorica<\/i> 9<\/b> 345\u2013362.","DOI":"10.1007\/BF02125347"},{"key":"23","doi-asserted-by":"publisher","unstructured":"DELMAS, J.-F.<\/small>, DHERSIN, J.-S.<\/small> and SCIAUVEAU, M.<\/small> (2021). Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon. Random Structures Algorithms<\/i> 58<\/b> 94\u2013149.","DOI":"10.1002\/rsa.20965"},{"key":"24","doi-asserted-by":"publisher","unstructured":"DIACONIS, P.<\/small> and FREEDMAN, D.<\/small> (1981). On the statistics of vision: The Julesz conjecture. J. Math. Psych.<\/i> 24<\/b> 112\u2013138.","DOI":"10.1016\/0022-2496(81)90039-0"},{"key":"29","unstructured":"GAO, C.<\/small> and LAFFERTY, J.<\/small> (2017). Testing for global network structure using small subgraph statistics. Preprint. Available at arXiv:1710.00862<\/a>."},{"key":"30","unstructured":"GAO, C.<\/small> and LAFFERTY, J.<\/small> (2017). Testing network structure using relations between small subgraph probabilities. Preprint. Available at arXiv:1704.06742<\/a>."},{"key":"32","unstructured":"GHOSHDASTIDAR, D.<\/small>, GUTZEIT, M.<\/small>, CARPENTIER, A.<\/small> and VON LUXBURG, U.<\/small> (2017). Two-sample tests for large random graphs using network statistics. In Conference on Learning Theory<\/i> 954\u2013977. PMLR."},{"key":"39","unstructured":"HUANG, K. H.<\/small>, AUSTERN, M.<\/small> and ORBANZ, P.<\/small> (2024). Gaussian universality for approximately polynomial functions of high-dimensional data. Preprint. Available at arXiv:2403.10711<\/a>."},{"key":"41","doi-asserted-by":"publisher","unstructured":"JANSON, S.<\/small> (1990). A functional limit theorem for random graphs with applications to subgraph count statistics. Random Structures Algorithms<\/i> 1<\/b> 15\u201337.","DOI":"10.1002\/rsa.3240010103"},{"key":"42","doi-asserted-by":"publisher","unstructured":"JANSON, S.<\/small> (1994). Orthogonal decompositions and functional limit theorems for random graph statistics. Mem. Amer. Math. Soc.<\/i> 111<\/b> vi+78.","DOI":"10.1090\/memo\/0534"},{"key":"44","doi-asserted-by":"publisher","unstructured":"JANSON, S.<\/small>, \u0141UCZAK, T.<\/small> and RUCINSKI, A.<\/small> (2011). Random Graphs<\/i>. Wiley-Interscience Series in Discrete Mathematics and Optimization<\/i>. Wiley Interscience, New York.","DOI":"10.1002\/9781118032718"},{"key":"45","doi-asserted-by":"publisher","unstructured":"JANSON, S.<\/small> and NOWICKI, K.<\/small> (1991). The asymptotic distributions of generalized U<\/i>-statistics with applications to random graphs. Probab. Theory Related Fields<\/i> 90<\/b> 341\u2013375.","DOI":"10.1007\/BF01193750"},{"key":"46","doi-asserted-by":"publisher","unstructured":"KAUR, G.<\/small> and R\u00d6LLIN, A.<\/small> (2021). Higher-order fluctuations in dense random graph models. Electron. J. Probab.<\/i> 26<\/b> Paper No. 139, 36 pp.","DOI":"10.1214\/21-ejp708"},{"key":"48","doi-asserted-by":"publisher","unstructured":"LE MINH, T.<\/small> (2023). U<\/i>-statistics on bipartite exchangeable networks. ESAIM Probab. Stat.<\/i> 27<\/b> 576\u2013620.","DOI":"10.1051\/ps\/2023010"},{"key":"52","unstructured":"LIN, Q.<\/small>, LUNDE, R.<\/small> and SARKAR, P.<\/small> (2022). Trading off accuracy for speedup: Multiplier bootstraps for subgraph counts. Preprint. Available at arXiv:2009.06170v5<\/a>."},{"key":"53","doi-asserted-by":"publisher","unstructured":"LIU, Q.<\/small> and PRIVAULT, N.<\/small> (2026). Gaussian fluctuations of generalized U<\/i>-statistics and subgraph counting in the binomial random-connection model. Stoch. Process. Appl.<\/i> 192<\/b> Paper No. 104825, 21 pp.","DOI":"10.1016\/j.spa.2025.104825"},{"key":"56","doi-asserted-by":"publisher","unstructured":"LUCE, R. D.<\/small> and PERRY, A. D.<\/small> (1949). A method of matrix analysis of group structure. Psychometrika<\/i> 14<\/b> 95\u2013116.","DOI":"10.1007\/BF02289146"},{"key":"58","unstructured":"LYU, H.<\/small>, M\u00c9MOLI, F.<\/small> and SIVAKOFF, D.<\/small> (2023). Sampling random graph homomorphisms and applications to network data analysis. J. Mach. Learn. Res.<\/i> 24<\/b> Paper No. [9], 79 pp."},{"key":"59","unstructured":"MAUGIS, P.<\/small>, PRIEBE, C. E.<\/small>, OLHEDE, S. C.<\/small> and WOLFE, P. J.<\/small> (2017). Statistical inference for network samples using subgraph counts. Preprint. Available at arXiv:1701.00505<\/a>."},{"key":"62","doi-asserted-by":"publisher","unstructured":"MOSSEL, E.<\/small>, NEEMAN, J.<\/small> and SLY, A.<\/small> (2016). Consistency thresholds for the planted bisection model. Electron. J. Probab.<\/i> 21<\/b> Paper No. 21, 24 pp.","DOI":"10.1214\/16-EJP4185"},{"key":"65","doi-asserted-by":"publisher","unstructured":"NOWICKI, K.<\/small> (1989). Asymptotic normality of graph statistics. J. Statist. Plann. Inference<\/i> 21<\/b> 209\u2013222.","DOI":"10.1016\/0378-3758(89)90005-0"},{"key":"66","doi-asserted-by":"publisher","unstructured":"NOWICKI, K.<\/small> and WIERMAN, J. C.<\/small> (1988). Subgraph counts in random graphs using incomplete U<\/i>-statistics methods. Discrete Math.<\/i> 72<\/b> 299\u2013310.","DOI":"10.1016\/0012-365X(88)90220-8"},{"key":"67","doi-asserted-by":"publisher","unstructured":"OUADAH, S.<\/small>, LATOUCHE, P.<\/small> and ROBIN, S.<\/small> (2022). Motif-based tests for bipartite networks. Electron. J. Stat.<\/i> 16<\/b> 293\u2013330.","DOI":"10.1214\/21-ejs1944"},{"key":"72","doi-asserted-by":"publisher","unstructured":"SHAO, M.<\/small>, XIA, D.<\/small>, ZHANG, Y.<\/small>, WU, Q.<\/small> and CHEN, S.<\/small> (2026). Higher-order accurate two-sample network inference and network hashing. J. Amer. Statist. Assoc.<\/i> 121<\/b> 373\u2013388.","DOI":"10.1080\/01621459.2025.2520459"},{"key":"73","doi-asserted-by":"crossref","unstructured":"SHEN-ORR, S. S.<\/small>, MILO, R.<\/small>, MANGAN, S.<\/small> and ALON, U.<\/small> (2002). Network motifs in the transcriptional regulation network of Escherichia coli. Nat. Genet.<\/i> 31<\/b> 64\u201368.","DOI":"10.1038\/ng881"},{"key":"79","doi-asserted-by":"publisher","unstructured":"ZHANG, Z.-S.<\/small> (2022). Berry-Esseen bounds for generalized U<\/i>-statistics. Electron. J. Probab.<\/i> 27<\/b> Paper No. 134, 36 pp.","DOI":"10.1214\/22-ejp860"},{"key":"8","doi-asserted-by":"publisher","unstructured":"BHATTACHARYA, B. B.<\/small>, DAS, S.<\/small> and MUKHERJEE, S.<\/small> (2022). Motif estimation via subgraph sampling: The fourth-moment phenomenon. Ann. Statist.<\/i> 50<\/b> 987\u20131011.","DOI":"10.1214\/21-aos2134"}],"container-title":["The Annals of Statistics"],"original-title":[],"deposited":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T21:12:28Z","timestamp":1791321148000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/annals-of-statistics\/volume-54\/issue-4\/Higher-order-graphon-theory-Fluctuations-degeneracies-and-inference\/10.1214\/26-AOS2644.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,1]]},"references-count":79,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2026,8,1]]}},"URL":"https:\/\/doi.org\/10.1214\/26-aos2644","relation":{},"ISSN":["0090-5364","2168-8966"],"issn-type":[{"value":"0090-5364","type":"print"},{"value":"2168-8966","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,1]]}}}