Fetching the paper…
Reading the bibliography…
Networks are a natural representation of complex systems across the sciences, and higher-order dependencies are central to the understanding and modeling of these systems.
A generalization of sampling without replacement from a finite universe
D. G. Horvitz and D. J. Thompson · 1952
Earlier work this paper cites.
Random sampling with a reservoir
J. S. Vitter · 1985
Earlier work this paper cites.
Estimation with quadratic loss
W. James and C. Stein · 1992
Earlier work this paper cites.
Asymptotic theory for order sampling
B. Rosén · 1997
Earlier work this paper cites.
Statistical mechanics of complex networks
R. Albert and A.-L. Barabási · 2002
Earlier work this paper cites.
Network motifs: simple building blocks of complex networks
R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon · 2002
Earlier work this paper cites.
Improved estimation of the covariance matrix of stock returns with an application to portfolio selection
O. Ledoit and M. Wolf · 2003
Earlier work this paper cites.
The structure and function of complex networks
M. E. Newman · 2003
Earlier work this paper cites.
Data streams: Algorithms and applications
S. Muthukrishnan et al · 2005
Earlier work this paper cites.
A shrinkage approach to large-scale covariance matrix estimation and implications for functional genomics
J. Schäfer and K. Strimmer · 2005
Earlier work this paper cites.
Counting triangles in data streams
L. S. Buriol, G. Frahling, S. Leonardi, A. Marchetti-Spaccamela, and C. Sohler · 2006
Earlier work this paper cites.
Weighted random sampling with a reservoir
P. S. Efraimidis and P. G. Spirakis · 2006
Earlier work this paper cites.
Sampling from large graphs
J. Leskovec and C. Faloutsos · 2006
Earlier work this paper cites.
Priority sampling for estimation of arbitrary subset sums
N. Duffield, C. Lund, and M. Thorup · 2007
Earlier work this paper cites.
Measurement and Analysis of Online Social Networks
A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee · 2007
Earlier work this paper cites.
Efficient semi-streaming algorithms for local triangle counting in massive graphs
L. Becchetti, P. Boldi, C. Castillo, and A. Gionis · 2008
Earlier work this paper cites.
Maintaining bounded-size sample synopses of evolving datasets
R. Gemulla, W. Lehner, and P. J. Haas · 2008
Earlier work this paper cites.
Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters
J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney · 2009
Earlier work this paper cites.
Doulion: counting triangles in massive graphs with a coin
C. E. Tsourakakis, U. Kang, G. L. Miller, and C. Faloutsos · 2009
Cited alongside, same era.
Shrinkage algorithms for mmse covariance estimation
Y. Chen, A. Wiesel, Y. C. Eldar, and A. O. Hero · 2010
Cited alongside, same era.
Signed networks in social media
J. Leskovec, D. Huttenlocher, and J. Kleinberg · 2010
Cited alongside, same era.
Robust shrinkage estimation of high-dimensional covariance matrices
Y. Chen, A. Wiesel, and A. O. Hero · 2011
Cited alongside, same era.
Estimating pagerank on graph streams
A. D. Sarma, S. Gollapudi, and R. Panigrahy · 2011
Cited alongside, same era.
Triangle sparsifiers
C. E. Tsourakakis, M. N. Kolountzakis, and G. L. Miller · 2011
Cited alongside, same era.
Vertex and hyperedge connectivity in dynamic graph streams
S. Guha, A. McGregor, and D. Tench · 2015
Later among the works it cites.
Mascot: Memory-efficient and accurate sampling for counting local triangles in graph streams
Y. Lim and U. Kang · 2015
Later among the works it cites.
The network data repository with interactive graph analytics and visualization
R. A. Rossi and N. K. Ahmed · 2015
Later among the works it cites.
Higher-order organization of complex networks
A. R. Benson, D. F. Gleich, and J. Leskovec · 2016
Later among the works it cites.
Higher-order aggregate networks in the analysis of temporal networks: path structures and centralities
I. Scholtes, N. Wider, and A. Garas · 2016
Later among the works it cites.
Representing higher-order dependencies in networks
J. Xu, T. L. Wickramarathne, and N. V. Chawla · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Graph of flickr photo-sharing social network crawled in may 2006, Feb 2012
D. F. Gleich · 2012
Cited alongside, same era.
Near-optimal entrywise sampling for data matrices
D. Achlioptas, Z. S. Karnin, and E. Liberty · 2013
Cited alongside, same era.
A space efficient streaming algorithm for triangle counting using the birthday paradox
M. Jha, C. Seshadhri, and A. Pinar · 2013
Cited alongside, same era.
Counting and sampling triangles from a graph stream
A. Pavan, K. Tangwongsan, S. Tirthapura, and K.-L. Wu · 2013
Cited alongside, same era.
Triadic measures on graphs: The power of wedge sampling
C. Seshadhri, A. Pinar, and T. G. Kolda · 2013
Cited alongside, same era.
Art of computer programming, volume 2: Seminumerical algorithms
D. E. Knuth · 2014
Cited alongside, same era.
Later among the works it cites.
Higher-order interactions stabilize dynamics in competitive network models
J. Grilli, G. Barabás, M. J. Michalska-Smith, and S. Allesina · 2017
Later among the works it cites.
Improving Efficiency by Shrinkage: The James–Stein and Ridge Regression Estimators
M. Gruber · 2017
Later among the works it cites.
Matrix norm estimation from a few entries
A. Khetan and S. Oh · 2017
Later among the works it cites.
Triest: Counting local and global triangles in fully dynamic streams with fixed memory size
L. D. Stefani, A. Epasto, M. Riondato, and E. Upfal · 2017
Later among the works it cites.
Scalable motif-aware graph clustering
C. E. Tsourakakis, J. Pachocki, and M. Mitzenmacher · 2017
Later among the works it cites.
Local higher-order graph clustering
H. Yin, A. R. Benson, J. Leskovec, and D. F. Gleich · 2017
Later among the works it cites.
Approximating the spectrum of a graph
D. Cohen-Steiner, W. Kong, C. Sohler, and G. Valiant · 2018
Later among the works it cites.
The hyperkron graph model for higher-order features
N. Eikmeier, A. Ramani, and D. Gleich · 2018
Later among the works it cites.
Higher-order network representation learning
R. A. Rossi, N. K. Ahmed, and E. Koh · 2018
Later among the works it cites.
Ranking users in social networks with higher-order structures
H. Zhao, X. Xu, Y. Song, D. L. Lee, Z. Chen, and H. Gao · 2018
Later among the works it cites.
A structural graph representation learning framework
R. A. Rossi, N. K. Ahmed, E. Koh, S. Kim, A. Rao, and Y. Abbasi-Yadkori · 2020
Closest in time.