Random Clique Covers for Graphs with Local Density and Global Sparsity
暂无分享,去创建一个
[1] Kathryn B. Laskey,et al. Stochastic blockmodels: First steps , 1983 .
[2] Jure Leskovec,et al. Learning to Discover Social Circles in Ego Networks , 2012, NIPS.
[3] Michael I. Jordan,et al. Hierarchical Beta Processes and the Indian Buffet Process , 2007, AISTATS.
[4] Trevor Campbell,et al. Edge-exchangeable graphs and sparsity , 2016, NIPS.
[5] Christos Faloutsos,et al. Graph evolution: Densification and shrinking diameters , 2006, TKDD.
[6] Sinead Williamson,et al. Nonparametric Network Models for Link Prediction , 2016, J. Mach. Learn. Res..
[7] Daniel M. Roy,et al. Gibbs-type Indian Buffet Processes , 2015, Bayesian Analysis.
[8] Michael I. Jordan,et al. Beta Processes, Stick-Breaking and Power Laws , 2011, 1106.0539.
[9] J. Orlin. Contentment in graph theory: Covering graphs with cliques , 1977 .
[10] Alan M. Frieze,et al. A Geometric Preferential Attachment Model of Networks II , 2007, Internet Math..
[11] Adrien Todeschini,et al. Exchangeable random measures for sparse and modular graphs with overlapping communities , 2016, Journal of the Royal Statistical Society: Series B (Statistical Methodology).
[12] David Barber. Clique Matrices for Statistical Graph Decomposition and Parameterising Restricted Positive Definite Matrices , 2008, UAI.
[13] Christian Borgs,et al. Sparse Exchangeable Graphs and Their Limits via Graphon Processes , 2016, J. Mach. Learn. Res..
[14] Daniel M. Roy,et al. The Class of Random Graphs Arising from Exchangeable Random Measures , 2015, ArXiv.
[15] Y. Teh,et al. Indian Buffet Processes with Power-law Behavior , 2009, NIPS.
[16] Razvan Pascanu,et al. Learning Deep Generative Models of Graphs , 2018, ICLR 2018.
[17] Albert-László Barabási,et al. Statistical mechanics of complex networks , 2001, ArXiv.
[18] R. Hamelink. A partial characterization of clique graphs , 1968 .
[19] Jaroslav Nesetril,et al. Sparsity - Graphs, Structures, and Algorithms , 2012, Algorithms and combinatorics.
[20] Béla Bollobás,et al. Random Graphs , 1985 .
[21] Tamara G. Kolda,et al. The Similarity Between Stochastic Kronecker and Chung-Lu Graph Models , 2011, SDM.
[22] Chavdar Dangalchev,et al. Generation models for scale-free networks , 2004 .
[23] Eric P. Xing,et al. Restricting exchangeable nonparametric distributions , 2012, NIPS.
[24] Christos Faloutsos,et al. Kronecker Graphs: An Approach to Modeling Networks , 2008, J. Mach. Learn. Res..
[25] Yiming Yang,et al. Introducing the Enron Corpus , 2004, CEAS.
[26] Béla Bollobás,et al. Mathematical results on scale‐free random graphs , 2005 .
[27] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[28] Mark E. J. Newman,et al. Stochastic blockmodels and community structure in networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.
[29] Zoubin Ghahramani,et al. Random function priors for exchangeable arrays with applications to graphs and relational data , 2012, NIPS.
[30] J. Kingman,et al. Completely random measures. , 1967 .
[31] Alan M. Frieze,et al. Some Typical Properties of the Spatial Preferred Attachment Model , 2014, Internet Math..
[32] Yiming Yang,et al. The Enron Corpus: A New Dataset for Email Classi(cid:12)cation Research , 2004 .
[33] N. Hjort. Nonparametric Bayes Estimators Based on Beta Processes in Models for Life History Data , 1990 .
[34] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[35] P. Erdos,et al. On the evolution of random graphs , 1984 .
[36] Edoardo M. Airoldi,et al. Mixed Membership Stochastic Blockmodels , 2007, NIPS.
[37] W. Dempsey,et al. Edge Exchangeable Models for Interaction Networks , 2018, Journal of the American Statistical Association.
[38] Morten Mørup,et al. Completely random measures for modelling block-structured sparse networks , 2016, NIPS.
[39] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[40] Peter Morters,et al. Spatial preferential attachment networks: Power laws and clustering coefficients , 2012, 1210.3830.
[41] Peter Orbanz,et al. Random‐walk models of network formation and sequential Monte Carlo methods for graphs , 2016, Journal of the Royal Statistical Society: Series B (Statistical Methodology).
[42] Jure Leskovec,et al. GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models , 2018, ICML.
[43] Aric Hagberg,et al. Exploring Network Structure, Dynamics, and Function using NetworkX , 2008 .
[44] Stefan Bornholdt,et al. Handbook of Graphs and Networks: From the Genome to the Internet , 2003 .
[45] Nikos Komodakis,et al. GraphVAE: Towards Generation of Small Graphs Using Variational Autoencoders , 2018, ICANN.
[46] Zoran Utkovski,et al. Economic complexity unfolded: Interpretable model for the productive structure of economies , 2017, PloS one.
[47] Alan M. Frieze,et al. Some Typical Properties of the Spatial Preferred Attachment Model , 2012, Internet Math..
[48] Tamara G. Kolda,et al. Degree relations of triangles in real-world networks and graph models , 2012, CIKM.
[49] B. Bollobás. The evolution of random graphs , 1984 .
[50] Emily B. Fox,et al. Sparse graphs using exchangeable random measures , 2014, Journal of the Royal Statistical Society. Series B, Statistical methodology.
[51] M E J Newman,et al. Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.