Have a personal or library account? Click to login

Geodesic Cycle Length Distributions in Delusional and Other Social Networks

Journal of Social Structure
Volume 21 (2020): Issue 1 (January 2020)
By:
Open Access
|Oct 2020

References

  1. Amati, V., A. Lomi, and A. Mira. 2018. “Social Network Modeling”. Annual Review of Statistics and its Application 5:343-69.
    Search in Google ScholarBack to article
  2. 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.
    Search in Google ScholarBack to article
  3. Batten, L.M. 1983. “Geodesic Subgraphs”. Journal of Graph Theory 7(2):159-63.
    Search in Google ScholarBack to article
  4. 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.
    Search in Google ScholarBack to article
  5. 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.
    Search in Google ScholarBack to article
  6. 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.
    Search in Google ScholarBack to article
  7. Borisenko, A., 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 ScholarBack to article
  8. Butts, C.T. 2008. “Network: A Package for Managing Relational Data in R”. Journal of Statistical Software 24(2):1-36.
    Search in Google ScholarBack to article
  9. Butts, C.T. 2015. “The Statnet Project (http://statnet.org)”. R package version 1.13.0.
    Search in Google ScholarBack to article
  10. 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.
    Search in Google ScholarBack to article
  11. 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.
    Search in Google ScholarBack to article
  12. Caimo, A. and N. Friel. 2011. “Bayesian Inference for Exponential Random Graph Models”. Social Networks 33(1):41-55.
    Search in Google ScholarBack to article
  13. Colomer-de Simón, P. and M. Boguñá. 2014. “Double Percolation Phase Transition in Clustered Complex Networks”. Physical Review 4(4):041020.
    Search in Google ScholarBack to article
  14. 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.
    Search in Google ScholarBack to article
  15. 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.
    Search in Google ScholarBack to article
  16. 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.
    Search in Google ScholarBack to article
  17. Csárdi, G. and T. Nepusz. 2006. “The igraph Software Package for Complex Network Research”. InterJournal, Complex Systems 1695(5):1-9.
    Search in Google ScholarBack to article
  18. 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.
    Search in Google ScholarBack to article
  19. 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.
    Search in Google ScholarBack to article
  20. Farber, M. 1987. “Bridged Graphs and Geodesic Convexity”. Discrete Mathematics 66(3):249-57.
    Search in Google ScholarBack to article
  21. Farber, M. and R.E. Jamison. 1986. “Convexity in Graphs and Hypergraphs”. SIAM Journal on Algebraic Discrete Methods 7(3):433-44.
    Search in Google ScholarBack to article
  22. 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.
    Search in Google ScholarBack to article
  23. Garey, M.R. and D.S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman.
    Search in Google ScholarBack to article
  24. Gashler, M. 2011. “Waffles: A Machine Learning Toolkit”. Journal of Machine Learning Research 12(Jul):2383-7.
    Search in Google ScholarBack to article
  25. Gashler, M. and T. Martinez. 2012. “Robust Manifold Learning with CycleCut”. Connection Science 24(1):57-69.
    Search in Google ScholarBack to article
  26. 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.
    Search in Google ScholarBack to article
  27. 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.
    Search in Google ScholarBack to article
  28. 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.
    Search in Google ScholarBack to article
  29. Hellmuth, M., J. Leydold, and P.F. Stadler. 2014. “Convex Cycle Bases”. Ars Mathematica Contemporanea 7(1):123-40.
    Search in Google ScholarBack to article
  30. 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.
    Search in Google ScholarBack to article
  31. Hunter, D.R. 2007. “Curved Exponential Family Models for Social Networks”. Social Networks 29(2):216-30.
    Search in Google ScholarBack to article
  32. 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.
    Search in Google ScholarBack to article
  33. 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.
    Search in Google ScholarBack to article
  34. 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.
    Search in Google ScholarBack to article
  35. Kapferer, B. 1972. Strategy and Transaction in an African Factory: African Workers and Indian Management in a Zambian Town. Manchester: Manchester University Press.
    Search in Google ScholarBack to article
  36. Kihlstrom, J.F. 2005. “Dissociative Disorders”. Annual Review of Clinical Psychology 1(1):227-53.
    Search in Google ScholarBack to article
  37. 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.
    Search in Google ScholarBack to article
  38. Lazega, E. 2001. The Collegial Phenomenon: The Social Mechanisms of Cooperation among Peers in a Corporate Law Partnership. New York: Oxford University Press.
    Search in Google ScholarBack to article
  39. Lazega, E. and P.E. Pattison. 1999. “Multiplexity, Generalized Exchange and Cooperation in Organizations: A Case Study”. Social Networks 21(1):67-90.
    Search in Google ScholarBack to article
  40. Leavitt, A. and J. Clark. 2014. “SNA in R workshop”. Retrieved July 12, 2019 (https://github.com/alexleavitt/SNAinRworkshop).
    Search in Google ScholarBack to article
  41. Levy, M. 2016. “gwdegree: Improving Interpretation of Geometrically-Weighted Degree Estimates in Exponential Random Graph Models”. Journal of Open Source Software 1(3):36.
    Search in Google ScholarBack to article
  42. Li, Y. and L. Shi. 2018. “Geodesic Cycles in Random Graphs”. Discrete Mathematics 341(5):1275-81.
    Search in Google ScholarBack to article
  43. 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/).
    Search in Google ScholarBack to article
  44. Lokshtanov, D. 2009. “Finding the Longest Isometric Cycle in a Graph”. Discrete Applied Mathematics 157(12):2670-74.
    Search in Google ScholarBack to article
  45. Łuczak, T. 1991. “Holes in Random Graphs”. Discrete Applied Mathematics 30(2-3):213-9.
    Search in Google ScholarBack to article
  46. Łuczak, T. 1993. “The Size of the Largest Hole in a Random Graph”. Discrete Mathematics 112(1-3):151-63.
    Search in Google ScholarBack to article
  47. 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.
    Search in Google ScholarBack to article
  48. 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.
    Search in Google ScholarBack to article
  49. 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.
    Search in Google ScholarBack to article
  50. Martin, J.L. 2017. “The Structure of Node and Edge Generation in a Delusional Social Network”. Journal of Social Structure 18(1):1-21.
    Search in Google ScholarBack to article
  51. 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.
    Search in Google ScholarBack to article
  52. Mrvar, A. and V. Batagelj. 2016. “Analysis and Visualization of Large Networks with Program Package Pajek”. Complex Adaptive Systems Modeling 4(1):1-6.
    Search in Google ScholarBack to article
  53. Negami, S. and G.-H. Xu. 1986. “Locally Geodesic Cycles in 2-Self-Centered Graphs”. Discrete Mathematics 58(3):263-8.
    Search in Google ScholarBack to article
  54. 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.
    Search in Google ScholarBack to article
  55. R Core Team. 2016. R: A Language and Environment for Statistical Computing. Vienna, Austria: R Foundation for Statistical Computing.
    Search in Google ScholarBack to article
  56. 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.
    Search in Google ScholarBack to article
  57. 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.
    Search in Google ScholarBack to article
  58. 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.
    Search in Google ScholarBack to article
  59. Roman, S. 1989. An Introduction to Discrete Mathematics. 2nd ed. Orlando, FL: Harcourt Brace Jovanovich.
    Search in Google ScholarBack to article
  60. 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.
    Search in Google ScholarBack to article
  61. Snijders, T.A.B. 2002. “Markov Chain Monte Carlo Estimation of Exponential Random Graph Models”. Journal of Social Structure 3(2):1-40.
    Search in Google ScholarBack to article
  62. 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.
    Search in Google ScholarBack to article
  63. Stivala, A., G. Robins, and A. Lomi. 2020. “Exponential Random Graph Model Parameter Estimation for Very Large Directed Networks”. PLoS ONE 15(1):e0227804.
    Search in Google ScholarBack to article
  64. 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.
    Search in Google ScholarBack to article
  65. 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.
    Search in Google ScholarBack to article
  66. 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.
    Search in Google ScholarBack to article
  67. Watts, D.J. 1999. “Networks, Dynamics, and the Small-World Phenomenon”. American Journal of Sociology 105(2):493-527.
    Search in Google ScholarBack to article
  68. Weissman, G. 2019. “Network of Sexual Relations”. Retrieved July 12, 2019 (https://gweissman.github.io/post/grey-s-anatomy-network-of-sexual-relations/).
    Search in Google ScholarBack to article
  69. Weisstein, E.W. 2020. “Graph Cycle. From MathWorld – A Wolfram Web Resource”. Retrieved February 12, 2020 (http://mathworld.wolfram.com/GraphCycle.html).
    Search in Google ScholarBack to article
  70. 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.
    Search in Google ScholarBack to article
  71. Wickham, H. 2009. ggplot2: Elegant Graphics for Data Analysis. New York: Springer.
    Search in Google ScholarBack to article
  72. Zachary, W.W. 1977. “An Information Flow Model for Conflict and Fission in Small Groups”. Journal of Anthropological Research 33(4):452-73.
    Search in Google ScholarBack to article
DOI: https://doi.org/10.21307/joss-2020-002 | Journal eISSN: 1529-1227 | Journal ISSN: 2300-0422
Journal RSS Feed
Language: English
Page range: 35 - 76
Published on: Oct 1, 2020
Published by: International Network for Social Network Analysis (INSNA)
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Keywords:
Geodesic cycle,
Exponential random graph model,
ERGM,
-series random graphs,
Social networks,
Fictional networks,
Dissociative identity disorder
Related subjects:
Social sciences,
Social sciences, other

© 2020 Alex Stivala, published by International Network for Social Network Analysis (INSNA)
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Previous articleVolume 21 (2020): Issue 1 (January 2020)Next article