This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Amati, V., A. Lomi, and A. Mira. 2018. “Social Network Modeling”. Annual Review of Statistics and its Application 5:343-69.AmatiV.A.Lomi, and A.Mira. 2018. “Social Network Modeling”. Annual Review of Statistics and its Application5:343-69.10.1146/annurev-statistics-031017-100746Search in Google Scholar
Batagelj, V. and A. Mrvar. 2004. “Pajek – Analysis and Visualization of Large Networks”. In Jünger, M. and Mutzel, P. (Eds.), Graph Drawing Software, Mathematics and Visualization, 77-103. Heidelberg: Springer.BatageljV. and A.Mrvar. 2004. “Pajek – Analysis and Visualization of Large Networks”. In JüngerM. and MutzelP. (Eds.), Graph Drawing Software, Mathematics and Visualization, 77-103. Heidelberg: Springer.10.1007/978-3-642-18638-7_4Search in Google Scholar
Batten, L.M. 1983. “Geodesic Subgraphs”. Journal of Graph Theory 7(2):159-63.BattenL.M.1983. “Geodesic Subgraphs”. Journal of Graph Theory7(2):159-63.10.1002/jgt.3190070203Search in Google Scholar
Bearman, P.S., J. Moody, and K. Stovel. 2004. “Chains of Affection: The Structure of Adolescent Romantic and Sexual Networks”. American Journal of Sociology 110(1):44-91.BearmanP.S.J.Moody, and K.Stovel. 2004. “Chains of Affection: The Structure of Adolescent Romantic and Sexual Networks”. American Journal of Sociology110(1):44-91.10.1086/386272Search in Google Scholar
Benjamini, I., C. Hoppen, E. Ofek, P. Prałat, and N. Wormald. 2011. “Geodesics and Almost Geodesic Cycles in Random Regular Graphs”. Journal of Graph Theory 66(2):115-36.BenjaminiI.C.HoppenE.OfekP.Prałat, and N.Wormald. 2011. “Geodesics and Almost Geodesic Cycles in Random Regular Graphs”. Journal of Graph Theory66(2):115-36.10.1002/jgt.20496Search in Google Scholar
Blondel, V.D., J.-L. Guillaume, R. Lambiotte, and E. Lefebvre. 2008. “Fast Unfolding of Communities in Large Networks”. Journal of Statistical Mechanics: Theory and Experiment 2008(10):P10008.BlondelV.D.J.-L.GuillaumeR.Lambiotte, and E.Lefebvre. 2008. “Fast Unfolding of Communities in Large Networks”. Journal of Statistical Mechanics: Theory and Experiment2008(10):P10008.10.1088/1742-5468/2008/10/P10008Search in Google Scholar
Borisenko, A., M. Byshkin, and A. Lomi. 2020. “A Simple Algorithm for Scalable Monte Carlo Inference”. Preprint. Retrieved February 18, 2020 (arXiv:1901.00533v4).BorisenkoA.M.Byshkin, and A.Lomi. 2020. “A Simple Algorithm for Scalable Monte Carlo Inference”. Preprint. Retrieved February 18, 2020 (arXiv:1901.00533v4).Search in Google Scholar
Butts, C.T. 2008. “Network: A Package for Managing Relational Data in R”. Journal of Statistical Software 24(2):1-36.ButtsC.T.2008. “Network: A Package for Managing Relational Data in R”. Journal of Statistical Software24(2):1-36.10.18637/jss.v024.i02Search in Google Scholar
Butts, C.T. 2015. “The Statnet Project (http://statnet.org)”. R package version 1.13.0.ButtsC.T.2015. “The Statnet Project (http://statnet.org)”. R package version 1.13.0.Search in Google Scholar
Byshkin, M., A. Stivala, A. Mira, G. Robins, and A. Lomi. 2018. “Fast Maximum Likelihood Estimation via Equilibrium Expectation for Large Network Data”. Scientific Reports 8(1):11509.ByshkinM.A.StivalaA.MiraG.Robins, and A.Lomi. 2018. “Fast Maximum Likelihood Estimation via Equilibrium Expectation for Large Network Data”. Scientific Reports8(1):11509.10.1038/s41598-018-29725-8Search in Google Scholar
Byshkin, M., A. Stivala, A. Mira, R. Krause, G. Robins, and A. Lomi. 2016. “Auxiliary Parameter MCMC for Exponential Random Graph Models”. Journal of Statistical Physics 165(4):740-54.ByshkinM.A.StivalaA.MiraR.KrauseG.Robins, and A.Lomi. 2016. “Auxiliary Parameter MCMC for Exponential Random Graph Models”. Journal of Statistical Physics165(4):740-54.10.1007/s10955-016-1650-5Search in Google Scholar
Caimo, A. and N. Friel. 2011. “Bayesian Inference for Exponential Random Graph Models”. Social Networks 33(1):41-55.CaimoA. and N.Friel. 2011. “Bayesian Inference for Exponential Random Graph Models”. Social Networks33(1):41-55.10.1016/j.socnet.2010.09.004Search in Google Scholar
Colomer-de Simón, P. and M. Boguñá. 2014. “Double Percolation Phase Transition in Clustered Complex Networks”. Physical Review 4(4):041020.Colomer-de SimónP. and M.Boguñá. 2014. “Double Percolation Phase Transition in Clustered Complex Networks”. Physical Review4(4):041020.Search in Google Scholar
Colomer-de Simón, P., M.A. Serrano, M.G. Beiró, J.I. Alvarez-Hamelin, and M. Boguná. 2013. “Deciphering the Global Organization of Clustering in Real Complex Networks”. Scientific Reports 3(1):2517.Colomer-de SimónP.M.A.SerranoM.G.BeiróJ.I.Alvarez-Hamelin, and M.Boguná. 2013. “Deciphering the Global Organization of Clustering in Real Complex Networks”. Scientific Reports3(1):2517.10.1038/srep02517Search in Google Scholar
Corander, J., K. Dahmström, and P. Dahmström. 1998. “Maximum Likelihood Estimation for Markov Graphs”. Technical Report 8. Stockholm: Department of Statistics, Stockholm University.CoranderJ.K.Dahmström, and P.Dahmström. 1998. “Maximum Likelihood Estimation for Markov Graphs”. Technical Report 8. Stockholm: Department of Statistics, Stockholm University.Search in Google Scholar
Corander, J., K. Dahmström, and P. Dahmström. 2002. “Maximum Likelihood Estimation for Exponential Random Graph Models”. In Contributions to Social Network Analysis, Information Theory, and Other Topics in Statistics; A Festschrift in Honour of Ove Frank, edited by J. Hagberg, 1-17. Stockholm: Department of Statistics, University of Stockholm.CoranderJ.K.Dahmström, and P.Dahmström. 2002. “Maximum Likelihood Estimation for Exponential Random Graph Models”. In Contributions to Social Network Analysis, Information Theory, and Other Topics in Statistics; A Festschrift in Honour of Ove Frank, edited by J.Hagberg, 1-17. Stockholm: Department of Statistics, University of Stockholm.Search in Google Scholar
Csárdi, G. and T. Nepusz. 2006. “The igraph Software Package for Complex Network Research”. InterJournal, Complex Systems 1695(5):1-9.CsárdiG. and T.Nepusz. 2006. “The igraph Software Package for Complex Network Research”. InterJournal, Complex Systems1695(5):1-9.Search in Google Scholar
David, A., R. Kemp, L. Smith, and T. Fahy. 1996. “Split Minds: Multiple Personality And Schizophrenia”. In Method in Madness: Case Studies in Cognitive Neuropsychiatry, Chapter 7, edited by P.W. Halligan and J.C. Marshall, 122-46. Hove, UK: Psychology Press.DavidA.R.KempL.Smith, and T.Fahy. 1996. “Split Minds: Multiple Personality And Schizophrenia”. In Method in Madness: Case Studies in Cognitive Neuropsychiatry, Chapter 7, edited by P.W.Halligan and J.C.Marshall, 122-46. Hove, UK: Psychology Press.Search in Google Scholar
Erdős, P. 1960. “On the Evolution of Random Graphs”. Publications of the Mathematical Institute of the Hungarian Academy of Sciences 5(1):17-60.ErdősP.1960. “On the Evolution of Random Graphs”. Publications of the Mathematical Institute of the Hungarian Academy of Sciences5(1):17-60.Search in Google Scholar
Farber, M. 1987. “Bridged Graphs and Geodesic Convexity”. Discrete Mathematics 66(3):249-57.FarberM.1987. “Bridged Graphs and Geodesic Convexity”. Discrete Mathematics66(3):249-57.10.1016/0012-365X(87)90100-2Search in Google Scholar
Farber, M. and R.E. Jamison. 1986. “Convexity in Graphs and Hypergraphs”. SIAM Journal on Algebraic Discrete Methods 7(3):433-44.FarberM. and R.E.Jamison. 1986. “Convexity in Graphs and Hypergraphs”. SIAM Journal on Algebraic Discrete Methods7(3):433-44.10.1137/0607049Search in Google Scholar
Freud, S. 1895/1950. “Extracts from the Fliess Papers”. In The Standard Edition of the Complete Works of Sigmund Freud, Vol. 1, edited by J. Strachey, 173-280. London: Hogarth Press and The Institute of Psychoanalysis.FreudS.1895/1950. “Extracts from the Fliess Papers”. In The Standard Edition of the Complete Works of Sigmund Freud, Vol. 1, edited by J.Strachey, 173-280. London: Hogarth Press and The Institute of Psychoanalysis.Search in Google Scholar
Garey, M.R. and D.S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman.GareyM.R. and D.S.Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman.Search in Google Scholar
Gashler, M. 2011. “Waffles: A Machine Learning Toolkit”. Journal of Machine Learning Research 12(Jul):2383-7.GashlerM.2011. “Waffles: A Machine Learning Toolkit”. Journal of Machine Learning Research12(Jul):2383-7.Search in Google Scholar
Gashler, M. and T. Martinez. 2012. “Robust Manifold Learning with CycleCut”. Connection Science 24(1):57-69.GashlerM. and T.Martinez. 2012. “Robust Manifold Learning with CycleCut”. Connection Science24(1):57-69.10.1080/09540091.2012.664122Search in Google Scholar
Handcock, M.S., D.R. Hunter, C.T. Butts, S.M. Goodreau, and M. Morris. 2008. “statnet: Software Tools for the Representation, Visualization, Analysis and Simulation of Network Data”. Journal of Statistical Software 24(1):15-48.HandcockM.S.D.R.HunterC.T.ButtsS.M.Goodreau, and M.Morris. 2008. “statnet: Software Tools for the Representation, Visualization, Analysis and Simulation of Network Data”. Journal of Statistical Software24(1):15-48.10.18637/jss.v024.i01Search in Google Scholar
Handcock, M.S., D.R. Hunter, C.T. Butts, S.M. Goodreau, P.N. Krivitsky, and M. Morris. 2016b. “ergm: Fit, Simulate and Diagnose Exponential-Family Models for Networks”. The Statnet Project (http://www.statnet.org). R package version 3.6.0.HandcockM.S.D.R.HunterC.T.ButtsS.M.GoodreauP.N.Krivitsky, and M.Morris. 2016b. “ergm: Fit, Simulate and Diagnose Exponential-Family Models for Networks”. The Statnet Project(http://www.statnet.org). R package version 3.6.0.Search in Google Scholar
Handcock, M.S., D.R. Hunter, C.T. Butts, S.M. Goodreau, P.N. Krivitsky, S. Bender-deMoll, and M. Morris. 2016a. “statnet: Software Tools for the Statistical Analysis of Network Data”. The Statnet Project (http://www.statnet.org). R package version 2016.4.HandcockM.S.D.R.HunterC.T.ButtsS.M.GoodreauP.N.KrivitskyS.Bender-deMoll, and M.Morris. 2016a. “statnet: Software Tools for the Statistical Analysis of Network Data”. The Statnet Project(http://www.statnet.org). R package version 2016.4.Search in Google Scholar
Hellmuth, M., J. Leydold, and P.F. Stadler. 2014. “Convex Cycle Bases”. Ars Mathematica Contemporanea 7(1):123-40.HellmuthM.J.Leydold, and P.F.Stadler. 2014. “Convex Cycle Bases”. Ars Mathematica Contemporanea7(1):123-40.10.26493/1855-3974.226.0a2Search in Google Scholar
Hummel, R.M., D.R. Hunter, and M.S. Handcock. 2012. “Improving Simulation-based Algorithms for Fitting ERGMs”. Journal of Computational and Graphical Statistics 21(4):920-39.HummelR.M.D.R.Hunter, and M.S.Handcock. 2012. “Improving Simulation-based Algorithms for Fitting ERGMs”. Journal of Computational and Graphical Statistics21(4):920-39.10.1080/10618600.2012.679224Search in Google Scholar
Hunter, D.R. 2007. “Curved Exponential Family Models for Social Networks”. Social Networks 29(2):216-30.HunterD.R.2007. “Curved Exponential Family Models for Social Networks”. Social Networks29(2):216-30.10.1016/j.socnet.2006.08.005Search in Google Scholar
Hunter, D.R. and M.S. Handcock. 2006. “Inference in Curved Exponential Family Models for Networks”. Journal of Computational and Graphical Statistics 15(3):565-83.HunterD.R. and M.S.Handcock. 2006. “Inference in Curved Exponential Family Models for Networks”. Journal of Computational and Graphical Statistics15(3):565-83.10.1198/106186006X133069Search in Google Scholar
Hunter, D.R., P.N. Krivitsky, and M. Schweinberger. 2012. “Computational Statistical Methods for Social Network Models”. Journal of Computational and Graphical Statistics 21(4):856-82.HunterD.R.P.N.Krivitsky, and M.Schweinberger. 2012. “Computational Statistical Methods for Social Network Models”. Journal of Computational and Graphical Statistics21(4):856-82.10.1080/10618600.2012.732921Search in Google Scholar
Hunter, D.R., M.S. Handcock, C.T. Butts, S.M. Goodreau, and M. Morris. 2008. “ergm: A Package to Fit, Simulate and Diagnose Exponential-Family Models for Networks”. Journal of Statistical Software 24(3):1-29.HunterD.R.M.S.HandcockC.T.ButtsS.M.Goodreau, and M.Morris. 2008. “ergm: A Package to Fit, Simulate and Diagnose Exponential-Family Models for Networks”. Journal of Statistical Software24(3):1-29.10.18637/jss.v024.i03Search in Google Scholar
Kapferer, B. 1972. Strategy and Transaction in an African Factory: African Workers and Indian Management in a Zambian Town. Manchester: Manchester University Press.KapfererB.1972. Strategy and Transaction in an African Factory: African Workers and Indian Management in a Zambian Town. Manchester: Manchester University Press.Search in Google Scholar
Kihlstrom, J.F. 2005. “Dissociative Disorders”. Annual Review of Clinical Psychology 1(1):227-53.KihlstromJ.F.2005. “Dissociative Disorders”. Annual Review of Clinical Psychology1(1):227-53.10.1146/annurev.clinpsy.1.102803.143925Search in Google Scholar
Krivitsky, P.N. 2016. “ergm.count: Fit, Simulate and Diagnose Exponential-Family Models for Networks with Count Edges”. The Statnet Project (http://www.statnet.org). R package version 3.2.2.KrivitskyP.N.2016. “ergm.count: Fit, Simulate and Diagnose Exponential-Family Models for Networks with Count Edges”. The Statnet Project(http://www.statnet.org). R package version 3.2.2.Search in Google Scholar
Lazega, E. 2001. The Collegial Phenomenon: The Social Mechanisms of Cooperation among Peers in a Corporate Law Partnership. New York: Oxford University Press.LazegaE.2001. The Collegial Phenomenon: The Social Mechanisms of Cooperation among Peers in a Corporate Law Partnership. New York: Oxford University Press.Search in Google Scholar
Lazega, E. and P.E. Pattison. 1999. “Multiplexity, Generalized Exchange and Cooperation in Organizations: A Case Study”. Social Networks 21(1):67-90.LazegaE. and P.E.Pattison. 1999. “Multiplexity, Generalized Exchange and Cooperation in Organizations: A Case Study”. Social Networks21(1):67-90.10.1016/S0378-8733(99)00002-7Search in Google Scholar
Leavitt, A. and J. Clark. 2014. “SNA in R workshop”. Retrieved July 12, 2019 (https://github.com/alexleavitt/SNAinRworkshop).LeavittA. and J.Clark. 2014. “SNA in R workshop”. Retrieved July 12, 2019 (https://github.com/alexleavitt/SNAinRworkshop).Search in Google Scholar
Levy, M. 2016. “gwdegree: Improving Interpretation of Geometrically-Weighted Degree Estimates in Exponential Random Graph Models”. Journal of Open Source Software 1(3):36.LevyM.2016. “gwdegree: Improving Interpretation of Geometrically-Weighted Degree Estimates in Exponential Random Graph Models”. Journal of Open Source Software1(3):36.10.21105/joss.00036Search in Google Scholar
Li, Y. and L. Shi. 2018. “Geodesic Cycles in Random Graphs”. Discrete Mathematics 341(5):1275-81.LiY. and L.Shi. 2018. “Geodesic Cycles in Random Graphs”. Discrete Mathematics341(5):1275-81.10.1016/j.disc.2018.01.014Search in Google Scholar
Lind, B. 2012. “Lessons on Exponential Random Graph Modeling from Grey’s Anatomy Hook-Ups”. Retrieved July 12, 2019 (https://badhessian.org/2012/09/lessons-on-exponential-random-graph-modeling-from-greys-anatomy-hook-ups/).LindB.2012. “Lessons on Exponential Random Graph Modeling from Grey’s Anatomy Hook-Ups”. Retrieved July 12, 2019 (https://badhessian.org/2012/09/lessons-on-exponential-random-graph-modeling-from-greys-anatomy-hook-ups/).Search in Google Scholar
Lokshtanov, D. 2009. “Finding the Longest Isometric Cycle in a Graph”. Discrete Applied Mathematics 157(12):2670-74.LokshtanovD.2009. “Finding the Longest Isometric Cycle in a Graph”. Discrete Applied Mathematics157(12):2670-74.10.1016/j.dam.2008.08.008Search in Google Scholar
Łuczak, T. 1991. “Holes in Random Graphs”. Discrete Applied Mathematics 30(2-3):213-9.ŁuczakT.1991. “Holes in Random Graphs”. Discrete Applied Mathematics30(2-3):213-9.10.1016/0166-218X(91)90045-XSearch in Google Scholar
Łuczak, T. 1993. “The Size of the Largest Hole in a Random Graph”. Discrete Mathematics 112(1-3):151-63.ŁuczakT.1993. “The Size of the Largest Hole in a Random Graph”. Discrete Mathematics112(1-3):151-63.10.1016/0012-365X(93)90230-QSearch in Google Scholar
Lusher, D., J. Koskinen, and G. Robins, eds. 2013. Exponential Random Graph Models for Social Networks. Structural Analysis in the Social Sciences. New York: Cambridge University Press.LusherD.J.Koskinen, and G.Robins, eds. 2013. Exponential Random Graph Models for Social Networks. Structural Analysis in the Social Sciences. New York: Cambridge University Press.10.1017/CBO9780511894701Search in Google Scholar
Lusseau, D., K. Schneider, O.J. Boisseau, P. Haase, E. Slooten, and S.M. Dawson. 2003. “The Bottlenose Dolphin Community of Doubtful Sound Features a Large Proportion of Long-Lasting Associations”. Behavioral Ecology and Sociobiology 54(4):396-405.LusseauD.K.SchneiderO.J.BoisseauP.HaaseE.Slooten, and S.M.Dawson. 2003. “The Bottlenose Dolphin Community of Doubtful Sound Features a Large Proportion of Long-Lasting Associations”. Behavioral Ecology and Sociobiology54(4):396-405.10.1007/s00265-003-0651-ySearch in Google Scholar
Mahadevan, P., D. Krioukov, K. Fall, and A. Vahdat. 2006. “Systematic Topology Analysis and Generation Using Degree Correlations”. Computer Communication Review 36(4):135-46.MahadevanP.D.KrioukovK.Fall, and A.Vahdat. 2006. “Systematic Topology Analysis and Generation Using Degree Correlations”. Computer Communication Review36(4):135-46.10.1145/1151659.1159930Search in Google Scholar
Martin, J.L. 2017. “The Structure of Node and Edge Generation in a Delusional Social Network”. Journal of Social Structure 18(1):1-21.MartinJ.L.2017. “The Structure of Node and Edge Generation in a Delusional Social Network”. Journal of Social Structure18(1):1-21.10.21307/joss-2018-005Search in Google Scholar
Mastrandrea, R., J. Fournet, and A. Barrat. 2015. “Contact Patterns in a High School: A Comparison Between Data Collected Using Wearable Sensors, Contact Diaries and Friendship Surveys”. PLoS ONE 10(9):e0136497.MastrandreaR.J.Fournet, and A.Barrat. 2015. “Contact Patterns in a High School: A Comparison Between Data Collected Using Wearable Sensors, Contact Diaries and Friendship Surveys”. PLoS ONE10(9):e0136497.10.1371/journal.pone.0136497Search in Google Scholar
Mrvar, A. and V. Batagelj. 2016. “Analysis and Visualization of Large Networks with Program Package Pajek”. Complex Adaptive Systems Modeling 4(1):1-6.MrvarA. and V.Batagelj. 2016. “Analysis and Visualization of Large Networks with Program Package Pajek”. Complex Adaptive Systems Modeling4(1):1-6.10.1186/s40294-016-0017-8Search in Google Scholar
Negami, S. and G.-H. Xu. 1986. “Locally Geodesic Cycles in 2-Self-Centered Graphs”. Discrete Mathematics 58(3):263-8.NegamiS. and G.-H.Xu. 1986. “Locally Geodesic Cycles in 2-Self-Centered Graphs”. Discrete Mathematics58(3):263-8.10.1016/0012-365X(86)90143-3Search in Google Scholar
Orsini, C., M.M. Dankulov, P. Colomer-de Simón, A. Jamakovic, P. Mahadevan, A. Vahdat, K.E. Bassler, Z. Toroczkai, M. Boguná, G. Caldarelli, et al. 2015. “Quantifying Randomness in Real Networks”. Nature Communications 6(1):8627.OrsiniC.M.M.DankulovP.Colomer-de SimónA.JamakovicP.MahadevanA.VahdatK.E.BasslerZ.ToroczkaiM.BogunáG.Caldarelli, 2015. “Quantifying Randomness in Real Networks”. Nature Communications6(1):8627.10.1038/ncomms9627Search in Google Scholar
R Core Team. 2016. R: A Language and Environment for Statistical Computing. Vienna, Austria: R Foundation for Statistical Computing.R Core Team. 2016. R: A Language and Environment for Statistical Computing. Vienna, Austria: R Foundation for Statistical Computing.Search in Google Scholar
Robins, G., P. Pattison, Y. Kalish, and D. Lusher. 2007a. “An Introduction to Exponential Random Graph (p*) Models for Social Networks”. Social Networks 29(2):173-91.RobinsG.P.PattisonY.Kalish, and D.Lusher. 2007a. “An Introduction to Exponential Random Graph (p*) Models for Social Networks”. Social Networks29(2):173-91.10.1016/j.socnet.2006.08.002Search in Google Scholar
Robins, G., T. Snijders, P. Wang, M. Handcock, and P. Pattison. 2007b. “Recent Developments in Exponential Random Graph (p∗) Models for Social Networks”. Social Networks 29(2):192-215.RobinsG.T.SnijdersP.WangM.Handcock, and P.Pattison. 2007b. “Recent Developments in Exponential Random Graph (p∗) Models for Social Networks”. Social Networks29(2):192-215.10.1016/j.socnet.2006.08.003Search in Google Scholar
Rolls, D.A., P. Wang, E. McBryde, P. Pattison, and G. Robins. 2015. “A Simulation Study Comparing Epidemic Dynamics on Exponential Random Graph and Edge-Triangle Configuration Type Contact Network Models”. PLoS ONE 10(11):e0142181.RollsD.A.P.WangE.McBrydeP.Pattison, and G.Robins. 2015. “A Simulation Study Comparing Epidemic Dynamics on Exponential Random Graph and Edge-Triangle Configuration Type Contact Network Models”. PLoS ONE10(11):e0142181.10.1371/journal.pone.0142181Search in Google Scholar
Roman, S. 1989. An Introduction to Discrete Mathematics. 2nd ed. Orlando, FL: Harcourt Brace Jovanovich.RomanS.1989. An Introduction to Discrete Mathematics. 2nd ed.Orlando, FL: Harcourt Brace Jovanovich.Search in Google Scholar
Schweinberger, M., P.N. Krivitsky, C.T. Butts, and J. Stewart. 2019. “Exponential-family Models of Random Graphs: Inference in Finite-, Super-, and Infinite-Population Scenarios”. Preprint. Retrieved February 18, 2020 (arXiv:1707.04800v4). To appear in Statistical Science.SchweinbergerM.P.N.KrivitskyC.T.Butts, and J.Stewart. 2019. “Exponential-family Models of Random Graphs: Inference in Finite-, Super-, and Infinite-Population Scenarios”. Preprint. Retrieved February 18, 2020 (arXiv:1707.04800v4). To appear in Statistical Science.10.1214/19-STS743Search in Google Scholar
Snijders, T.A.B. 2002. “Markov Chain Monte Carlo Estimation of Exponential Random Graph Models”. Journal of Social Structure 3(2):1-40.SnijdersT.A.B.2002. “Markov Chain Monte Carlo Estimation of Exponential Random Graph Models”. Journal of Social Structure3(2):1-40.Search in Google Scholar
Snijders, T.A.B., P.E. Pattison, G.L. Robins, and M.S. Handcock. 2006. “New Specifications for Exponential Random Graph Models”. Sociological Methodology 36(1):99-153.SnijdersT.A.B.P.E.PattisonG.L.Robins, and M.S.Handcock. 2006. “New Specifications for Exponential Random Graph Models”. Sociological Methodology36(1):99-153.10.1111/j.1467-9531.2006.00176.xSearch in Google Scholar
Stivala, A., G. Robins, and A. Lomi. 2020. “Exponential Random Graph Model Parameter Estimation for Very Large Directed Networks”. PLoS ONE 15(1):e0227804.StivalaA.G.Robins, and A.Lomi. 2020. “Exponential Random Graph Model Parameter Estimation for Very Large Directed Networks”. PLoS ONE15(1):e0227804.10.1371/journal.pone.0227804Search in Google Scholar
Takács, L. 1988. “On the Limit Distribution of the Number of Cycles in a Random Graph”. Journal of Applied Probability 25(A):359-76.TakácsL.1988. “On the Limit Distribution of the Number of Cycles in a Random Graph”. Journal of Applied Probability25(A):359-76.10.2307/3214169Search in Google Scholar
Uno, T. and H. Satoh. 2014. “An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths”. In Džeroski, S., P. Panov, D. Kocev, and L. Todorovski (Eds.), International Conference on Discovery Science, 313-24. Cham: Springer.UnoT. and H.Satoh. 2014. “An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths”. In DžeroskiS.P.PanovD.Kocev, and L.Todorovski (Eds.), International Conference on Discovery Science, 313-24. Cham: Springer.10.1007/978-3-319-11812-3_27Search in Google Scholar
Wang, P., G. Robins, and P. Pattison. 2009. “PNet: Program for the Simulation and Estimation of Exponential Random Graph (p*) Models”. Melbourne: Department of Psychology, The University of Melbourne.WangP.G.Robins, and P.Pattison. 2009. “PNet: Program for the Simulation and Estimation of Exponential Random Graph (p*) Models”. Melbourne: Department of Psychology, The University of Melbourne.Search in Google Scholar
Watts, D.J. 1999. “Networks, Dynamics, and the Small-World Phenomenon”. American Journal of Sociology 105(2):493-527.WattsD.J.1999. “Networks, Dynamics, and the Small-World Phenomenon”. American Journal of Sociology105(2):493-527.10.1086/210318Search in Google Scholar
Weissman, G. 2019. “Network of Sexual Relations”. Retrieved July 12, 2019 (https://gweissman.github.io/post/grey-s-anatomy-network-of-sexual-relations/).WeissmanG.2019. “Network of Sexual Relations”. Retrieved July 12, 2019 (https://gweissman.github.io/post/grey-s-anatomy-network-of-sexual-relations/).Search in Google Scholar
Weisstein, E.W. 2020. “Graph Cycle. From MathWorld – A Wolfram Web Resource”. Retrieved February 12, 2020 (http://mathworld.wolfram.com/GraphCycle.html).WeissteinE.W.2020. “Graph Cycle. From MathWorld – A Wolfram Web Resource”. Retrieved February 12, 2020 (http://mathworld.wolfram.com/GraphCycle.html).Search in Google Scholar
White, H.C., S.A. Boorman, and R.L. Breiger. 1976. “Social Structure from Multiple Networks. I. Blockmodels of Roles and Positions”. American Journal of Sociology 81(4):730-80.WhiteH.C.S.A.Boorman, and R.L.Breiger. 1976. “Social Structure from Multiple Networks. I. Blockmodels of Roles and Positions”. American Journal of Sociology81(4):730-80.10.1086/226141Search in Google Scholar
Wickham, H. 2009. ggplot2: Elegant Graphics for Data Analysis. New York: Springer.WickhamH.2009. ggplot2: Elegant Graphics for Data Analysis. New York: Springer.10.1007/978-0-387-98141-3Search in Google Scholar
Zachary, W.W. 1977. “An Information Flow Model for Conflict and Fission in Small Groups”. Journal of Anthropological Research 33(4):452-73.ZacharyW.W.1977. “An Information Flow Model for Conflict and Fission in Small Groups”. Journal of Anthropological Research33(4):452-73.10.1086/jar.33.4.3629752Search in Google Scholar