A statistical framework for modern network science
type: Item
instance of: scholarly article
title: A statistical framework for modern network science
DOI: 10.1214/19-STS759
author: Harry Crane
author: Walter Dempsey
published in: Statistical Science
publication date: 2021-07-06T00:00:00Z
Mathematics Subject Classification ID: 62-XX
zbMATH DE Number: 7368219
zbMATH Keywords: data generating process
zbMATH Keywords: edge exchangeable network
zbMATH Keywords: network data
zbMATH Keywords: network sampling
zbMATH Keywords: relational exchangeability
zbMATH Keywords: relative exchangeability
zbMATH Keywords: scale-free network
zbMATH Keywords: sparse network
MaRDI profile type: Publication
cites work: On the bias of traceroute sampling
cites work: Representations for partially exchangeable arrays of random variables
cites work: Q3675249
cites work: A nonparametric view of network models and Newman–Girvan and other modularities
cites work: Sparse exchangeable graphs and their limits via graphon processes
cites work: Science and Statistics
cites work: A Markovian Function of a Markov Chain
cites work: Sparse Graphs Using Exchangeable Random Measures
cites work: Network Cross-Validation for Determining the Number of Communities in Network Data
cites work: Q4101268
cites work: Time-varying network models
cites work: The ubiquitous Ewens sampling formula
cites work: Exchangeable graph-valued Feller processes
cites work: Combinatorial Lévy processes
cites work: Q4607149
cites work: Edge Exchangeable Models for Interaction Networks
cites work: Relational exchangeability
cites work: RELATIVELY EXCHANGEABLE STRUCTURES
cites work: Q5766989
cites work: Algebraic statistical models
cites work: The Poisson-Dirichlet Distribution and Related Topics
cites work: Markov Graphs
cites work: Q4715945
cites work: Modeling social networks from sampled data
cites work: Extended statistical modeling under symmetry; the link toward quantum mechanics
cites work: Latent Space Approaches to Social Network Analysis
cites work: An Exponential Family of Probability Distributions for Directed Graphs
cites work: Novel sampling design for respondent-driven sampling
cites work: Estimating the number of connected components in a graph via subgraph sampling
cites work: A Separable Model for Dynamic Networks
cites work: Q3672893
cites work: Network cross-validation by edge sampling
cites work: What is a statistical model? (With comments and rejoinder).
cites work: Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
cites work: Consistency under sampling of exponential random graph models
cites work: Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
full work available at URL: 19-sts759
OpenAlex ID: W3117043371
description: scientific article; zbMATH DE number 7368219