Fetching the paper…
Reading the bibliography…
Graphons are infinite-dimensional objects that represent the limit of convergent sequences of graphs as their number of nodes goes to infinity.
R. Levie, E. Isufi, and G. Leus, Kutyniok, “On the transferability of spectral graph filters,”
1901
Earlier work this paper cites.
1903
Earlier work this paper cites.
L. Ruiz, L. F. O. Chamon, and A. Ribeiro, “The Graphon Fourier Transform,”
1910
Earlier work this paper cites.
C. C. Paige, “The computation of eigenvalues and eigenvectors of very large sparse matrices,” Ph.D. dissertation, University of London, 1971
1971
Earlier work this paper cites.
R. B. Morgan, “Computing interior eigenvalues of large matrices,”
1991
Earlier work this paper cites.
S. P. e. a. Arya,
1999
Earlier work this paper cites.
P. D. Lax,
2002
Earlier work this paper cites.
L. Lovász and B. Szegedy, “Limits of dense graph sequences,”
2006
Earlier work this paper cites.
D. Kerr and H. Li, “On Gromov-Hausdorff convergence for operator metric spaces,”
2009
Earlier work this paper cites.
K. Rohe, S. Chatterjee, and B. e. a. Yu, “Spectral clustering and the high-dimensional stochastic blockmodel,”
2011
Earlier work this paper cites.
L. Lovász,
2012
Earlier work this paper cites.
C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós, and K. Vesztergombi, “Convergent sequences of dense graphs ii. multiway cuts and statistical physics,”
2012
Earlier work this paper cites.
D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, “The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains,”
2013
Earlier work this paper cites.
A. Sandryhaila and J. M. F. Moura, “Discrete signal processing on graphs: Graph filters,” in
2013
Earlier work this paper cites.
P. J. Wolfe and S. C. Olhede, “Nonparametric graphon estimation,”
2013
Earlier work this paper cites.
E. M. Airoldi, T. B. Costa, and S. H. Chan, “Stochastic blockmodel approximation of a graphon: Theory and consistent estimation,” in
2013
Earlier work this paper cites.
S. Janson, “Graphons, cut norm and distance, couplings and rearrangements,”
2013
Cited alongside, same era.
A. Sandryhaila and J. M. F. Moura, “Discrete signal processing on graphs: Frequency analysis,”
2014
Cited alongside, same era.
J. Xu, L. Massoulié, and M. Lelarge, “Edge label inference in generalized stochastic block models: from spectral theory to impossibility results,” in
2014
Cited alongside, same era.
A. Seelmann, “Notes on the sin 2
2014
Cited alongside, same era.
S. Chen, R. Varma, A. Sandryhaila, and J. Kovacevic, “Discrete signal processing on graphs: Sampling theory,”
2015
Cited alongside, same era.
A. G. Marques, S. Segarra, G. Leus, and A. Ribeiro, “Sampling of graph signals with successive local aggregations,”
M. W. Morency and G. Leus, “Signal processing on kernel-based random graphs,” in
2017
Later among the works it cites.
F. Monti, M. M. Bronstein, and X. Bresson, “Geometric matrix completion with recurrent multi-graph neural networks,” in
2017
Later among the works it cites.
A. Ortega, P. Frossard, J. Kovačević, J. M. F. Moura, and P. Vandergheynst, “Graph signal processing: Overview, challenges, and applications,”
2018
Later among the works it cites.
F. Gama, A. G. Marques, G. Leus, and A. Ribeiro, “Convolutional neural network architectures for signals supported on graphs,”
2018
Later among the works it cites.
S. Gao and P. E. Caines, “Graphon control of large-scale networks of linear systems,”
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
C. Gao, Y. Lu, and H. H. e. a. Zhou, “Rate-optimal graphon estimation,”
2015
Cited alongside, same era.
L. Rui, H. Nejati, and N. Cheung, “Dimensionality reduction of brain imaging data using graph signal processing,” in
2016
Cited alongside, same era.
P. Diao, D. Guillot, A. Khare, and B. Rajaratnam, “Model-free consistency of graph partitioning,”
2016
Cited alongside, same era.
M. D. Penrose, “Connectivity of soft random geometric graphs,”
2016
Cited alongside, same era.
F. M. Harper and J. A. Konstan, “The movielens datasets: History and context,”
2016
Cited alongside, same era.
S. Segarra, A. G. Marques, and A. Ribeiro, “Optimal graph-filter design and applications to distributed linear network operators,”
2017
Cited alongside, same era.
M. Avella-Medina, F. Parise, M. Schaub, and S. Segarra, “Centrality measures for graphons: Accounting for uncertainty in networks,”
2018
Later among the works it cites.
W. Huang, A. G. Marques, and A. Ribeiro, “Rating prediction via graph signal processing,”
2018
Later among the works it cites.
F. Gama, J. Bruna, and A. Ribeiro, “Stability properties of graph neural networks,”
2019
Later among the works it cites.
F. Parise and A. Ozdaglar, “Graphon games,” in
2019
Later among the works it cites.
2019
Later among the works it cites.
F. Gama and A. Ribeiro, “Ergodicity in stationary graph processes: A weak law of large numbers,”
2019
Later among the works it cites.
E. Tolstaya, F. Gama, J. Paulos, G. Pappas, V. Kumar, and A. Ribeiro, “Learning decentralized controllers for robot swarms with graph neural networks,” in
2020
Closest in time.
2020
Closest in time.
R. Ramakrishna, H. Wai, and A. Scaglione, “A user guide to low-pass graph signal processing and its applications: Tools and applications,”
2020
Closest in time.
L. Ruiz, L. F. O. Chamon, and A. RIbeiro, “Graphon neural networks and the transferability of graph neural networks,” in
2020
Closest in time.