Fetching the paper…
Reading the bibliography…
Random graphs with latent geometric structure are popular models of social and biological networks, with applications ranging from network user profiling to circuit design.
Some applications of the stein-chen method for proving poisson convergence
AD Barbour and Lars Holst · 1989
Earlier work this paper cites.
On random intersection graphs: The subgraph problem
Michał Karoński, Edward R Scheinerman, and Karen B Singer-Cohen · 1999
Earlier work this paper cites.
On choosing and bounding probability metrics
Alison L Gibbs and Francis Edward Su · 2002
Earlier work this paper cites.
Latent space approaches to social network analysis
Peter D Hoff, Adrian E Raftery, and Mark S Handcock · 2002
Earlier work this paper cites.
Two models of random intersection graphs for classification
Erhard Godehardt and Jerzy Jaworski · 2003
Earlier work this paper cites.
Random geometric graphs
Mathew Penrose · 2003
Earlier work this paper cites.
The vertex degree distribution of random intersection graphs
Dudley Stark · 2004
Earlier work this paper cites.
Random graphs for statistical pattern recognition
David J Marchette · 2005
Earlier work this paper cites.
Topology control in wireless ad hoc and sensor networks
Paolo Santi · 2005
Earlier work this paper cites.
Randomized gossip algorithms
Stephen Boyd, Arpita Ghosh, Balaji Prabhakar, and Devavrat Shah · 2006
Earlier work this paper cites.
The degree of a typical vertex in generalized random intersection graph models
Jerzy Jaworski, Michał Karoński, and Dudley Stark · 2006
Earlier work this paper cites.
Tail-sensitive gaussian asymptotics for marginals of concentrated measures in high dimension
Sasha Sodin · 2007
Earlier work this paper cites.
Epidemics on random graphs with tunable clustering
Tom Britton, Maria Deijfen, Andreas N Lagerås, and Mathias Lindholm · 2008
Earlier work this paper cites.
Large independent sets in general random intersection graphs
S Nikoletseas, Christoforos Raptopoulos, and P Spirakis · 2008
Earlier work this paper cites.
On the random graph induced by a random key predistribution scheme under full visibility
Osman Yagan and Armand M Makowski · 2008
Earlier work this paper cites.
Connectivity of the uniform random intersection graph
Simon R Blackburn and Stefanie Gerke · 2009
Earlier work this paper cites.
Component evolution in a secure wireless sensor network
Mindaugas Bloznelis, Jerzy Jaworski, and Katarzyna Rybarczyk · 2009
Earlier work this paper cites.
Stochastic geometry and random graphs for the analysis and design of wireless networks
Martin Haenggi, Jeffrey G Andrews, François Baccelli, Olivier Dousse, and Massimo Franceschetti · 2009
Earlier work this paper cites.
Asymptotic equivalence and contiguity of some random graphs
Svante Janson · 2010
Earlier work this paper cites.
High-dimensional random geometric graphs and their clique number
Luc Devroye, András György, Gábor Lugosi, and Frederic Udina · 2011
Cited alongside, same era.
Sampling-based algorithms for optimal motion planning
Sertac Karaman and Emilio Frazzoli · 2011
Cited alongside, same era.
Diameter, connectivity, and phase transition of the uniform random intersection graph
Katarzyna Rybarczyk · 2011
Cited alongside, same era.
Equivalence of a random intersection graph and g (n, p)
Katarzyna Rybarczyk · 2011
Cited alongside, same era.
Sharp threshold functions for random intersection graphs via a coupling method
Katarzyna Rybarczyk · 2011
Cited alongside, same era.
Degree and clustering coefficient in sparse random intersection graphs
Mindaugas Bloznelis · 2013
Cited alongside, same era.
Information and dimensionality of anisotropic random geometric graphs
Ronen Eldan and Dan Mikulincer · 2016
Later among the works it cites.
Introduction to random graphs
Alan Frieze and Michał Karoński · 2016
Later among the works it cites.
Birthday inequalities, repulsion, and hard spheres
Will Perkins · 2016
Later among the works it cites.
Large cliques in sparse random intersection graphs
Mindaugas Bloznelis and Valentas Kurauskas · 2017
Later among the works it cites.
Concentration of measure without independence: a unified approach via the martingale method
Aryeh Kontorovich and Maxim Raginsky · 2017
Later among the works it cites.
Basic models and questions in statistical network analysis
Miklós Z Rácz and Sébastien Bubeck · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Complexity theoretic lower bounds for sparse principal component detection
Quentin Berthet and Philippe Rigollet · 2013
Cited alongside, same era.
Optimal detection of sparse principal components in high dimension
Quentin Berthet and Philippe Rigollet · 2013
Cited alongside, same era.
Epidemics on random intersection graphs
Frank G Ball, David J Sirl, and Pieter Trapman · 2014
Cited alongside, same era.
Detecting positive correlations in a multivariate sample
Ery Arias-Castro, Sébastien Bubeck, and Gábor Lugosi · 2015
Cited alongside, same era.
Community detection in general stochastic block models: Fundamental limits and efficient algorithms for recovery
Emmanuel Abbe and Colin Sandon · 2015
Cited alongside, same era.
Recent progress in complex network analysis: models of random intersection graphs
Mindaugas Bloznelis, Erhard Godehardt, Jerzy Jaworski, Valentas Kurauskas, and Katarzyna Rybarczyk · 2015
Cited alongside, same era.
Later among the works it cites.
Reducibility and computational lower bounds for problems with planted sparse structure
Matthew Brennan, Guy Bresler, and Wasim Huleihel · 2018
Later among the works it cites.
Optimal single sample tests for structured versus unstructured network data
Guy Bresler and Dheeraj Nagaraj · 2018
Later among the works it cites.
On the total variation distance between the binomial random graph and the random intersection graph
Jeong Han Kim, Sang June Lee, and Joohan Na · 2018
Later among the works it cites.
Asymptotic behavior of large gaussian correlated wishart matrices
Ivan Nourdin and Guangqu Zheng · 2018
Later among the works it cites.
Statistical problems with planted structures: Information-theoretical and computational limits
Yihong Wu and Jiaming Xu · 2018
Later among the works it cites.
Average-case lower bounds for learning sparse mixtures, robust estimation and semirandom adversaries
Matthew Brennan and Guy Bresler · 2019
Closest in time.
Optimal average-case reductions to sparse pca: From weak assumptions to strong hardness
Matthew Brennan and Guy Bresler · 2019
Closest in time.
Universality of computational lower bounds for submatrix detection
Matthew Brennan, Guy Bresler, and Wasim Huleihel · 2019
Closest in time.
When random intersection graphs lose geometry
Sébastian Bubeck, Miklós Z Rácz, and Jacob Richey · 2019
Closest in time.
The middle-scale asymptotics of wishart matrices
Didier Chételat and Martin T Wells · 2019
Closest in time.
Poisson fluctuations for edge counts in high-dimensional random geometric graphs
Jens Grygierek · 2019
Closest in time.
A smooth transition from wishart to goe
Miklós Z Rácz and Jacob Richey · 2019
Closest in time.
Reducibility and statistical-computational gaps from secret leakage
Matthew Brennan and Guy Bresler · 2020
Closest in time.