Sparse graphs using exchangeable random measures
暂无分享,去创建一个
[1] Remco van der Hofstad,et al. Random Graphs and Complex Networks , 2016, Cambridge Series in Statistical and Probabilistic Mathematics.
[2] Kathryn B. Laskey,et al. Stochastic blockmodels: First steps , 1983 .
[3] Fabrizio Leisen,et al. Vectors of two-parameter Poisson-Dirichlet processes , 2011, J. Multivar. Anal..
[4] Ernesto Estrada. Quantifying network heterogeneity. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.
[5] Prabhanjan Kambadur,et al. Inference for Large Tree-structured Data , 2014, 1404.2910.
[6] László Lovász,et al. Limits of dense graph sequences , 2004, J. Comb. Theory B.
[7] S. Resnick. Extreme Values, Regular Variation, and Point Processes , 1987 .
[8] J. Koster,et al. Markov properties of nonrecursive causal models , 1996 .
[9] C. Nickel. RANDOM DOT PRODUCT GRAPHS A MODEL FOR SOCIAL NETWORKS , 2008 .
[10] M. Newman,et al. Statistical mechanics of networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[11] François Caron. Bayesian nonparametric models for bipartite graphs , 2012, NIPS.
[12] M. Bálek,et al. Large Networks and Graph Limits , 2022 .
[13] Peter Sanders,et al. Fast Routing in Road Networks with Transit Nodes , 2007, Science.
[14] Daryl J. Daley,et al. An Introduction to the Theory of Point Processes , 2013 .
[15] Jon M. Kleinberg,et al. Subgraph frequencies: mapping the empirical and extremal geography of large graph collections , 2013, WWW.
[16] Aurélien Garivier,et al. On the Complexity of Best-Arm Identification in Multi-Armed Bandit Models , 2014, J. Mach. Learn. Res..
[17] Raffaele Argiento,et al. A blocked Gibbs sampler for NGG-mixture models via a priori truncation , 2016, Stat. Comput..
[18] D. Bu,et al. Topological structure analysis of the protein-protein interaction network in budding yeast. , 2003, Nucleic acids research.
[19] M. Newman,et al. The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.
[20] F. Chung,et al. The average distances in random graphs with given expected degrees , 2002, Proceedings of the National Academy of Sciences of the United States of America.
[21] A. Brix. Generalized Gamma measures and shot-noise Cox processes , 1999, Advances in Applied Probability.
[22] Jaroslav Nesetril,et al. Sparsity - Graphs, Structures, and Algorithms , 2012, Algorithms and combinatorics.
[23] R. Durrett. Random Graph Dynamics: References , 2006 .
[24] École d'été de probabilités de Saint-Flour,et al. École d'été de probabilités de Saint-Flour XIII - 1983 , 1985 .
[25] Michel A. Picardo,et al. GABAergic Hub Neurons Orchestrate Synchrony in Developing Hippocampal Networks , 2009, Science.
[26] S. Lauritzen. Exchangeable Rasch Matrices∗ , 2007 .
[27] Arnaud Doucet,et al. Efficient Bayesian Inference for Generalized Bradley–Terry Models , 2010, 1011.1761.
[28] Ginestra Bianconi,et al. Gibbs entropy of network ensembles by cavity methods. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.
[29] Yee Whye Teh,et al. Variational Inference for the Indian Buffet Process , 2009, AISTATS.
[30] G. A. Whitmore,et al. STOCHASTIC PROCESSES DIRECTED BY RANDOMIZED TIME , 1993 .
[31] Jorge Mateu,et al. Analysing Multivariate Spatial Point Processes with Continuous Marks: A Graphical Modelling Approach , 2018, International Statistical Review.
[32] Mikkel N. Schmidt,et al. Completely random measures for modelling block-structured networks , 2015, 1507.02925.
[33] Albert-László Barabási,et al. Internet: Diameter of the World-Wide Web , 1999, Nature.
[34] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[35] Jure Leskovec,et al. Multiplicative Attribute Graph Model of Real-World Networks , 2010, Internet Math..
[36] E. Giné,et al. MARCINKIEWICZ TYPE LAWS OF LARGE NUMBERS AND CONVERGENCE OF MOMENTS FOR U-STATISTICS , 1992 .
[37] Mark E. J. Newman,et al. Stochastic blockmodels and community structure in networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.
[38] David Firth,et al. Statistical modelling of citation exchange between statistics journals , 2013, Journal of the Royal Statistical Society. Series A,.
[39] J. Pitman. Some developments of the Blackwell-MacQueen urn scheme , 1996 .
[40] Béla Bollobás,et al. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..
[41] Ulrike von Luxburg,et al. A tutorial on spectral clustering , 2007, Stat. Comput..
[42] Yufei Zhao,et al. An $L^p$ theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions , 2014, Transactions of the American Mathematical Society.
[43] Alessandro Vespignani,et al. Reaction–diffusion processes and metapopulation models in heterogeneous networks , 2007, cond-mat/0703129.
[44] J. Kingman,et al. Completely random measures. , 1967 .
[45] Jean Bertoin,et al. Random fragmentation and coagulation processes , 2006 .
[46] P. Wolfe,et al. Nonparametric graphon estimation , 2013, 1309.5936.
[47] Mark E. J. Newman,et al. The Structure and Function of Complex Networks , 2003, SIAM Rev..
[48] Remco van der Hofstad,et al. Random Graphs and Complex Networks: Volume 1 , 2016 .
[49] Mathieu Bastian,et al. Gephi: An Open Source Software for Exploring and Manipulating Networks , 2009, ICWSM.
[50] S. N. Dorogovtsev,et al. Evolution of networks , 2001, cond-mat/0106144.
[51] Y. Teh,et al. MCMC for Normalized Random Measure Mixture Models , 2013, 1310.0595.
[52] P. Bickel,et al. The method of moments and degree distributions for network models , 2011, 1202.5101.
[53] S. Duane,et al. Hybrid Monte Carlo , 1987 .
[54] Ginestra Bianconi,et al. Scale-free networks with an exponent less than two. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.
[55] David Aldous,et al. Brownian excursions, critical random graphs and the multiplicative coalescent , 1997 .
[56] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[57] Peter D. Hoff,et al. Multiplicative latent factor models for description and prediction of social networks , 2009, Comput. Math. Organ. Theory.
[58] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[59] W. Dempsey,et al. A framework for statistical network modeling , 2015, 1509.08185.
[60] Edoardo M. Airoldi,et al. A Survey of Statistical Network Models , 2009, Found. Trends Mach. Learn..
[61] SVANTE JANSON,et al. GRAPHONS AND CUT METRIC ON σ-FINITE MEASURE SPACES , 2016 .
[62] A. Lijoi,et al. Distributional results for means of normalized random measures with independent increments , 2003 .
[63] David Gamarnik,et al. Convergent sequences of sparse graphs: A large deviations approach , 2013, Random Struct. Algorithms.
[64] Tamara Broderick,et al. Truncated random measures , 2016, Bernoulli.
[65] Emily B. Fox. Sparse graphs using exchangeable random measures by François Caron and , 2017 .
[66] Persi Diaconis,et al. de Finetti Priors using Markov chain Monte Carlo computations , 2015, Stat. Comput..
[67] Sergey Brin,et al. The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.
[68] Yuan Ji,et al. Reciprocal Graphical Models for Integrative Gene Regulatory Network Analysis , 2016, Bayesian Analysis.
[69] Derek de Solla Price,et al. A general theory of bibliometric and other cumulative advantage processes , 1976, J. Am. Soc. Inf. Sci..
[70] E. Giné,et al. On the Bootstrap of $U$ and $V$ Statistics , 1992 .
[71] Odd O. Aalen,et al. Modelling Heterogeneity in Survival Analysis by the Compound Poisson Distribution , 1992 .
[72] J. Michael Steele,et al. The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence , 2004 .
[73] Eric D. Kolaczyk,et al. Statistical Analysis of Network Data , 2009 .
[74] O. Kallenberg. Probabilistic Symmetries and Invariance Principles , 2005 .
[75] Esko Valkeila,et al. An Introduction to the Theory of Point Processes, Volume II: General Theory and Structure, 2nd Edition by Daryl J. Daley, David Vere‐Jones , 2008 .
[76] Jure Leskovec,et al. Learning to Discover Social Circles in Ego Networks , 2012, NIPS.
[77] S. Karlin. Central Limit Theorems for Certain Infinite Urn Schemes , 1967 .
[78] Christian Borgs,et al. An $L^{p}$ theory of sparse graph convergence II: LD convergence, quotients and right convergence , 2014, 1408.0744.
[79] Patrick J. Wolfe,et al. Co-clustering separately exchangeable network data , 2012, ArXiv.
[80] Daniele Durante,et al. Nonparametric Bayes Modeling of Populations of Networks , 2014, 1406.7851.
[81] Emily B. Fox,et al. Bayesian nonparametric models of sparse and exchangeable random graphs , 2014, ArXiv.
[82] Jonas Kahn,et al. Improper poisson line process as sirsn in any dimension , 2015, 1503.03976.
[83] J. Pitman,et al. Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws ∗ , 2007, math/0701718.
[84] 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).
[85] Stephen E. Fienberg,et al. A Brief History of Statistical Models for Network Analysis and Open Challenges , 2012 .
[86] A. Lijoi,et al. Models Beyond the Dirichlet Process , 2009 .
[87] Martin G. Everett,et al. A Graph-theoretic perspective on centrality , 2006, Soc. Networks.
[88] B. De Finetti,et al. Funzione caratteristica di un fenomeno aleatorio , 1929 .
[89] David Aldous,et al. The Continuum Random Tree III , 1991 .
[90] David J. Marchette,et al. Random Graphs for Statistical Pattern Recognition: Marchette/Statistical Pattern Recognition , 2004 .
[91] Michael I. Jordan,et al. Variational inference for Dirichlet process mixtures , 2006 .
[92] Svante Janson. PROBABILITY ASYMPTOTICS: NOTES ON NOTATION , 2009 .
[93] Wilfrid S. Kendall,et al. From random lines to metric spaces , 2014, 1403.1156.
[94] A. Martin-Löf,et al. Generating Simple Random Graphs with Prescribed Degree Distribution , 2006, 1509.06985.
[95] L. Tardella,et al. Approximating distributions of random functionals of Ferguson‐Dirichlet priors , 1998 .
[96] Hans Bühlmann,et al. Austauschbare stochastische Variabeln und ihre Grenzwertsätze , 1960 .
[97] A. Gelfand,et al. The Nested Dirichlet Process , 2008 .
[98] Mark E. J. Newman,et al. Power-Law Distributions in Empirical Data , 2007, SIAM Rev..
[99] Lancelot F. James,et al. Posterior Analysis for Normalized Random Measures with Independent Increments , 2009 .
[100] William L. Seaver,et al. Random Graphs for Statistical Pattern Recognition , 2005, Technometrics.
[101] Luc Devroye,et al. Random variate generation for exponentially and polynomially tilted stable distributions , 2009, TOMC.
[102] S. Redner,et al. Structural Transitions in Densifying Networks. , 2016, Physical review letters.
[103] Béla Bollobás,et al. Random Graphs: Notation , 2001 .
[104] P. Bickel,et al. A nonparametric view of network models and Newman–Girvan and other modularities , 2009, Proceedings of the National Academy of Sciences.
[105] D. Freedman. De Finetti's theorem in continuous time , 1996 .
[106] Thilo Gross,et al. All scale-free networks are sparse. , 2011, Physical review letters.
[107] O. Kallenberg. Exchangeable random measures in the plane , 1990 .
[108] D. Aldous. Representations for partially exchangeable arrays of random variables , 1981 .
[109] J. Griffin,et al. Compound random measures and their use in Bayesian non‐parametrics , 2014, 1410.0611.
[110] J. Pitman. Exchangeable and partially exchangeable random partitions , 1995 .
[111] J. Mateu,et al. Analysing highly complex and highly structured point patterns in space , 2017 .
[112] D. Blackwell,et al. Ferguson Distributions Via Polya Urn Schemes , 1973 .
[113] Lancelot F. James,et al. Poisson Process Partition Calculus with Applications to Exchangeable Models and Bayesian Nonparametrics , 2002 .
[114] Daniel M. Roy,et al. Sampling and Estimation for (Sparse) Exchangeable Graphs , 2016, The Annals of Statistics.
[115] Jorge Mateu,et al. Point Patterns Occurring on Complex Structures in Space and Space-Time: An Alternative Network Approach , 2016, 1607.06288.
[116] Edoardo M. Airoldi,et al. Mixed Membership Stochastic Blockmodels , 2007, NIPS.
[117] Morten Mørup,et al. Completely random measures for modelling block-structured sparse networks , 2016, NIPS.
[118] Daniel M. Roy,et al. The Class of Random Graphs Arising from Exchangeable Random Measures , 2015, ArXiv.
[119] M. Steel,et al. Comparing distributions by using dependent normalized random‐measure mixtures , 2013 .
[120] R. E. Amritkar,et al. Extreme events on complex networks , 2011, Physical review letters.
[121] Tore Opsahl,et al. Clustering in weighted networks , 2009, Soc. Networks.
[122] Klaus Nordhausen,et al. Statistical Analysis of Network Data with R , 2015 .
[123] Antonio Lijoi,et al. On a normalized random measure with independent increments relevant to Bayesian nonparametric inference , 2003 .
[124] P. Hougaard. Survival models for heterogeneous populations derived from stable distributions , 1986 .
[125] J. Pitman. Poisson-Kingman partitions , 2002, math/0210396.
[126] D. Aldous. Exchangeability and related topics , 1985 .
[127] Edoardo M. Airoldi,et al. Stochastic blockmodel approximation of a graphon: Theory and consistent estimation , 2013, NIPS.
[128] J. Dall,et al. Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[129] Zoubin Ghahramani,et al. Random function priors for exchangeable arrays with applications to graphs and relational data , 2012, NIPS.
[130] Mingyuan Zhou,et al. Infinite Edge Partition Models for Overlapping Community Detection and Link Prediction , 2015, AISTATS.
[131] Audrey Lee-St. John,et al. Pebble game algorithms and sparse graphs , 2007, Discret. Math..
[132] B. Bollobás,et al. Metrics for sparse graphs , 2007, 0708.1919.
[133] Matthew Crosby,et al. Association for the Advancement of Artificial Intelligence , 2014 .
[134] Mark Newman,et al. Networks: An Introduction , 2010 .
[135] Ginestra Bianconi,et al. Entropy measures for networks: toward an information theory of complex topologies. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.
[136] D. Aldous,et al. True scale-invariant random spatial networks , 2012, Proceedings of the National Academy of Sciences.
[137] Panos M. Pardalos,et al. Statistical analysis of financial networks , 2005, Comput. Stat. Data Anal..
[138] Aaron Clauset,et al. A unified view of generative models for networks: models, methods, opportunities, and challenges , 2014, ArXiv.
[139] Lada A. Adamic,et al. The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.
[140] Sinead Williamson,et al. Nonparametric Network Models for Link Prediction , 2016, J. Mach. Learn. Res..
[141] C. Borgs,et al. Moments of Two-Variable Functions and the Uniqueness of Graph Limits , 2008, 0803.1244.
[142] Tianqi Chen,et al. Stochastic Gradient Hamiltonian Monte Carlo , 2014, ICML.
[143] S. Janson. On convergence for graphexes , 2017, 1702.06389.
[144] I. C. Gormley,et al. Analysis of Irish third‐level college applications data , 2006 .
[145] Christian Borgs,et al. Private Graphon Estimation for Sparse Graphs , 2015, NIPS.
[146] T. Ferguson,et al. A Representation of Independent Increment Processes without Gaussian Components , 1972 .
[147] Thomas L. Griffiths,et al. Nonparametric Latent Feature Models for Link Prediction , 2009, NIPS.
[148] R. L. Smith. EXTREME VALUES, POINT PROCESSES AND REGULAR VARIATION (Applied Probability 4) , 1988 .
[149] Patrick J. Wolfe,et al. Degree-based network models , 2012, 1211.6537.
[150] Andrew Gelman,et al. General methods for monitoring convergence of iterative simulations , 1998 .
[151] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .
[152] Ernesto Estrada,et al. Communicability graph and community structures in complex networks , 2009, Appl. Math. Comput..
[153] David Aldous. Scale-invariant random spatial networks , 2014 .
[154] Chao Gao,et al. Testing Network Structure Using Relations Between Small Subgraph Probabilities , 2017, ArXiv.
[155] T. Snijders,et al. Estimation and Prediction for Stochastic Blockstructures , 2001 .
[156] Béla Bollobás,et al. The phase transition in inhomogeneous random graphs , 2007, Random Struct. Algorithms.
[157] Antonio Lijoi,et al. A Bayesian Nonparametric Approach for Comparing Clustering Structures in EST Libraries , 2008, J. Comput. Biol..
[158] Ji Zhu,et al. Consistency of community detection in networks under degree-corrected stochastic block models , 2011, 1110.3854.
[159] John K Kruschke,et al. Bayesian data analysis. , 2010, Wiley interdisciplinary reviews. Cognitive science.
[160] S. Janson. On Edge Exchangeable Random Graphs , 2017, Journal of statistical physics.
[161] Ulrike Goldschmidt,et al. An Introduction To The Theory Of Point Processes , 2016 .
[162] J. Pitman. Combinatorial Stochastic Processes , 2006 .
[163] E. Maasoumi,et al. A Dependence Metric for Possibly Nonlinear Processes , 2004 .
[164] Marius Hofert,et al. Sampling Exponentially Tilted Stable Distributions , 2011, TOMC.
[165] Bin Yu,et al. Spectral clustering and the high-dimensional stochastic blockmodel , 2010, 1007.1684.
[166] S N Dorogovtsev,et al. Scale-free networks with exponent one. , 2016, Physical review. E.
[167] A. Doucet,et al. The Bouncy Particle Sampler: A Nonreversible Rejection-Free Markov Chain Monte Carlo Method , 2015, 1510.02451.
[168] Alexander Gnedin,et al. Asymptotic laws for compositions derived from transformed subordinators , 2006 .
[169] Lancelot F. James. Bayesian Poisson process partition calculus with an application to Bayesian Lévy moving averages , 2005, math/0508283.
[170] V. Sós,et al. GRAPH LIMITS AND EXCHANGEABLE RANDOM GRAPHS , 2008 .
[171] Trevor Campbell,et al. Edge-exchangeable graphs and sparsity , 2016, NIPS.
[172] G. Shedler,et al. Simulation of Nonhomogeneous Poisson Processes by Thinning , 1979 .
[173] Yosihiko Ogata,et al. On Lewis' simulation method for point processes , 1981, IEEE Trans. Inf. Theory.
[174] Tamara Broderick,et al. Exchangeable Trait Allocations , 2016, 1609.09147.
[175] M. Newman,et al. Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.
[176] Mikkel N. Schmidt,et al. Infinite-degree-corrected stochastic block model. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.
[177] Radford M. Neal. MCMC Using Hamiltonian Dynamics , 2011, 1206.1901.
[178] Yee Whye Teh,et al. Bayesian nonparametric Plackett-Luce models for the analysis of preferences for college degree programmes , 2015 .
[179] Lin Song,et al. Comparison of co-expression measures: mutual information, correlation, and model based indices , 2012, BMC Bioinformatics.
[180] Walter Dempsey,et al. Edge exchangeable models for network data , 2016, ArXiv.
[181] Ramsés H. Mena,et al. Controlling the reinforcement in Bayesian non‐parametric mixture models , 2007 .
[182] Ilkka Norros,et al. On a conditionally Poissonian graph process , 2006, Advances in Applied Probability.
[183] Zoubin Ghahramani,et al. An Infinite Latent Attribute Model for Network Data , 2012, ICML.
[184] Thomas L. Griffiths,et al. Learning Systems of Concepts with an Infinite Relational Model , 2006, AAAI.
[185] Paul J Laurienti,et al. Analyzing complex functional brain networks: Fusing statistics and network science to understand the brain*† , 2013, Statistics surveys.
[186] Cynthia Dwork,et al. Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.
[187] Amin Saberi,et al. Asymptotic behavior and distributional limits of preferential attachment graphs , 2014, 1401.2792.
[188] Daniel M. Roy,et al. Bayesian Models of Graphs, Arrays and Other Exchangeable Random Structures , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[189] Peter D. Hoff,et al. Latent Space Approaches to Social Network Analysis , 2002 .
[190] Ernesto Estrada,et al. Communicability in complex networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.
[191] S. Walker,et al. Investigating nonparametric priors with Gibbs structure , 2008 .
[192] Gábor Csárdi,et al. The igraph software package for complex network research , 2006 .
[193] Vitaly Shmatikov,et al. De-anonymizing Social Networks , 2009, 2009 30th IEEE Symposium on Security and Privacy.
[194] Christian Borgs,et al. Sparse Exchangeable Graphs and Their Limits via Graphon Processes , 2016, J. Mach. Learn. Res..
[195] I. Pruenster. Random probability measures derived from increasing additive processes and their application to Bayesian statistics. , 2003 .
[196] Priyantha Wijayatunga,et al. A geometric view on Pearson's correlation coefficient and a generalization of it to non-linear dependencies , 2016, 1804.07937.
[197] C. Priebe,et al. A Limit Theorem for Scaled Eigenvectors of Random Dot Product Graphs , 2013, Sankhya A.
[198] Edward R. Scheinerman,et al. Random Dot Product Graph Models for Social Networks , 2007, WAW.
[199] V. Sós,et al. Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing , 2007, math/0702004.