Edge Exchangeable Models for Interaction Networks
From MaRDI portal
Publication:4559710
DOI10.1080/01621459.2017.1341413zbMath1402.90027OpenAlexW2735719388WikidataQ64961533 ScholiaQ64961533MaRDI QIDQ4559710
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
power-law distributionscale-free networksparse networkinteraction dataedge exchangeabilityexchangeable random graphedge-labeled network
Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15)
Related Items (31)
Random Partition Models for Microclustering Tasks ⋮ Exchangeable graph-valued Feller processes ⋮ On edge exchangeable random graphs ⋮ Model-Based Edge Clustering ⋮ Exchangeable trait allocations ⋮ Unnamed Item ⋮ Inference for High-Dimensional Exchangeable Arrays ⋮ Robust online detection in serially correlated directed network ⋮ Local exchangeability ⋮ Hierarchical Network Models for Exchangeable Structured Interaction Processes ⋮ Asymptotic results of a multiple-entry reinforcement process ⋮ Link Prediction for Egocentrically Sampled Networks ⋮ Bootstrap estimators for the tail-index and for the count statistics of graphex processes ⋮ Preferential attachment random graphs with edge-step functions ⋮ Exponential-family models of random graphs: inference in finite, super and infinite population scenarios ⋮ Network models: structure and function. Abstracts from the workshop held December 10--16, 2017 ⋮ Combinatorial Lévy processes ⋮ 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 ⋮ Correlation bounds, mixing and \(m\)-dependence under random time-varying network distances with an application to Cox-processes ⋮ Relational exchangeability ⋮ Nonexchangeable random partition models for microclustering ⋮ Bayesian consensus clustering in multiplex networks ⋮ Truncated simulation and inference in edge-exchangeable networks ⋮ Unnamed Item ⋮ The Cut Metric for Probability Distributions ⋮ A generalization of hierarchical exchangeability on trees to directed acyclic graphs ⋮ Universality for random surfaces in unconstrained genus ⋮ Concentration in the generalized Chinese restaurant process ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Consistency under sampling of exponential random graph models
- Sparsity. Graphs, structures, and algorithms
- Limits of dense graph sequences
- Exchangeable random measures in the plane
- Uncovering latent structure in valued graphs: a variational approach
- Representations for partially exchangeable arrays of random variables
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Rejoinder: The ubiquitous Ewens sampling formula
- Estimating and understanding exponential random graph models
- The sampling theory of selectively neutral alleles
- A Bayesian analysis of some nonparametric problems
- From the Cover: The structure of scientific collaboration networks
- A nonparametric view of network models and Newman–Girvan and other modularities
- Emergence of Scaling in Random Networks
- Epidemics on Random Graphs with Tunable Clustering
- The Poisson-Dirichlet Distribution and Related Topics
- RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
- An Exponential Family of Probability Distributions for Directed Graphs
- On Random Intersection Graphs: The Subgraph Problem
- Point Process Modelling for Directed Interaction Networks
- A BAYESIAN APPROACH TO MODELING STOCHASTIC BLOCKSTRUCTURES WITH COVARIATES
- Gibbs Sampling Methods for Stick-Breaking Priors
- Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
- Confidence sets for network structure
- Machine Learning: ECML 2004
This page was built for publication: Edge Exchangeable Models for Interaction Networks
