Fetching the paper…
Reading the bibliography…
In various application areas, networked data is collected by measuring interactions involving some specific set of core nodes.
Intersection theorems for systems of sets
Paul Erdös and Richard Rado. 1960 · 1960
Earlier work this paper cites.
Structural equivalence of individuals in social networks
François Lorrain and Harrison C. White. 1971 · 1971
Earlier work this paper cites.
Network structure and minimum degree
Stephen B. Seidman. 1983 · 1983
Earlier work this paper cites.
Structural equivalence in a psychology journal network
Patrick Doreian. 1985 · 1985
Earlier work this paper cites.
Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability
Béla Bollobás. 1986 · 1986
Earlier work this paper cites.
Power and Centrality: A Family of Measures
Phillip Bonacich. 1987 · 1987
Earlier work this paper cites.
The boundary specification problem in network analysis
Edward O Laumann, Peter V Marsden, and David Prensky. 1989 · 1989
Earlier work this paper cites.
Structure and Dynamics of the Global Economy: Network Analysis of International Trade 1965–1980
D. A. Smith and D. R. White. 1992 · 1992
Earlier work this paper cites.
Directed hypergraphs and applications
Giorgio Gallo, Giustino Longo, Stefano Pallottino, and Sang Nguyen. 1993 · 1993
Earlier work this paper cites.
A digital dark ages? Challenges in the preservation of electronic information of electronic information. In IFLA Council and General Conference
T Kuny. 1997 · 1997
Earlier work this paper cites.
Finding a Large Hidden Clique in a Random Graph. In SODA
Noga Alon, Michael Krivelevich, and Benny Sudakov. 1998 · 1998
Earlier work this paper cites.
Models of core/periphery structures
Stephen P Borgatti and Martin G Everett. 2000 · 2000
Earlier work this paper cites.
Finding and certifying a large hidden clique in a semirandom graph
Uriel Feige and Robert Krauthgamer. 2000 · 2000
Earlier work this paper cites.
Why and Where: A Characterization of Data Provenance
Peter Buneman, Sanjeev Khanna, and Tan Wang-Chiew. 2001 · 2001
Earlier work this paper cites.
UbiCrawler: a scalable fully distributed Web crawler
Paolo Boldi, Bruno Codenotti, Massimo Santini, and Sebastiano Vigna. 2004 · 2004
Earlier work this paper cites.
The Enron Corpus: A New Dataset for Email Classification Research
Bryan Klimt and Yiming Yang. 2004 · 2004
Earlier work this paper cites.
Research problems in data provenance
Wang-Chiew Tan. 2004 · 2004
Earlier work this paper cites.
Overview of the TREC 2005 Enterprise Track. In TREC , Vol. 5. 199–205
Nick Craswell, Arjen P de Vries, and Ian Soboroff. 2005 · 2005
Earlier work this paper cites.
Core-periphery organization of complex networks
Petter Holme. 2005 · 2005
Cited alongside, same era.
A survey of data provenance in e-science
Yogesh L. Simmhan, Beth Plale, and Dennis Gannon. 2005 · 2005
Cited alongside, same era.
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Peter Damaschke. 2006 · 2006
Cited alongside, same era.
The relationship between Precision-Recall and ROC curves. In ICML
Jesse Davis and Mark Goadrich. 2006 · 2006
Cited alongside, same era.
Effects of missing data in social networks
Gueorgi Kossinets. 2006 · 2006
Cited alongside, same era.
How do your data grow?
Clifford Lynch. 2008 · 2008
Cited alongside, same era.
BUbiNG: Massive Crawling for the Masses. In WWW
Paolo Boldi, Andrea Marino, Massimo Santini, and Sebastiano Vigna. 2014 · 2014
Later among the works it cites.
Axioms for Centrality
Paolo Boldi and Sebastiano Vigna. 2014 · 2014
Later among the works it cites.
Finding Hidden Cliques of Size N / e \sqrt{N/e} in Nearly Linear Time
Yash Deshpande and Andrea Montanari. 2014 · 2014
Later among the works it cites.
Consistency of spectral partitioning of uniform hypergraphs under planted partition model. In NeurIPS
Debarghya Ghoshdastidar and Ambedkar Dukkipati. 2014 · 2014
Later among the works it cites.
On independent sets in hypergraphs
Alexandr Kostochka, Dhruv Mubayi, and Jacques Verstraëte. 2014 · 2014
Later among the works it cites.
Belief propagation, robust reconstruction and optimal recovery of block models. In COLT
Elchanan Mossel, Joe Neeman, and Allan Sly. 2014 · 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Peter Damaschke and Leonid Molokov. 2009 · 2009
Cited alongside, same era.
Missing and spurious interactions and the reconstruction of complex networks
Roger Guimerà and Marta Sales-Pardo. 2009 · 2009
Cited alongside, same era.
Independent sets in bounded-degree hypergraphs
Magnús M. Halldórsson and Elena Losievskaja. 2009 · 2009
Cited alongside, same era.
Surveillance: Power, Problems, and Politics
Sean P. Hier and Josh Greenberg. 2009 · 2009
Cited alongside, same era.
Respondent-Driven Sampling: An Assessment of Current Methodology
Krista J. Gile and Mark S. Handcock. 2010 · 2010
Cited alongside, same era.
Assessing respondent-driven sampling
S. Goel and M. J. Salganik. 2010 · 2010
Cited alongside, same era.
Later among the works it cites.
PageRank Beyond the Web
David F. Gleich. 2015 · 2015
Later among the works it cites.
Streaming Graph Partitioning in the Planted Partition Model. In COSN
Charalampos Tsourakakis. 2015 · 2015
Later among the works it cites.
Social Networks Under Stress. In WWW
Daniel M. Romero, Brian Uzzi, and Jon Kleinberg. 2016 · 2016
Later among the works it cites.
The k-peak Decomposition. In WWW
Priya Govindan, Chenghong Wang, Chumeng Xu, Hongyu Duan, and Sucheta Soundarajan. 2017 · 2017
Later among the works it cites.
Nonparametric Bayesian inference of the microcanonical stochastic block model
Tiago P. Peixoto. 2017 · 2017
Later among the works it cites.
Core-Periphery Structure in Networks (Revisited)
Puck Rombach, Mason A. Porter, James H. Fowler, and Peter J. Mucha. 2017 · 2017
Later among the works it cites.
Community Detection and Stochastic Block Models: Recent Developments
Emmanuel Abbe. 2018 · 2018
Later among the works it cites.
Three hypergraph eigenvector centralities
Austin R Benson. 2018 · 2018
Later among the works it cites.
Simplicial closure and higher-order link prediction
Austin R. Benson, Rediet Abebe, Michael T. Schaub, Ali Jadbabaie, and Jon Kleinberg. 2018 · 2018
Later among the works it cites.
Austin R Benson and Jon Kleinberg. 2018a · 2018
Later among the works it cites.
On Rich Clubs of Path-Based Centralities in Networks. In CIKM
Soumya Sarkar, Sanjukta Bhowmick, and Animesh Mukherjee. 2018 · 2018
Later among the works it cites.