Generative Graph Models based on Laplacian Spectra?
暂无分享,去创建一个
[1] Ilse C. F. Ipsen,et al. Relative perturbation techniques for singular value problems , 1995 .
[2] M. Newman,et al. Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.
[3] M. Newman,et al. Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.
[4] M. Fiedler. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .
[5] F. Radicchi,et al. Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.
[6] Ove Frank,et al. http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained , 2007 .
[7] R. Merris. Large families of laplacian isospectral graphs , 1997 .
[8] Richard C. Wilson,et al. Parts based generative models for graphs , 2008, 2008 19th International Conference on Pattern Recognition.
[9] M E J Newman,et al. Random graphs with clustering. , 2009, Physical review letters.
[10] Christos Faloutsos,et al. Graph evolution: Densification and shrinking diameters , 2006, TKDD.
[11] B. McKay,et al. Constructing cospectral graphs , 1982 .
[12] Béla Bollobás,et al. Random Graphs , 1985 .
[13] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[14] Chiara Orsini,et al. Quantifying randomness in real networks , 2015, Nature Communications.
[15] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[16] F. Chung,et al. Spectra of random graphs with given expected degrees , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[17] Steve Butler,et al. A Construction of Cospectral Graphs for the Normalized Laplacian , 2010, Electron. J. Comb..
[18] Edwin R. Hancock,et al. A Spectral Generative Model for Graph Structure , 2006, SSPR/SPR.
[19] Marek Chrobak,et al. Reducing Large Internet Topologies for Faster Simulations , 2005, NETWORKING.
[20] Nicola De Cao,et al. MolGAN: An implicit generative model for small molecular graphs , 2018, ArXiv.
[21] Garry Robins,et al. An introduction to exponential random graph (p*) models for social networks , 2007, Soc. Networks.
[22] Fan Chung Graham,et al. On the Spectra of General Random Graphs , 2011, Electron. J. Comb..
[23] Edward A. Bender,et al. The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.
[24] Richard C. Wilson,et al. Spectral Generative Models for Graphs , 2007, 14th International Conference on Image Analysis and Processing (ICIAP 2007).
[25] M. Fiedler. Algebraic connectivity of graphs , 1973 .
[26] Michalis Faloutsos,et al. Eigen-Optimization on Large Graphs by Edge Manipulation , 2016, ACM Trans. Knowl. Discov. Data.
[27] Stephan Günnemann,et al. NetGAN: Generating Graphs via Random Walks , 2018, ICML.
[28] Stephen J. Wright,et al. Numerical Optimization , 2018, Fundamental Statistical Inference.
[29] Philip S. Yu,et al. A Comprehensive Survey on Graph Neural Networks , 2019, IEEE Transactions on Neural Networks and Learning Systems.
[30] Bruce A. Reed,et al. A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.
[31] Kathryn B. Laskey,et al. Stochastic blockmodels: First steps , 1983 .
[32] Mark E. J. Newman,et al. Stochastic blockmodels and community structure in networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.
[33] Alan Edelman,et al. The Geometry of Algorithms with Orthogonality Constraints , 1998, SIAM J. Matrix Anal. Appl..
[34] Fan Chung,et al. Spectral Graph Theory , 1996 .
[35] Tosio Kato. Variation of discrete spectra , 1987 .
[36] Ilya Safro,et al. Generating realistic scaled complex networks , 2016, Applied Network Science.
[37] Razvan Pascanu,et al. Learning Deep Generative Models of Graphs , 2018, ICLR 2018.
[38] Dustin G. Mixon,et al. Constructing all self-adjoint matrices with prescribed spectrum and diagonal , 2011, Advances in Computational Mathematics.
[39] Minas Gjoka,et al. 2.5K-graphs: From sampling to generation , 2012, 2013 Proceedings IEEE INFOCOM.
[40] Thomas J. Laffey,et al. Construction of nonnegative symmetric matrices with given spectrum , 2007 .
[41] Athina Markopoulou,et al. Spectral Graph Forge: Graph Generation Targeting Modularity , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications.
[42] Wotao Yin,et al. A feasible method for optimization with orthogonality constraints , 2013, Math. Program..
[43] M. Fiedler. Eigenvalues of Nonnegative Symmetric Matrices , 1974 .
[44] Robert E. Mahony,et al. Optimization Algorithms on Matrix Manifolds , 2007 .
[45] Jérôme Malick,et al. Projection-like Retractions on Matrix Manifolds , 2012, SIAM J. Optim..
[46] G. Golub,et al. Inverse Eigenvalue Problems: Theory, Algorithms, and Applications , 2005 .
[47] U. Feige,et al. Spectral Graph Theory , 2015 .
[48] Yuchung J. Wang,et al. Stochastic Blockmodels for Directed Graphs , 1987 .
[49] Rok Sosic,et al. SNAP , 2016, ACM Trans. Intell. Syst. Technol..
[50] Rajiv Gandhi,et al. Dependent rounding and its applications to approximation algorithms , 2006, JACM.
[51] Amin Saberi,et al. On the spread of viruses on the internet , 2005, SODA '05.
[52] Christos Faloutsos,et al. Kronecker Graphs: An Approach to Modeling Networks , 2008, J. Mach. Learn. Res..
[53] Linyuan Lu,et al. Random graphs with given expected degrees , 2006 .
[54] Luca Trevisan,et al. Multi-way spectral partitioning and higher-order cheeger inequalities , 2011, STOC '12.
[55] Marek Chrobak,et al. Sampling large Internet topologies for simulation purposes , 2007, Comput. Networks.
[56] Alberto Borobia,et al. The real nonnegative inverse eigenvalue problem is NP-hard , 2016, ArXiv.
[57] Jure Leskovec,et al. GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models , 2018, ICML.