Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs
From MaRDI portal
Publication:5963517
DOI10.1214/15-AOS1358zbMath1331.62114arXiv1205.4697MaRDI QIDQ5963517
Vishesh Karwa, Aleksandra B. Slavković
Publication date: 22 February 2016
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.4697
62F12: Asymptotic properties of parametric estimators
91D30: Social networks; opinion dynamics
62F30: Parametric inference under constraints
Related Items
Minimax Optimal Procedures for Locally Private Estimation, Structure and Sensitivity in Differential Privacy: Comparing K-Norm Mechanisms, Nonparametric density estimation for intentionally corrupted functional data, Directed Networks with a Differentially Private Bi-degree Sequence, Asymptotics in theβ-model for networks with a differentially private degree sequence, Finite Sample Differentially Private Confidence Intervals, Weighted directed networks with a differentially private bi-degree sequence, Asymptotic in undirected random graph models with a noisy degree sequence, A semiparametric Bayesian approach to epidemics, with application to the spread of the coronavirus MERS in South Korea in 2015, Statistical Inference in a Directed Network Model With Covariates, Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs, On the efficacy of higher-order spectral clustering under weighted stochastic block models, Distribution-invariant differential privacy, A note on asymptotic distributions in a directed network model with degree heterogeneity and homophily, Providing access to confidential research data through synthesis and verification: an application to data on employees of the U.S. federal government, Confidentiality and differential privacy in the dissemination of frequency tables, Detection thresholds for the \(\beta\)-model on sparse graphs, Affiliation weighted networks with a differentially private degree sequence, Asymptotic in the ordered networks with a noisy degree sequence, Bivariate gamma model, Exponential-family models of random graphs: inference in finite, super and infinite population scenarios, A survey of discrete methods in (algebraic) statistics for networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum likelihood estimation in the \(\beta\)-model
- Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters
- Random graphs with a given degree sequence
- Modeling social networks from sampled data
- How likely is an LLD degree sequence to be graphical?
- MM algorithms for generalized Bradley-Terry models.
- Threshold graphs and related topics
- Statistical disclosure control in practice
- Graver basis for an undirected graph and its application to testing the beta model of random graphs
- On the geometry of discrete exponential families with application to exponential random graph models
- The polytope of degree partitions
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- Polytopes from Subgraph Statistics
- A remark on the existence of finite graphs
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Goodness of Fit of Social Network Models
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- An Exponential Family of Probability Distributions for Directed Graphs
- Analyzing Graphs with Node Differential Privacy
- Universally utility-maximizing privacy mechanisms
- A Statistical Framework for Differential Privacy
- Sampling for Conditional Inference on Network Data
- A central limit theorem in the -model for undirected random graphs with a diverging number of vertices
- Measurement Error in Nonlinear Models
- Theory of Cryptography
- Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs
