Directed Networks with a Differentially Private Bi-degree Sequence
From MaRDI portal
Publication:5037802
DOI10.5705/ss.202019.0215OpenAlexW3037812711MaRDI QIDQ5037802
Publication date: 4 March 2022
Published in: Statistica Sinica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.01715
Related Items (3)
Affiliation weighted networks with a differentially private degree sequence ⋮ Weighted directed networks with a differentially private bi-degree sequence ⋮ A note on asymptotic distributions in a directed network model with degree heterogeneity and homophily
Cites Work
- Unnamed Item
- Unnamed Item
- Random graphs with a given degree sequence
- Zero-one matrices with zero trace
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
- The maximum entropy method
- Algorithms for constructing graphs and digraphs with given valences and factors
- A remark on the existence of finite graphs
- 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
- How Many People Do You Know?: Efficiently Estimating Personal Network Size
- 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
- Theory of Cryptography
- Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
- Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs
This page was built for publication: Directed Networks with a Differentially Private Bi-degree Sequence
