Graph limits and exchangeable random graphs
From MaRDI portal
Publication:3597136
zbMath1162.60009arXiv0712.2749MaRDI QIDQ3597136
Publication date: 9 February 2009
Full work available at URL: https://arxiv.org/abs/0712.2749
Random graphs (graph-theoretic aspects) (05C80) Graph representations (geometric and intersection representations, etc.) (05C62) Exchangeability for stochastic processes (60G09)
Related Items
Cut distance identifying graphon parameters over weak* limits, A note on Fokker-Planck equations and graphons, Sharp total variation bounds for finitely exchangeable arrays, Edgeworth expansions for network moments, A limit theorem for scaled eigenvectors of random dot product graphs, A representation of exchangeable hierarchies by sampling from random real trees, Time evolution of dense multigraph limits under edge-conservative preferential attachment dynamics, Motif-based tests for bipartite networks, On edge exchangeable random graphs, Random Simplicial Complexes: Models and Phenomena, On convergence for graphexes, Graphons and renormalization of large Feynman diagrams, Cut norm discontinuity of triangular truncation of graphons, Asymptotic behavior of common connections in sparse random networks, Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models, Hypergraph limits: A regularity approach, Generating hierarchial scale-free graphs from fractals, Consistency under sampling of exponential random graph models, Relative exchangeability with equivalence relations, Multivariate Hawkes processes on inhomogeneous random graphs, Maximum likelihood estimation in the \(\beta\)-model, Universally consistent vertex classification for latent positions graphs, Limits of discrete distributions and Gibbs measures on random graphs, A graphon counter example, Impartial digraphs, General erased-word processes: product-type filtrations, ergodic laws and Martin boundaries, Decomposition of tournament limits, RELATIVELY EXCHANGEABLE STRUCTURES, Rates of convergence for multivariate normal approximation with applications to dense graphs and doubly indexed permutation statistics, σ-algebras for quasirandom hypergraphs, A measure theoretic perspective on the space of Feynman diagrams, Subsampling bootstrap of count features of networks, From quasirandom graphs to graph limits and graphlets, On a question of Vera T. Sós about size forcing of graphons, Poisson approximation of subgraph counts in stochastic block models and a graphon model, Invariant measures via inverse limits of finite structures, Graph limits and hereditary properties, On finite exchangeability and conditional independence, Multigraph limits and exchangeability, Replica symmetry breaking without replicas, A nonparametric view of network models and Newman–Girvan and other modularities, Poset limits and exchangeable random posets, Sparse Graphs Using Exchangeable Random Measures, Interval graph limits, Random graphs with a given degree sequence, Estimating and understanding exponential random graph models, On String Graph Limits and the Structure of a Typical String Graph, Limit of a nonpreferential attachment multitype network model, Multigraph limit of the dense configuration model and the preferential attachment graph, The large deviation principle for the Erdős-Rényi random graph, Quasi-random graphs and graph limits, A general framework for Bayes structured linear models, Bootstrap estimators for the tail-index and for the count statistics of graphex processes, Co-clustering separately exchangeable network data, Relating the cut distance and the weak* topology for graphons, Exponential-family models of random graphs: inference in finite, super and infinite population scenarios, The method of moments and degree distributions for network models, Sparse random graphs with clustering, Bethe states of random factor graphs, On the maximum density of fixed strongly connected subtournaments, Graphon-valued stochastic processes from population genetics, An analytic approach to sparse hypergraphs: hypergraph removal, Unnamed Item, Combinatorial Lévy processes, Limits of \(k\)-dimensional poset sequences, Sparse exchangeable graphs and their limits via graphon processes, Sparse maximum-entropy random graphs with a given power-law degree distribution, Computable Exchangeable Sequences Have Computable de Finetti Measures, Spin systems on Bethe lattices, Quantum invariant families of matrices in free probability, Limits of structures and the example of tree semi-lattices, An analytic approach to stability, Sampling perspectives on sparse exchangeable graphs, Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing, On estimation and inference in latent structure random graphs, The geometry of continuous latent space models for network data, Limit theorems for eigenvectors of the normalized Laplacian for random graphs, On the typical structure of graphs in a monotone property, Rate-optimal graphon estimation, Consistent nonparametric estimation for heavy-tailed sparse graphs, Bayesian consensus clustering in multiplex networks, Goodness of Fit of Logistic Regression Models for Random Graphs, An introduction to large deviations for random graphs, Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits, Optimal graphon estimation in cut distance, Computable de Finetti measures, Limits of sparse configuration models and beyond: graphexes and multigraphexes, Higher-order fluctuations in dense random graph models, The Cut Metric for Probability Distributions, A generalization of hierarchical exchangeability on trees to directed acyclic graphs, On coprime percolation, the visibility graphon, and the local limit of the GCD profile, Exchangeable interval hypergraphs and limits of ordered discrete structures, Limit theorems for distributions invariant under groups of transformations, A conversation with David J. Aldous, Matrix estimation by universal singular value thresholding, Cycles of a given length in tournaments, Linear embeddings of graphs and graph limits, Differential calculus on graphon space, No additional tournaments are quasirandom-forcing, Another conversation with Persi Diaconis, Tree limits and limits of random trees, Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming, Iterative Collaborative Filtering for Sparse Matrix Estimation, Testing for Equivalence of Network Distribution Using Subgraph Counts, Exchangeable and sampling-consistent distributions on rooted binary trees, Concentration estimates for functions of finite high‐dimensional random arrays, Projective families of distributions revisited, Graphon convergence of random cographs, Random cographs: Brownian graphon limit and asymptotic degree distribution, Inference for High-Dimensional Exchangeable Arrays, Mixture models and networks: The stochastic blockmodel, Nilspace Factors for General Uniformity Seminorms, Cubic Exchangeability and Limits, A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth, Dense multigraphon-valued stochastic processes and edge-changing dynamics in the configuration model, Localization in 1D non-parametric latent space models from pairwise affinities, Projective, sparse and learnable latent position network models, On sparsity, power-law, and clustering properties of graphex processes, Weakly interacting oscillators on dense random graphs, Kernel density estimation for undirected dyadic data, Theory of graph neural networks: representation and learning, Classification on Large Networks: A Quantitative Bound via Motifs and Graphons (Research), Semantic limits of dense combinatorial objects, Random Walks on Dense Graphs and Graphons, Unnamed Item, The cut metric, random graphs, and branching processes, Unnamed Item, Book Review: Probabilistic symmetries and invariance principles, Poset limits can be totally ordered, Harmonic analysis of symmetric random graphs, On the Density of Transitive Tournaments
