Sparse Graphs Using Exchangeable Random Measures

DOI10.1111/rssb.12233zbMath1381.62072arXiv1401.1137OpenAlexW2963730104WikidataQ47130290 ScholiaQ47130290MaRDI QIDQ4603788

Emily B. Fox, François Caron

Publication date: 19 February 2018

Published in: Journal of the Royal Statistical Society Series B: Statistical Methodology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.1137

zbMATH Keywords

random graphspoint processexchangeabilityLévy measuregeneralized gamma processKallenberg representation

Mathematics Subject Classification ID

Characterization and structure theory for multivariate probability distributions; copulas (62H05) Applications of graph theory (05C90) General theory of stochastic processes (60G07)

Related Items

An improved algorithm for generalized community structure inference in complex networks, Compound Poisson models for weighted networks with applications in finance, On edge exchangeable random graphs, On convergence for graphexes, Rejoinder to the discussion of ``Bayesian graphical models for modern biological applications, Integrability conditions for compound random measures, Asymptotic behavior of common connections in sparse random networks, Exchangeable trait allocations, A hierarchical Bayesian model for predicting ecological interactions using scaled evolutionary relationships, Local 2-separators, Modularity Maximization for Graphons, Inference for High-Dimensional Exchangeable Arrays, Local exchangeability, A unified construction for series representations and finite approximations of completely random measures, Efficient Estimation for Random Dot Product Graphs via a One-Step Procedure, Hierarchical Network Models for Exchangeable Structured Interaction Processes, Bayesian learning of graph substructures, Truncated Poisson-Dirichlet approximation for Dirichlet process hierarchical models, Causal Inference for Social Network Data, A note on nonparametric inference for species variety with Gibbs-type priors, Exact simulation of Poisson-Dirichlet distribution and generalised gamma process, Projective, sparse and learnable latent position network models, On sparsity, power-law, and clustering properties of graphex processes, Graph theory. Abstracts from the workshop held January 2--8, 2022, Core-periphery structure in networks: a statistical exposition, Sufficientness postulates for Gibbs-type priors and hierarchical generalizations, Bootstrap estimators for the tail-index and for the count statistics of graphex processes, Exponential-family models of random graphs: inference in finite, super and infinite population scenarios, Identifiability for Graphexes and the Weak Kernel Metric, Non-parametric Overlapping Community Detection, Sparse exchangeable graphs and their limits via graphon processes, Random Walks on Dense Graphs and Graphons, Sparse maximum-entropy random graphs with a given power-law degree distribution, Approximating predictive probabilities of Gibbs-type priors, Sampling perspectives on sparse exchangeable graphs, Sampling and estimation for (sparse) exchangeable graphs, Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing, A statistical framework for modern network science, Network representation using graph root distributions, Hierarchical normalized completely random measures for robust graphical modeling, Sparse networks with core-periphery structure, Nonexchangeable random partition models for microclustering, Bayesian consensus clustering in multiplex networks, Nonnegative Bayesian nonparametric factor models with completely random measures, Limits of sparse configuration models and beyond: graphexes and multigraphexes, Truncated simulation and inference in edge-exchangeable networks, Asymptotic behavior of the number of distinct values in a sample from the geometric stick-breaking process, Two part envelopes for rejection sampling of some completely random measures, Higher-order fluctuations in dense random graph models, Bayesian nonparametric sparse VAR models, A generalization of hierarchical exchangeability on trees to directed acyclic graphs, Gibbs partitions, Riemann–Liouville fractional operators, Mittag–Leffler functions, and fragmentations derived from stable subordinators, Limit theorems for distributions invariant under groups of transformations, Unnamed Item, Infinite-color randomly reinforced urns with dominant colors, On the Truncation Error of a Superposed Gamma Process

Uses Software

• Gephi
• plfit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simulation of nonhomogeneous poisson processes by thinning
• Bayesian nonparametric Plackett-Luce models for the analysis of preferences for college degree programmes
• Spectral clustering and the high-dimensional stochastic blockmodel
• The method of moments and degree distributions for network models
• Generating simple random graphs with prescribed degree distribution
• Limits of dense graph sequences
• Exchangeable random measures in the plane
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Representations for partially exchangeable arrays of random variables
• On the bootstrap of \(U\) and \(V\) statistics
• Modelling heterogeneity in survival analysis by the compound Poisson distribution
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Ferguson distributions via Polya urn schemes
• Distributional results for means of normalized random measures with independent increments
• Exchangeable and partially exchangeable random partitions
• Consistency of community detection in networks under degree-corrected stochastic block models
• Moments of two-variable functions and the uniqueness of graph limits
• Asymptotic behavior and distributional limits of preferential attachment graphs
• Co-clustering separately exchangeable network data
• Asymptotic laws for compositions derived from transformed subordinators
• Completely random measures
• Bayesian Poisson process partition calculus with an application to Bayesian Lévy moving averages
• From the Cover: The structure of scientific collaboration networks
• A nonparametric view of network models and Newman–Girvan and other modularities
• Mixed membership stochastic blockmodels
• Emergence of Scaling in Random Networks
• Posterior Analysis for Normalized Random Measures with Independent Increments
• Graph limits and exchangeable random graphs
• Power-Law Distributions in Empirical Data
• Survival models for heterogeneous populations derived from stable distributions
• On Lewis' simulation method for point processes
• The Structure and Function of Complex Networks
• Random Geometric Graphs
• Estimation and Prediction for Stochastic Blockstructures
• Latent Space Approaches to Social Network Analysis
• Random variate generation for exponentially and polynomially tilted stable distributions
• Sampling Exponentially Tilted Stable Distributions
• Generalized Gamma measures and shot-noise Cox processes
• Controlling the Reinforcement in Bayesian Non-Parametric Mixture Models
• A Survey of Statistical Network Models
• Stochastic processes directed by randomized time
• The phase transition in inhomogeneous random graphs
• Collective dynamics of ‘small-world’ networks
• Convergent sequences of sparse graphs: A large deviations approach
• On a conditionally Poissonian graph process
• Random Fragmentation and Coagulation Processes
• A Representation of Independent Increment Processes without Gaussian Components
• An Introduction to the Theory of Point Processes
• Networks
• MCMC for normalized random measure mixture models