{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:44:20Z","timestamp":1773377060454,"version":"3.50.1"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195516","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["A Local Graph Limits Perspective on Sampling-Based GNNs"],"prefix":"10.1109","author":[{"given":"Yeganeh","family":"Alimohammadi","sequence":"first","affiliation":[{"name":"University of Southern California"}]},{"given":"Luana","family":"Ruiz","sequence":"additional","affiliation":[{"name":"Johns Hopkins University"}]},{"given":"Amin","family":"Saberi","sequence":"additional","affiliation":[{"name":"Stanford University"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Graphon neural networks and the transferability of graph neural networks","volume":"33","author":"Ruiz","year":"2020","journal-title":"Neural Inform. Process. Syst."},{"key":"ref2","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"International conference on machine learning","author":"Gilmer"},{"key":"ref3","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2016","journal-title":"arXiv preprint arXiv"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3054830"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2887403"},{"key":"ref6","article-title":"Inductive representation learning on large graphs","volume":"30","author":"Hamilton","year":"2017","journal-title":"Neural Inform. Process. Syst."},{"key":"ref7","article-title":"Fast graph representation learning with PyTorch Geometric","author":"Fey","year":"2019","journal-title":"arXiv preprint arXiv"},{"key":"ref8","first-page":"19 665","article-title":"Decoupling the depth and scope of graph neural networks","volume":"34","author":"Zeng","year":"2021","journal-title":"Neural Inform. Process. Syst."},{"key":"ref9","first-page":"1","article-title":"How powerful are graph neural networks?","volume-title":"7th Int. Conf. Learning Representations","author":"Xu"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1214\/ejp.v6-96"},{"key":"ref11","first-page":"1","volume-title":"The objective method: probabilistic combinatorial optimization and local weak convergence","author":"Aldous","year":"2004"},{"key":"ref12","volume":"2","author":"van der Hofstad","year":"2022","journal-title":"Random graphs and complex networks"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/09-AAP627"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1214\/12-aop755"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20168"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.136"},{"key":"ref17","article-title":"FastGCN: Fast Learning with Graph Con-volutional Networks via Importance Sampling","volume-title":"Int. Conf. Learning Representations","author":"Chen"},{"key":"ref18","first-page":"3294","article-title":"Gnnautoscale: Scalable and expressive graph neural networks via historical embed-dings","volume-title":"International conference on machine learning","author":"Fey"},{"key":"ref19","first-page":"25 819","article-title":"Layer-neighbor sampling-defusing neighborhood explosion in gnns","volume":"36","author":"Balin","year":"2023","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref20","first-page":"25 684","article-title":"Graphfm: Im-proving large-scale gnn training via feature momentum","volume-title":"International Conference on Machine Learning","author":"Yu"},{"key":"ref21","article-title":"Lmc: Fast training of gnns via subgraph sampling with provable convergence","volume-title":"The Eleventh International Conference on Learning Representations","author":"Shi"},{"key":"ref22","first-page":"9","article-title":"Influence-based mini-batching for graph neural networks","volume-title":"Learning on Graphs Conference","author":"Gasteiger"},{"key":"ref23","article-title":"Link prediction based on graph neural networks","volume":"31","author":"Zhang","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/isit63088.2025.11195516"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2021.1004311"},{"key":"ref26","first-page":"11 975","article-title":"From local structures to size generalization in graph neural networks","volume-title":"International Conference on Machine Learning","author":"Yehudai"},{"key":"ref27","first-page":"55 479","article-title":"Efficient learning of linear graph neural networks via node subsampling","volume":"36","author":"Shin","year":"2023","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref28","article-title":"To prune, or not to prune: exploring the efficacy of pruning for model compression","author":"Zhu","year":"2017","journal-title":"arXiv preprint arXiv"},{"key":"ref29","article-title":"The state of sparsity in deep neural networks","author":"Gale","year":"2019","journal-title":"arXiv preprint arXiv"},{"key":"ref30","article-title":"Energy and policy con-siderations for deep learning in nlp","author":"Strubell","year":"2019","journal-title":"arXiv preprint arXiv"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.l803.03635"},{"key":"ref32","first-page":"3259","article-title":"Linear mode con-nectivity and the lottery ticket hypothesis","volume-title":"International Conference on Machine Learning","author":"Frankle"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2021.3055400"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1017\/etds.2013.56"},{"key":"ref35","first-page":"22 118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume":"33","author":"Hu","year":"2020","journal-title":"Neural Inform. Process. Syst."}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195516.pdf?arnumber=11195516","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:24Z","timestamp":1773347424000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195516\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195516","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}