Fetching the paper…
Reading the bibliography…
We propose data-driven one-pass streaming algorithms for estimating the number of triangles and four cycles, two fundamental problems in graph analytics that are widely studied in the graph data stream literature.
Neural Network Learning: Theoretical Foundations
Martin Anthony and Peter L. Bartlett · 1999
Earlier work this paper cites.
Reductions in streaming algorithms, with an application to counting triangles in graphs
Ziv Bar-Yossef, Ravi Kumar, and D. Sivakumar · 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.
The spectra of random graphs with given expected degrees
Fan Chung, Linyuan Lu, and Van Vu · 2003
Earlier work this paper cites.
Graphs over time: Densification laws, shrinking diameters and possible explanations
Jure Leskovec, Jon Kleinberg, and Christos Faloutsos · 2005
Earlier work this paper cites.
Improved 3-pass algorithm for counting 4-cycles in arbitrary order streaming
Sofya Vorotnikova · 2007
Earlier work this paper cites.
Size bounds and query plans for relational joins
Albert Atserias, Martin Grohe, and Daniel Marx · 2008
Earlier work this paper cites.
Microscopic evolution of social networks
Jure Leskovec, Lars Backstrom, Ravi Kumar, and Andrew Tomkins · 2008
Earlier work this paper cites.
Streamed learning: One-pass svms
Piyush Rai, Hal Daumé, and Suresh Venkatasubramanian · 2009
Earlier work this paper cites.
Is a ”friend” a friend? investigating the structure of friendship networks in virtual worlds
Brooke Foucault Welles, Anne Van Devender, and Noshir Contractor · 2010
Earlier work this paper cites.
Efficient triangle counting in large graphs via degree-based vertex partitioning
Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, and Charalampos E. Tsourakakis · 2010
Earlier work this paper cites.
Spectra of” real-world” graphs: Beyond the semicircle law
Illes J Farkas, Imre Derényi, A-L Barabási, and Tamas Vicsek · 2011
Earlier work this paper cites.
Large text compression benchmark., 2011
M. Mahoney · 2011
Earlier work this paper cites.
Colorful triangle counting and a mapreduce implementation
Rasmus Pagh and Charalampos E. Tsourakakis · 2011
Earlier work this paper cites.
Shaping communities out of triangles
Arnau Prat-Pérez, David Dominguez-Sal, Josep M Brunat, and Josep-Lluis Larriba-Pey · 2012
Earlier work this paper cites.
How hard is counting triangles in the streaming model?
Vladimir Braverman, Rafail Ostrovsky, and Dan Vilenchik · 2013
Earlier work this paper cites.
Fast triangle counting through wedge sampling
C. Seshadhri, Ali Pinar, and Tamara G. Kolda · 2013
Earlier work this paper cites.
SNAP Datasets: Stanford large network dataset collection
Jure Leskovec and Andrej Krevl · 2014
Earlier work this paper cites.
Sketching as a tool for numerical linear algebra
David P. Woodruff · 2014
Earlier work this paper cites.
Mascot: Memory-efficient and accurate sampling for counting local triangles in graph streams
Yongsub Lim and U Kang · 2015
Earlier work this paper cites.
The network data repository with interactive graph analytics and visualization
Ryan A. Rossi and Nesreen K. Ahmed · 2015
Earlier work this paper cites.
Better algorithms for counting triangles in data streams
Andrew McGregor, Sofya Vorotnikova, and Hoa T. Vu · 2016
Earlier work this paper cites.
Learning to hash for indexing big data - a survey
Jun Wang, Wei Liu, Sanjiv Kumar, and Shih-Fu Chang · 2016
Earlier work this paper cites.
On sampling from massive graph streams
Nesreen K. Ahmed, Nick Duffield, Theodore L. Willke, and Ryan A. Rossi · 2017
Earlier work this paper cites.
High frequency moments via max-stability
Alexandr Andoni · 2017
Cited alongside, same era.
Learning-theoretic foundations of algorithm configuration for combinatorial partitioning problems
Maria-Florina Balcan, Vaishnavh Nagarajan, Ellen Vitercik, and Colin White · 2017
Cited alongside, same era.
Towards tighter space bounds for counting triangles and other substructures in graph streams
Suman K. Bera and Amit Chakrabarti · 2017
Cited alongside, same era.
Learning combinatorial optimization algorithms over graphs
Hanjun Dai, Elias Khalil, Yuyu Zhang, Bistra Dilkina, and Le Song · 2017
Cited alongside, same era.
Edge sample and discard: A new algorithm for counting triangles in large dynamic graphs
Guyue Han and Harish Sethu · 2017
Cited alongside, same era.
A hybrid sampling scheme for triangle counting
John Kallaugher and Eric Price · 2017
Multi-scale attributed node embedding, 2019
Benedek Rozemberczki, Carl Allen, and Rik Sarkar · 2019
Later among the works it cites.
Adaptive shrinkage estimation for streaming graphs
Nesreen Ahmed and Nick Duffield · 2020
Later among the works it cites.
Streaming complexity of svms
Alexandr Andoni, Collin Burns, Ying Li, Sepideh Mahabadi, and David P. Woodruff · 2020
Later among the works it cites.
The primal-dual method for learning augmented algorithms
Etienne Bamas, Andreas Maggiori, and Ola Svensson · 2020
Later among the works it cites.
How the degeneracy helps for traingle counting in graph streams
Suman K. Bera and C. Sheshadhri · 2020
Later among the works it cites.
Composable sketches for functions of frequencies: Beyond the worst case
Edith Cohen, Ofir Geri, and Rasmus Pagh · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Wrs: Waiting room sampling for accurate triangle counting in real graph streams
Kijung Shin · 2017
Cited alongside, same era.
TriÈst: Counting local and global triangles in fully dynamic streams with fixed memory size
Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, and Eli Upfal · 2017
Cited alongside, same era.
Triangle counting in large networks: a review
Mohammad Al Hasan and Vachik S Dave · 2018
Cited alongside, same era.
Dispersion for data-driven algorithm design, online learning, and private optimization
Maria-Florina Balcan, Travis Dick, and Ellen Vitercik · 2018
Cited alongside, same era.
The case for learned index structures
Tim Kraska, Alex Beutel, Ed H Chi, Jeffrey Dean, and Neoklis Polyzotis · 2018
Cited alongside, same era.
Community interaction and conflict on the web
Srijan Kumar, William L Hamilton, Jure Leskovec, and Dan Jurafsky · 2018
Cited alongside, same era.
Learning space partitions for nearest neighbor search
Yihe Dong, Piotr Indyk, Ilya P Razenshteyn, and Tal Wagner · 2020
Later among the works it cites.
Why are learned indexes so effective?
Paolo Ferragina, Fabrizio Lillo, and Giorgio Vinciguerra · 2020
Later among the works it cites.
Learning-augmented data stream algorithms
Tanqiu Jiang, Yi Li, Honghao Lin, Yisong Ruan, and David P. Woodruff · 2020
Later among the works it cites.
Online scheduling via learned weights
Silvio Lattanzi, Thomas Lavastida, Benjamin Moseley, and Sergei Vassilvitskii · 2020
Later among the works it cites.
Triangle and four cycle counting in the data stream model
Andrew McGregor and Sofya Vorotnikova · 2020
Later among the works it cites.
Scheduling with predictions and the price of misprediction
Michael Mitzenmacher · 2020
Later among the works it cites.
Michael Mitzenmacher and Sergei Vassilvitskii · 2020
Later among the works it cites.
Near-optimal bounds for online caching with machine learned advice
Dhruv Rohatgi · 2020
Later among the works it cites.
Wrs: Waiting room sampling for accurate triangle counting in real graph streams
Kijung Shin · 2020
Later among the works it cites.
Think before you discard: Accurate triangle counting in graph streams with deletions
Kijung Shin, Jisu Kim, Bryan Hooi, and Christos Faloutsos · 2020
Later among the works it cites.
Better and simpler learning-augmented online caching
Alexander Wei · 2020
Later among the works it cites.
Faster matchings via learned duals
Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, and Sergei Vassilvitskii · 2021
Later among the works it cites.
Putting the “learning” into learning-augmented algorithms for frequency estimation
Elbert Du, Franklyn Wang, and Michael Mitzenmacher · 2021
Later among the works it cites.
Learning-based support estimation in sublinear time
Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, and Tal Wagner · 2021
Later among the works it cites.
Dimensionality reduction for wasserstein barycenter
Zachary Izzo, Sandeep Silwal, and Samson Zhou · 2021
Later among the works it cites.
An optimal algorithm for triangle counting in the stream
Rajesh Jayaram and John Kallaugher · 2021
Later among the works it cites.
Partitioned learned bloom filter
Kapil Vaidya, Eric Knorr, Tim Kraska, and Michael Mitzenmacher · 2021
Later among the works it cites.