Fetching the paper…
Reading the bibliography…
The $\beta$-model of random graphs is an exponential family model with the degree sequence as a sufficient statistic.
Havel, VáclavV. (1955). A remark on the existence of finite graphs. Casopis Pest. Mat. 80 477–480
1955
Earlier work this paper cites.
Hakimi, S. L.S. L. (1962). On realizability of a set of integers as degrees of the vertices of a linear graph. I. J. Soc. Indust. Appl. Math. 10 496–506
1962
Earlier work this paper cites.
Sampson, Samuel FranklinS. F. (1968). A novitiate in a period of change: An experimental and case study of social relationships Ph.D. thesis, Cornell Univ., Ithaca, NY
1968
Earlier work this paper cites.
Zachary, W. W.W. W. (1977). An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33 452–473
1977
Earlier work this paper cites.
Barndorff-Nielsen, OleO. (1978). Information and Exponential Families in Statistical Theory. Wiley, Chichester
1978
Earlier work this paper cites.
Holland, Paul W.P. W. andLeinhardt, SamuelS. (1981). An exponential family of probability distributions for directed graphs. J. Amer. Statist. Assoc. 76 33–65
1981
Earlier work this paper cites.
Mahadev, Nadimpalli VRN. V. andPeled, Uri N.U. N. (1995). Threshold Graphs and Related Topics. Elsevier, Amsterdam
1995
Earlier work this paper cites.
Willenborg, L.L. andde Waal, T.T. (1996). Statistical Disclosure Control in Practice. Springer, New York
1996
Earlier work this paper cites.
Snijders, T. A. B.T. A. B. (2003). Accounting for degree distributions in empirical analysis of network dynamics. In Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers 146–161. The National Academies Press, Washington, DC
2003
Earlier work this paper cites.
Hunter, David R.D. R. (2004). MM algorithms for generalized Bradley–Terry models. Ann. Statist. 32 384–406
2004
Earlier work this paper cites.
Arratia, RichardR. andLiggett, Thomas M.T. M. (2005). How likely is an i.i.d. degree sequence to be graphical? Ann. Appl. Probab. 15 652–670
2005
Earlier work this paper cites.
Bhattacharya, AmitavaA., Sivasubramanian, S.S. andSrinivasan, Murali K.M. K. (2006). The polytope of degree partitions. Electron. J. Combin. 13 Research Paper 46, 18 pp. (electronic)
2006
Earlier work this paper cites.
Carroll, Raymond J.R. J., Ruppert, DavidD., Stefanski, Leonard A.L. A. andCrainiceanu, Ciprian M.C. M. (2006). Measurement Error in Nonlinear Models: A Modern Perspective, 2nd ed. Monographs on Statistics and Applied Probability 105. Chapman & Hall/CRC, Boca Raton, FL
2006
Earlier work this paper cites.
Dwork, CynthiaC., Kenthapadi, KrishnaramK., McSherry, FrankF., Mironov, IlyaI. andNaor, MoniM. (2006b). Our data, ourselves: Privacy via distributed noise generation. In Advances in Cryptology—EUROCRYPT 2006. Lecture Notes in Computer Science 4004 486–503. Springer, Berlin
2006
Earlier work this paper cites.
Helleringer, StéphaneS. andKohler, Hans-PeterH.-P. (2007). Sexual network structure and the spread of HIV in Africa: Evidence from Likoma island, Malawi. AIDS 21 2323–2332
2007
Earlier work this paper cites.
Nissim, KobbiK., Raskhodnikova, SofyaS. andSmith, AdamA. (2007). Smooth sensitivity and sampling in private data analysis. In STOC’07—Proceedings of the 39th Annual ACM Symposium on Theory of Computing 75–84. ACM, New York
2007
Earlier work this paper cites.
Hunter, David R.D. R., Goodreau, Steven M.S. M. andHandcock, Mark S.M. S. (2008). Goodness of fit of social network models. J. Amer. Statist. Assoc. 103 248–258
2008
Cited alongside, same era.
2008
Cited alongside, same era.
Ghosh, ArpitaA., Roughgarden, TimT. andSundararajan, MukundM. (2009). Universally utility-maximizing privacy mechanisms. In STOC’09—Proceedings of the 2009 ACM International Symposium on Theory of Computing 351–359. ACM, New York
2009
Cited alongside, same era.
Goodreau, Steven M.S. M., Kitts, James A.J. A. andMorris, MartinaM. (2009). Birds of a feather, or friend of a friend? Using exponential random graph models to investigate adolescent social networks. Demography 46 103–125
2009
Cited alongside, same era.
Chatterjee, SouravS., Diaconis, PersiP. andSly, AllanA. (2011). Random graphs with a given degree sequence. Ann. Appl. Probab. 21 1400–1435
2011
Later among the works it cites.
2011
Later among the works it cites.
Hundepool, AncoA., Domingo-Ferrer, JosepJ., Franconi, LuisaL., Giessing, SarahS., Nordholt, Eric SchulteE. S., Spicer, KeithK. andde Wolf, Peter-PaulP.-P. (2012). Statistical Disclosure Control. Wiley, Chichester
2012
Closest in time.
Karwa, VisheshV. andSlavković, Aleksandra B.A. B. (2012). Differentially private graphical degree sequences and synthetic graphs. In Privacy in Statistical Databases 273–285. Spinger, Berlin
2012
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Hay, M.M., Li, C.C., Miklau, G.G. andJensen, D.D. (2009). Accurate estimation of the degree distribution of private networks. In Ninth IEEE International Conference on Data Mining, ICDM’09 169–178. IEEE, New York
2009
Cited alongside, same era.
Helleringer, StéphaneS., Kohler, Hans-PeterH.-P., Chimbiri, AgnesA., Chatonda, PraiseP. andMkandawire, JamesJ. (2009). The Likoma network study: Context, data collection, and initial results. Demogr. Res. 21 427–468
2009
Cited alongside, same era.
Narayanan, ArvindA. andShmatikov, VitalyV. (2009). De-anonymizing social networks. In 30th IEEE Symposium on Security and Privacy 173–187. IEEE, New York
2009
Cited alongside, same era.
Rinaldo, AlessandroA., Fienberg, Stephen E.S. E. andZhou, YiY. (2009). On the geometry of discrete exponential families with application to exponential random graph models. Electron. J. Stat. 3 446–484
2009
Cited alongside, same era.
Vu, DuyD. andSlavković, AleksandraA. (2009). Differential privacy for clinical trial data: Preliminary evaluations. In IEEE International Conference on Data Mining Workshops, ICDMW’09 138–143. IEEE, New York
2009
Cited alongside, same era.
Blitzstein, JosephJ. andDiaconis, PersiP. (2010). A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Internet Math. 6 489–522
2010
Cited alongside, same era.
2010
Cited alongside, same era.
Fienberg, Stephen E.S. E., Rinaldo, AlessandroA. andYang, XiaolinX. (2010). Differential privacy and the risk-utility tradeoff for multi-dimensional contingency tables. In Proceedings of the 2010 International Conference on Privacy in Statistical Databases, PSD’10 187–199. Springer, Berlin
2010
Cited alongside, same era.
2012
Closest in time.
2012
Closest in time.
2013
Closest in time.
2013
Closest in time.
Kasiviswanathan, Shiva PrasadS. P., Nissim, KobbiK., Raskhodnikova, SofyaS. andSmith, AdamA. (2013). Analyzing graphs with node differential privacy. In Theory of Cryptography 457–476. Springer, Berlin
2013
Closest in time.
Rinaldo, AlessandroA., Petrović, SonjaS. andFienberg, Stephen E.S. E. (2013). Maximum likelihood estimation in the β \beta -model. Ann. Statist. 41 1085–1110
2013
Closest in time.
Yan, TingT. andXu, JinfengJ. (2013). A central limit theorem in the β \beta -model for undirected random graphs with a diverging number of vertices. Biometrika 100 519–524
2013
Closest in time.
2013
Closest in time.
Karwa, VisheshV., Slavković, Aleksandra B.A. B. andKrivitsky, PavelP. (2014). Differentially private exponential random graphs. In Privacy in Statistical Databases 143–155. Springer, Berlin
2014
Closest in time.
2014
Closest in time.
Karwa, VisheshV. andSlavković, AleksandraA. (2015). Supplement to “Inference using noisy degrees: Differentially private β \beta -model and synthetic graphs.” DOI: \doiurl
2015
Closest in time.
Yan, TingT., Zhao, YunpengY. andQin, HongH. (2015). Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters. J. Multivariate Anal. 133 61–76
2015
Closest in time.