Edge exchangeable models for interaction networks

DOI10.1080/01621459.2017.1341413zbMATH Open1402.90027OpenAlexW2735719388WikidataQ64961533 ScholiaQ64961533MaRDI QIDQ4559710FDOQ4559710

Authors: Harry Crane, Walter Dempsey 

Publication date: 4 December 2018

Published in: Journal of the American Statistical Association (Search for Journal in Brave)

Full work available at URL: http://europepmc.org/articles/pmc6241523

Recommendations

• Hierarchical Network Models for Exchangeable Structured Interaction Processes
• On exchangeability in network models
• Exchangeable random networks
• Network representation using graph root distributions
• Truncated simulation and inference in edge-exchangeable networks

zbMATH Keywords

power-law distributionscale-free networksparse networkinteraction dataedge exchangeabilityexchangeable random graphedge-labeled network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15)

Cites Work

• A nonparametric view of network models and Newman–Girvan and other modularities
• Limits of dense graph sequences
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure
• A Bayesian analysis of some nonparametric problems
• Emergence of Scaling in Random Networks
• An Exponential Family of Probability Distributions for Directed Graphs
• A BAYESIAN APPROACH TO MODELING STOCHASTIC BLOCKSTRUCTURES WITH COVARIATES
• Uncovering latent structure in valued graphs: a variational approach
• Title not available (Why is that?)
• Representations for partially exchangeable arrays of random variables
• On Random Intersection Graphs: The Subgraph Problem
• Machine Learning: ECML 2004
• Estimating and understanding exponential random graph models
• Consistency under sampling of exponential random graph models
• Gibbs Sampling Methods for Stick-Breaking Priors
• The sampling theory of selectively neutral alleles
• Sparsity. Graphs, structures, and algorithms
• The structure of scientific collaboration networks
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• The Poisson-Dirichlet distribution and related topics. Models and asymptotic behaviors
• Epidemics on Random Graphs with Tunable Clustering
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• Point Process Modelling for Directed Interaction Networks
• Exchangeable random measures in the plane
• Rejoinder: The ubiquitous Ewens sampling formula
• Confidence sets for network structure

Cited In (35)

• Network models: structure and function. Abstracts from the workshop held December 10--16, 2017
• Preferential attachment random graphs with edge-step functions
• Relational exchangeability
• Bayesian consensus clustering in multiplex networks
• Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
• Nonexchangeable random partition models for microclustering
• Asymptotic results of a multiple-entry reinforcement process
• The cut metric for probability distributions
• Combinatorial Lévy processes
• Asymptotic analysis of statistical estimators related to multigraphex processes under misspecification
• Universality for random surfaces in unconstrained genus
• Title not available (Why is that?)
• On edge exchangeable random graphs
• Exchangeable trait allocations
• Probabilistic symmetries and invariant neural networks
• Hierarchical Network Models for Exchangeable Structured Interaction Processes
• A statistical framework for modern network science
• Recent advances on mechanisms of network generation: community, exchangeability, and scale-free properties
• Link Prediction for Egocentrically Sampled Networks
• Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
• Title not available (Why is that?)
• Discussion of “Co-citation and Co-authorship Networks of Statisticians” by Pengsheng Ji, Jiashun Jin, Zheng Tracy Ke, and Wanshan Li
• Network representation using graph root distributions
• Correlation bounds, mixing and \(m\)-dependence under random time-varying network distances with an application to Cox-processes
• Bootstrap estimators for the tail-index and for the count statistics of graphex processes
• Robust online detection in serially correlated directed network
• Tractably modelling dependence in networks beyond exchangeability
• Exchangeable graph-valued Feller processes
• Local exchangeability
• Truncated simulation and inference in edge-exchangeable networks
• Model-Based Edge Clustering
• A generalization of hierarchical exchangeability on trees to directed acyclic graphs
• Concentration in the generalized Chinese restaurant process
• Random Partition Models for Microclustering Tasks
• Inference for High-Dimensional Exchangeable Arrays

This page was built for publication: Edge exchangeable models for interaction networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559710)