Pith. sign in

REVIEW 2 major objections 6 minor 154 references

Improving exponential-family random graph models for bipartite networks

T0 review · 2 major / 6 minor · reviewed 2026-08-09 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Bipartite ERGMs can model four-cycle closure without the usual degeneracy, the paper argues.

desk verdict Useful new bipartite ERGM four-cycle terms with careful derivations and real implementations; the near-degeneracy claim, however, is broader than the evidence. read the letter →

arxiv 2502.01892 v3 pith:RAQCUVKJ submitted 2025-02-03 stat.ME stat.AP

Alex Stivala , Peng Wang , Alessandro Lomi This is my paper · ORCID
classification stat.MEstat.AP
keywords bipartitegraphtwo-modenetworkexponential-familyrandommodelERGMfour-cyclenear-degeneracynode-orientedstatisticclosure
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Bipartite (two-mode) networks—people attending events, directors sitting on boards—cannot contain triangles, so the smallest sign of closure is a four-cycle. The paper argues that standard ERGM terms often used for closure, the alternating k-two-path statistics K-CA and K-CP, are rarely used because they count open paths and stars as much as cycles and frequently push estimation into near-degenerate phase transitions. It proposes new statistics, BipartiteFourCyclesNodePowerA and B, that count four-cycles per node and raise each count to a power alpha before summing. In simulation, these new terms generate smoothly varying numbers of four-cycles where the old terms jump abruptly. If the advantage holds, applied researchers gain a usable four-cycle closure parameter for two-mode networks.

What carries the argument

The central object is the node-oriented four-cycle statistic zFourCyclesNodePower($\alpha$) = sum_i [C4(i)]^$\alpha$, where C4(i) = sum_{j != i} binom(L2(i,j), 2) and L2(i,j) is the number of two-paths connecting i and j. Exponentiation before summing, the '$\alpha$-inside' weighting, means that additional four-cycles sharing the same node contribute less than cycles spread across distinct nodes, which gives the parameter its smoothing behavior. The bipartite variants sum only over nodes in mode A or mode B, allowing a model to treat closure asymmetrically in the two modes. The change statistic for adding an edge depends on the two-neighborhood of the dyad, placing these configurations in the D2 dependence class rather than the 'social circuit' class I1; moving away from shared-partner counting is, in the paper's account, what avoids the near-degeneracy of the earlier alternating terms.

What would settle it

Run the same parameter sweep for BipartiteFourCyclesNodePowerA on a sparser network or a network with more nodes, for example 5000 A-nodes and 1000 B-nodes with an edge parameter chosen to keep density low, and inspect the Edge and FourCycles curves; a sharp jump in either curve at some alpha value would show that the phase transition is not actually removed, only shifted.

Watch

Extended reading notes

Core claim

The paper's central claim is that four-cycle closure in bipartite networks can be modeled by a node-oriented statistic that is not near-degenerate. For each node i the authors count C4(i), the number of four-cycles passing through it, and define zFourCyclesNodePower($\alpha$) = sum_i C4(i)^$\alpha$ with 0 < $\alpha$ <= 1, the '$\alpha$-inside' weighting; restricting the sum to one mode gives the bipartite A and B statistics. Unlike K-CA and K-CP, which weight two-paths and therefore respond to open paths, stars, and long cycles as well as four-cycles, these statistics are zero whenever no four-cycle is present. In the paper's main simulation, BipartiteAltKCyclesA shows a sharp phase transition in edge count and four-cycle count, while BipartiteFourCyclesNodePowerA rises smoothly, with smaller $\alpha$ smoothing the curve further. The paper also shows that removing the two-path term from K-CA and K-CP while staying in the same 'social circuit' dependence class makes degeneracy worse, and it locates the new configurations in the D2 dependence class as a consequence of their node-oriented construction.

Load-bearing premise

The paper's case that the new terms avoid near-degeneracy rests on simulation at one network size (750 A-nodes, 250 B-nodes) with one fixed set of edge and star parameters; if the smoothing does not hold at other sizes, densities, or parameter combinations, the central advantage over existing terms is not established.

Editorial extensions

If this is right

  • Published bipartite ERGM applications rarely include four-cycle terms, and the paper's survey shows that models that do include existing terms often fail to converge; the new terms provide an explicit four-cycle parameter that can be estimated at least in the demonstrated simulation and example settings.
  • Because the A and B variants are separate, researchers can model closure concentrated on one mode versus the other, at the cost of a less specific dependence assumption (D2 rather than I1).
  • The weighting exponent alpha is fixed rather than estimated; the paper identifies this as a limitation and points to a possible curved-ERGM extension.
  • The empirical example on the Southern Women network converges with the new B-mode term, but models without any four-cycle term already fit four-cycles well, so the example does not by itself establish practical necessity.
  • Fitting six-cycles as a closure measure would likely require another weighted configuration in an even more general dependence class, a direction the paper leaves open.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the smoothing generalizes beyond the single simulated network size, alpha can be read as a practical dial: small alpha trades some interpretability for a much wider estimable range of four-cycle strength, which could make closure terms usable in large sparse affiliation networks.
  • Because K-CA and K-CP mix two-path, star, and cycle effects, published negative estimates for those parameters may partly reflect density or star avoidance rather than absence of closure; the new statistics could disentangle these in re-analyses of existing bipartite datasets.
  • One testable extension is to compare the new terms against a simple four-cycle parameter inside a tapered ERGM on the same simulated networks; if the simple parameter also avoids degeneracy, the advantage is not unique to the node-power construction.
  • Another extension, which the paper mentions as future work, is to estimate alpha from data and check whether the resulting curved ERGM preserves the smooth behavior.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 6 minor

Summary. This paper addresses the rarity of four-cycle terms in bipartite ERGMs. It argues that the existing K-CA/K-CP (alternating two-path) statistics count many non-four-cycle structures such as open two-paths and stars, proposes a simple modification (BipartiteAltK4CyclesA/B), shows by simulation that this modification is even more prone to near-degeneracy, and then proposes the node-oriented FourCyclesNodePower and BipartiteFourCyclesNodePowerA/B statistics with α-inside weighting. The paper derives change statistics, places the new configuration in the D2 dependence class, implements the terms in EstimNetDirected and as statnet user terms, compares the new A-mode term with BipartiteAltKCyclesA in simulations, and illustrates the implementation on the Southern Women network.

Significance. If the near-degeneracy claims are correct, the paper provides a usable four-cycle closure term for bipartite ERGMs, filling a gap documented by its own 117-model literature survey and clarifying why existing K-C terms are not interpretable as pure closure terms. The derivations in Section 6.2 are careful, the relationship of the statistic to C4(i) is transparent, and α is a fixed user choice, so there is no circularity in the definition. The authors also provide reproducible implementations and explicit sampler settings (burn-in, interval, sample size), which strengthens the empirical part. The main unresolved risk is the breadth of the central degeneracy comparison, described in the major comments below.

major comments (2)
  1. [Section 6 (final paragraph) and Section 7 (Fig. 8)] The central claim that BipartiteFourCyclesNodePowerA/B are "less prone to problems with near-degeneracy than the simple four-cycles parameter or the K-CA and K-CP parameters" is not tested for the simple four-cycle parameter. The Section 7 simulations compare only BipartiteAltKCyclesA (left column) with BipartiteFourCyclesNodePowerA (right column); no simulation includes cycle(4)/C4, even though the simple four-cycle term is part of the quoted claim. The small-network experiments in Section 5 also do not include a C4 comparison. Either add direct simulations of the C4 parameter under comparable settings, or restrict the claim to improvement over K-CA/K-CP.
  2. [Section 7 (simulation design)] The evidence for the smoothing effect rests on a single configuration: N_A=750, N_B=250, Edge=-8.50, BipartiteAltStarsA=-0.20, BipartiteAltStarsB=2.00, with λ∈{2,5,10} and α∈{0.1,0.2,0.5}. The conclusion that decreasing α smooths the phase transition would be more convincing with variation in network size, density, or star parameters, especially because Fig. 1(c) shows that for a smaller network (N_A=30, N_B=20) the new B-term with α=0.5 still displays an abrupt jump from near-empty to full. A theoretical degeneracy analysis is not required, but the current empirical basis is too narrow for the general wording of the conclusion.
minor comments (6)
  1. [Section 3] There is a typo in the text after Table 2: "gwb1dsp pr gwb2dsp" should be "gwb1dsp or gwb2dsp".
  2. [Table 4 caption] The caption misspells BipartiteAltK4CyclesA as "BipartieAltK4CyclesA".
  3. [Section 8] There is a duplicated article in "using the the statnet ergm package".
  4. [Figure 1 caption] The caption contains "Fig, 9 of Wang et al."; the comma should be a period or colon.
  5. [Section 7] The text says "even for the highest value of α (1/2)", but α=1 is allowed by the definition and is not simulated; the claim should be qualified as the highest value tested.
  6. [Section 8] The Southern Women example does not establish practical necessity for the new terms, since Model 1 without any four-cycle term fits the four-cycle counts well, as the authors acknowledge. This is acceptable as an implementation and interpretation illustration, but the text should state this limitation explicitly at the point of presenting Model 4.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the new statistics and change statistics are defined directly from four-cycle counts, and the near-degeneracy advantage is an empirical simulation claim rather than a tautology.

full rationale

The derivation chain is self-contained. The new statistics are defined directly from four-cycle counts per node (Eqs. 13-15), the change statistics are derived analytically from those definitions (Eqs. 26-27), and the weighting exponent alpha is a fixed user choice rather than a parameter fitted to the data. The central claim that BipartiteFourCyclesNodePowerA/B show less near-degeneracy than BipartiteAltKCyclesA is supported by the simulation experiments in Section 7, which are described with explicit network sizes, parameter values, and MCMC settings; the result is an empirical property of the model, not a consequence of the statistic's definition by construction. The paper's self-citations are to the authors' own software (EstimNetDirected), to the prior K-CA/K-CP definitions that the paper explicitly seeks to improve, and to the dependence-hierarchy proposition of Pattison et al. (2024); none of these supplies the main empirical claim. The cited dependence-classification result is an external mathematical criterion, and the paper also gives direct graph-theoretic reasoning for placing the configuration in D2 rather than D1 or PI2. The paper frankly acknowledges limitations, including the fixed-alpha weighting, the more general dependence class without theoretical justification, and the computational cost, which further indicates that no fitted input is being relabeled as a prediction. The main weakness, that the degeneracy comparison is run at one network size and one edge/star specification and does not simulate the simple four-cycle term, is a scope and generalizability concern, not circularity.

Assumptions & free parameters 2 free parameters · 3 assumptions · 0 invented entities

The central contribution is a new network statistic, not a new physical entity. The main free parameter is alpha, chosen by the user; lambda for baseline terms is also fixed in comparisons. The simulation evidence relies on standard ERGM MCMC assumptions and on the correctness of the four-cycle counting formula.

free parameters (2)
  • alpha (α) exponent = not fitted; user chooses (default 0.5; examples 1/10, 1/5, 1/2)
    Controls the degree of alpha-inside weighting of node four-cycle counts. The statistic's behavior and the degeneracy properties depend on this choice, and the paper fixes it rather than estimating it.
  • lambda (λ) for existing alternating terms = 2, 5, 10 in simulations
    Used in the comparison baseline BipartiteAltKCyclesA. Not a new parameter, but the comparison depends on these fixed values.
assumptions (3)
  • domain assumption MCMC sampling (TNT sampler) converges to the ERGM distribution for the simulated parameter settings; burn-in 10^7 and interval 10^5 are sufficient.
    Required for the Figure 8 smoothness evidence and the near-degeneracy comparison.
  • standard math ERGM normalizing constant and Markov dependence assumptions are standard; the dependence hierarchy of Pattison and Snijders applies.
    Used in Section 6.3 to place the new statistic in dependence class D2.
  • standard math The formula C4 = (1/2) * sum_{i<j} C(L2(i,j), 2) correctly counts four-cycles in bipartite graphs.
    Basis of the new statistic; a standard combinatorial identity.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Improving exponential-family random graph models for bipartite networks." pith.science (2026). https://pith.science/paper/RAQCUVKJ

@misc{pith2026250201892,
  author       = {Pith},
  title        = {Pith review of: Improving exponential-family random graph models for bipartite networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/RAQCUVKJ}},
  note         = {Machine review of arXiv:2502.01892}
}
read the original abstract

Bipartite graphs, representing two-mode networks, arise in many research fields. These networks have two disjoint node sets representing distinct entity types, for example persons and groups, with edges representing associations between the two entity types. In bipartite graphs, the smallest possible cycle is a cycle of length four, and hence four-cycles are the smallest structure to model closure in such networks. Exponential-family random graph models (ERGMs) are a widely used model for social, and other, networks, including specifically bipartite networks. Existing ERGM terms to model four-cycles in bipartite networks, however, are relatively rarely used. In this work we demonstrate some problems with these existing terms to model four-cycles, and define new ERGM terms to help overcome these problems. The position of the new terms in the ERGM dependence hierarchy, and their interpretation, is discussed. The new terms are demonstrated in simulation experiments, and their application illustrated on a canonical example of an empirical two-mode network.

Figures

Figures reproduced from arXiv: 2502.01892 by the authors.

Figure 1
Figure 1. Effect of varying (a) the BipartiteAltKCyclesB parameter, (b) the BipartiteAltK4CyclesB parameter, and (c) the Bipar [PITH_FULL_IMAGE:figures/full_fig_p009_1.png] view at source ↗
Figure 2
Figure 2. C4(i) is the number of four-cycles involving a node i. The statistics described in this section so far are equally applicable to one-mode and two-mode (bipartite) graphs. When dealing with bipartite graphs, however, it is often useful to consider statistics of the two node sets separately. Hence we also define zBipartiteFourCyclesNodePowerA(α) = ∑ i∈A [C4(i) α ] (14) and zBipartiteFourCyclesNodePowerB(α) = ∑ j∈B [C4… view at source ↗
Figure 3
Figure 3. Representations of the new configurations (a) FourCyclesNodePower, (b) BipartiteFourCyclesNodePowerA, and (c) [PITH_FULL_IMAGE:figures/full_fig_p011_3.png] view at source ↗
Figures from the paper (6 more)
Figure 4
Figure 4. Figure 4: Effect of different combinations of negative, zero, and positive values of the BipartiteFourCyclesNodePowerA and [PITH_FULL_IMAGE:figures/full_fig_p013_4.png]
Figure 5
Figure 5. Figure 5: Examples of networks simulated with different combinations of negative, zero, and positive values of the Bipartite [PITH_FULL_IMAGE:figures/full_fig_p014_5.png]
Figure 6
Figure 6. Figure 6: For each combination of negative, zero, and positive values of the BipartiteFourCyclesNodePowerA and Bipartite [PITH_FULL_IMAGE:figures/full_fig_p015_6.png]
Figure 7
Figure 7. Figure 7: Dependence hierarchy, adapted from Wang et al. [22, [PITH_FULL_IMAGE:figures/full_fig_p016_7.png]
Figure 8
Figure 8. Figure 8: Effect of varying the BipartiteAltKCyclesA parameter (left) and BipartiteFourCyclesNodePowerA parameter (right) [PITH_FULL_IMAGE:figures/full_fig_p018_8.png]
Figure 9
Figure 9. Figure 9: Cycle length distribution goodness-of-fit plots for the Southern Women network ERGM (Table 5) Model 1 (top left), [PITH_FULL_IMAGE:figures/full_fig_p020_9.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

154 extracted references · 78 canonical work pages

  1. [1]

    The duality of persons and groups.Soc Forces, 53(2):181–190, 1974

    Ronald L Breiger. The duality of persons and groups.Soc Forces, 53(2):181–190, 1974

    1974

  2. [2]

    Neal, Annabell Cadieux, Diego Garlaschelli, Nicholas J

    Zachary P. Neal, Annabell Cadieux, Diego Garlaschelli, Nicholas J. Gotelli, Fabio Saracco, Tiziano Squar- tini, Shade T. Shutters, Werner Ulrich, Guanyang Wang, and Giovanni Strona. Pattern detection in bipartite networks: A review of terminology, applications, and methods.PLOS Complex Syst, 1(2):e0000010, 10 2024

    2024

  3. [3]

    Exponential random graph models for multilevel networks.Soc Netw, 35(1):96–115, 2013

    Peng Wang, Garry Robins, Philippa Pattison, and Emmanuel Lazega. Exponential random graph models for multilevel networks.Soc Netw, 35(1):96–115, 2013

    2013

  4. [4]

    Basic notions for the analysis of large two- mode networks.Soc Netw, 30(1):31–48, 2008

    Matthieu Latapy, Clémence Magnien, and Nathalie Del Vecchio. Basic notions for the analysis of large two- mode networks.Soc Netw, 30(1):31–48, 2008

    2008

  5. [5]

    The dual-projection approach for two-mode networks.Soc Netw, 35(2):204–210, 2013

    Martin G Everett and Stephen P Borgatti. The dual-projection approach for two-mode networks.Soc Netw, 35(2):204–210, 2013

    2013

  6. [6]

    Centrality and the dual-projection approach for two-mode social network data.Method Innov, 9:2059799116630662, 2016

    Martin G Everett. Centrality and the dual-projection approach for two-mode social network data.Method Innov, 9:2059799116630662, 2016

    2016

  7. [7]

    Granovetter

    Mark S. Granovetter. The strength of weak ties.Am J Sociol, 78(6):1360–1380, 1973

    1973

  8. [8]

    Weisstein

    Eric W. Weisstein. Bipartite graph. From MathWorld—A Wolfram Web Resource.https://mathworld. wolfram.com/BipartiteGraph.html, 2024

    2024

Show all 154 references
  1. [9]

    Small worlds among interlocking directors: Network structure and distance in bipartite graphs.Comput Math Organ Theory, 10(1):69–94, 2004

    Garry Robins and Malcolm Alexander. Small worlds among interlocking directors: Network structure and distance in bipartite graphs.Comput Math Organ Theory, 10(1):69–94, 2004

    2004

  2. [10]

    Triadic closure in two-mode networks: Redefining the global and local clustering coefficients

    Tore Opsahl. Triadic closure in two-mode networks: Redefining the global and local clustering coefficients. Soc Netw, 35(2):159–167, 2013

    2013

  3. [11]

    Modelling the evolution of a bipartite network—peer referral in inter- locking directorates.Soc Netw, 34(3):309–322, 2012

    Johan Koskinen and Christofer Edling. Modelling the evolution of a bipartite network—peer referral in inter- locking directorates.Soc Netw, 34(3):309–322, 2012

    2012

  4. [12]

    Transitivity and degree assortativity explained: The bipartite structure of social networks.Phys Rev E, 101(5):052305, 2020

    Demival Vasques Filho and Dion RJ O’Neale. Transitivity and degree assortativity explained: The bipartite structure of social networks.Phys Rev E, 101(5):052305, 2020

    2020

  5. [13]

    The role of bipartite structure in R&D collaboration networks

    Demival Vasques Filho and Dion RJ O’Neale. The role of bipartite structure in R&D collaboration networks. J Complex Netw, 8(4):cnaa016, 10 2020

    2020

  6. [14]

    Structural Analysis in the Social Sciences

    Dean Lusher, Johan Koskinen, and Garry Robins, editors.Exponential Random Graph Models for Social Net- works: Theory, Methods, and Applications. Structural Analysis in the Social Sciences. Cambridge University Press, New York, 2013

    2013

  7. [15]

    Social network modeling.Annu Rev Stat Appl, 5:343– 369, 2018

    Viviana Amati, Alessandro Lomi, and Antonietta Mira. Social network modeling.Annu Rev Stat Appl, 5:343– 369, 2018

    2018

  8. [16]

    Koskinen

    J. Koskinen. Exponential random graph modelling. In P. Atkinson, S. Delamont, A. Cernat, J.W. Sakshaug, and R.A. Williams, editors,SAGE Research Methods Foundations. SAGE, London, 2020.https://doi. org/10.4135/9781526421036888175

    2020 doi

  9. [17]

    Exponential random graph models

    Johan Koskinen. Exponential random graph models. In John McLevey, John Scott, and Peter J Carrington, editors,The Sage Handbook of Social Network Analysis, chapter 33. Sage, second edition, 2023

    2023

  10. [18]

    The statistical physics of real-world networks.Nat Rev Phys, 1(1):58–71, 2019

    Giulio Cimini, Tiziano Squartini, Fabio Saracco, Diego Garlaschelli, Andrea Gabrielli, and Guido Caldarelli. The statistical physics of real-world networks.Nat Rev Phys, 1(1):58–71, 2019

    2019

  11. [19]

    A survey on exponential random graph models: an application perspective.PeerJ Comput Sci, 6:e269, 2020

    Saeid Ghafouri and Seyed Hossein Khasteh. A survey on exponential random graph models: an application perspective.PeerJ Comput Sci, 6:e269, 2020. 28

    2020

  12. [20]

    Generating synthetic power grids using expo- nential random graph models.PRX Energy, 3(2):023005, 2024

    Francesco Giacomarra, Gianmarco Bet, and Alessandro Zocca. Generating synthetic power grids using expo- nential random graph models.PRX Energy, 3(2):023005, 2024

    2024

  13. [21]

    Exponential random graph (p*) models for affiliation networks.Soc Netw, 31(1):12–25, 2009

    Peng Wang, Ken Sharpe, Garry L Robins, and Philippa E Pattison. Exponential random graph (p*) models for affiliation networks.Soc Netw, 31(1):12–25, 2009

    2009

  14. [22]

    Exponential random graph model specifications for bipartite networks—a dependence hierarchy.Soc Netw, 35(2):211–222, 2013

    Peng Wang, Philippa Pattison, and Garry Robins. Exponential random graph model specifications for bipartite networks—a dependence hierarchy.Soc Netw, 35(2):211–222, 2013

    2013

  15. [23]

    Exponential random graph model extensions: Models for multiple networks and bipartite net- works

    Peng Wang. Exponential random graph model extensions: Models for multiple networks and bipartite net- works. In Dean Lusher, Johan Koskinen, and Garry Robins, editors,Exponential Random Graph Models for Social Networks: Theory, Methods, and Applications, chapter 10, pages 115–...

    2013

  16. [24]

    Modeling homophily in exponential-family random graph models for bipartite networks.arXiv preprint arXiv:2312.05673v1, 2023

    Rashmi P Bomiriya, Alina R Kuvelkar, David R Hunter, and Steffen Triebel. Modeling homophily in exponential-family random graph models for bipartite networks.arXiv preprint arXiv:2312.05673v1, 2023

    2023 arXiv

  17. [25]

    Pattison and T.A.B

    Philippa E. Pattison and T.A.B. Snijders. Modeling social networks: Next steps. In Dean Lusher, Johan Kosk- inen, and Garry Robins, editors,Exponential Random Graph Models for Social Networks: Theory, Methods, and Applications, chapter 22, pages 287–301. Cambridge University P...

    2013

  18. [26]

    Constrained Monte Carlo maximum likelihood for dependent data.J R Stat Soc B, 54(3):657–683, 1992

    Charles J Geyer and Elizabeth A Thompson. Constrained Monte Carlo maximum likelihood for dependent data.J R Stat Soc B, 54(3):657–683, 1992

    1992

  19. [27]

    Tom A. B. Snijders. Markov chain Monte Carlo estimation of exponential random graph models.J Soc Struct, 3(2):1–40, 2002

    2002

  20. [28]

    Computational statistical methods for social network models.J Comput Graph Stat, 21(4):856–882, 2012

    David R Hunter, Pavel N Krivitsky, and Michael Schweinberger. Computational statistical methods for social network models.J Comput Graph Stat, 21(4):856–882, 2012

    2012

  21. [29]

    Auxiliary parameter MCMC for exponential random graph models.J Stat Phys, 165(4):740–754, 2016

    Maksym Byshkin, Alex Stivala, Antonietta Mira, Rolf Krause, Garry Robins, and Alessandro Lomi. Auxiliary parameter MCMC for exponential random graph models.J Stat Phys, 165(4):740–754, 2016

    2016

  22. [30]

    Fast maximum likeli- hood estimation via equilibrium expectation for large network data.Sci Rep, 8(1):11509, 2018

    Maksym Byshkin, Alex Stivala, Antonietta Mira, Garry Robins, and Alessandro Lomi. Fast maximum likeli- hood estimation via equilibrium expectation for large network data.Sci Rep, 8(1):11509, 2018

    2018

  23. [31]

    A simple algorithm for scalable Monte Carlo inference.arXiv preprint arXiv:1901.00533v4, 2020

    Alexander Borisenko, Maksym Byshkin, and Alessandro Lomi. A simple algorithm for scalable Monte Carlo inference.arXiv preprint arXiv:1901.00533v4, 2020

    1901 arXiv

  24. [32]

    Assessing degeneracy in statistical models of social networks

    Mark S Handcock. Assessing degeneracy in statistical models of social networks. Working Paper no. 39, Center for Statistics and the Social Sciences, University of Washington, 2003.https://csss.uw.edu/ Papers/wp39.pdf

    2003

  25. [33]

    Tom A. B. Snijders, Philippa E. Pattison, Garry L. Robins, and Mark S. Handcock. New specifications for exponential random graph models.Sociol Methodol, 36(1):99–153, 2006

    2006

  26. [34]

    Removing phase transitions from Gibbs measures

    Ian Fellows and Mark Handcock. Removing phase transitions from Gibbs measures. In Aarti Singh and Jerry Zhu, editors,Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, volume 54 ofProceedings of Machine Learning Research, pages 289–297,...

    2017

  27. [35]

    Instability, sensitivity, and degeneracy of discrete exponential families.J Am Stat Assoc, 106(496):1361–1370, 2011

    Michael Schweinberger. Instability, sensitivity, and degeneracy of discrete exponential families.J Am Stat Assoc, 106(496):1361–1370, 2011

    2011

  28. [36]

    Estimating and understanding exponential random graph models.Ann Stat, 41(5):2428–2461, 2013

    Sourav Chatterjee and Persi Diaconis. Estimating and understanding exponential random graph models.Ann Stat, 41(5):2428–2461, 2013

    2013

  29. [37]

    Consistent structure estimation of exponential-family random graph models with block structure.Bernoulli, 26(2):1205–1233, 2020

    Michael Schweinberger. Consistent structure estimation of exponential-family random graph models with block structure.Bernoulli, 26(2):1205–1233, 2020. 29

    2020

  30. [38]

    Practical network modeling via tapered exponential-family random graph models.J Comput Graph Stat, 32(2):388–401, 2023

    Bart Blackburn and Mark S Handcock. Practical network modeling via tapered exponential-family random graph models.J Comput Graph Stat, 32(2):388–401, 2023

    2023

  31. [39]

    Garry Robins, Tom A. B. Snijders, Peng Wang, Mark Handcock, and Philippa Pattison. Recent developments in exponential random graph (p∗) models for social networks.Soc Netw, 29(2):192–215, 2007

    2007

  32. [40]

    Koskinen and G

    J. Koskinen and G. Daraganova. Exponential random graph model fundamentals. In Dean Lusher, Johan Kosk- inen, and Garry Robins, editors,Exponential Random Graph Models for Social Networks: Theory, Methods, and Applications, chapter 6, pages 49–76. Cambridge University Press, N...

    2013

  33. [41]

    David R. Hunter. Curved exponential family models for social networks.Soc Netw, 29(2):216–230, 2007

    2007

  34. [42]

    Overcoming near-degeneracy in the autologistic actor attribute model.arXiv preprint arXiv:2309.07338v2, 2023

    Alex Stivala. Overcoming near-degeneracy in the autologistic actor attribute model.arXiv preprint arXiv:2309.07338v2, 2023

    2023 arXiv

  35. [43]

    Hunter and Mark S

    David R. Hunter and Mark S. Handcock. Inference in curved exponential family models for networks.J Comput Graph Stat, 15(3):565–583, 2006

    2006

  36. [44]

    Melbourne School of Psychological Sciences, The University of Melbourne, 2014.http://www.melnet.org.au/s/MPNetManual.pdf

    Peng Wang, Garry Robins, Philippa Pattison, and JH Koskinen.MPNet: Program for the simulation and esti- mation of (p*) exponential random graph models for multilevel networks. Melbourne School of Psychological Sciences, The University of Melbourne, 2014.http://www.melnet.org.a...

    2014

  37. [45]

    Peng Wang, Alex Stivala, Garry Robins, Philippa Pattison, Johan Koskinen, and Alessandro Lomi.PNet: Program for the simulation and estimation of (p*) exponential random graph models for multilevel networks, 2022.http://www.melnet.org.au/s/MPNetManual2022.pdf

    2022

  38. [46]

    P. Wang, G. Robins, and P. Pattison.PNet: program for the estimation and simulation of p∗ exponential random graph models. Department of Psychology, The University of Melbourne, 2009.https://www.melnet.o rg.au/s/PNetManual.pdf

    2009

  39. [47]

    Handcock, David R

    Mark S. Handcock, David R. Hunter, Carter T. Butts, Steven M. Goodreau, and Martina Morris. statnet: Software tools for the representation, visualization, analysis and simulation of network data.J Stat Softw, 24(1):1–11, 2008

    2008

  40. [48]

    ergm: A package to fit, simulate and diagnose exponential-family models for networks.J Stat Softw, 24(3):1–29, 2008

    David R Hunter, Mark S Handcock, Carter T Butts, Steven M Goodreau, and Martina Morris. ergm: A package to fit, simulate and diagnose exponential-family models for networks.J Stat Softw, 24(3):1–29, 2008

    2008

  41. [49]

    Hummel, David R

    Ruth M. Hummel, David R. Hunter, and Mark S. Handcock. Improving simulation-based algorithms for fitting ERGMs.J Comput Graph Stat, 21(4):920–939, 2012

    2012

  42. [50]

    Handcock, David R

    Mark S. Handcock, David R. Hunter, Carter T. Butts, Steven M. Goodreau, Pavel N. Krivitsky, Skye Bender- deMoll, and Martina Morris.statnet: Software Tools for the Statistical Analysis of Network Data. The Statnet Project (http://www.statnet.org), 2016. R package version 2019....

    2016

  43. [51]

    Handcock, David R

    Mark S. Handcock, David R. Hunter, Carter T. Butts, Steven M. Goodreau, Pavel N. Krivitsky, and Martina Morris.ergm: Fit, Simulate and Diagnose Exponential-Family Models for Networks. The Statnet Project (https://statnet.org), 2024. R package version 4.7.5.https://CRAN.R-proje...

    2024

  44. [52]

    Krivitsky, David R

    Pavel N. Krivitsky, David R. Hunter, Martina Morris, and Chad Klumb. ergm 4: New features for analyzing exponential-family random graph models.J Stat Softw, 105(6):1–44, 2023

    2023

  45. [53]

    ergm 4: Computational improvements

    Pavel N Krivitsky, David R Hunter, Martina Morris, and Chad Klumb. ergm 4: Computational improvements. arXiv preprint arXiv:2203.08198v1, 2022

    2022 arXiv

  46. [54]

    Bergm: Bayesian exponential random graphs in R.J Stat Softw, 61(2):1–25, 2014

    Alberto Caimo and Nial Friel. Bergm: Bayesian exponential random graphs in R.J Stat Softw, 61(2):1–25, 2014. 30

    2014

  47. [55]

    Statistical network analysis with Bergm.J Stat Softw, 104(1):1–23, 2022

    Alberto Caimo, Lampros Bouranis, Robert Krause, and Nial Friel. Statistical network analysis with Bergm.J Stat Softw, 104(1):1–23, 2022

    2022

  48. [56]

    Sustainable energy governance in South Tyrol (Italy): A probabilistic bipartite network model.J Clean Prod, 221:854–862, 2019

    Jessica Balest, Laura Secco, Elena Pisani, and Alberto Caimo. Sustainable energy governance in South Tyrol (Italy): A probabilistic bipartite network model.J Clean Prod, 221:854–862, 2019

    2019

  49. [57]

    Local structural properties and attribute characteristics in 2-mode networks: p* models to map choices of theater events.J Math Sociol, 32(3):204–237, 2008

    Filip Agneessens and Henk Roose. Local structural properties and attribute characteristics in 2-mode networks: p* models to map choices of theater events.J Math Sociol, 32(3):204–237, 2008

    2008

  50. [58]

    Benton and Jihae You

    Richard A. Benton and Jihae You. Endogenous dynamics in contentious fields: Evidence from the shareholder activism network, 2006–2013.Socius, 3:2378023117705231, 2017

    2006

  51. [59]

    Adapting to sea-level rise: Centralization or decentralization in polycentric governance systems?Policy Stud J, 50(1):143–175, 2022

    Mark Lubell and Matthew Robbins. Adapting to sea-level rise: Centralization or decentralization in polycentric governance systems?Policy Stud J, 50(1):143–175, 2022

    2022

  52. [60]

    Watts and Steven H

    Duncan J. Watts and Steven H. Strogatz. Collective dynamics of ‘small-world’ networks.Nature, 393(6684):440–442, 1998

    1998

  53. [61]

    Why social networks are different from other types of networks.Phys Rev E, 68(3):036122, 2003

    Mark EJ Newman and Juyong Park. Why social networks are different from other types of networks.Phys Rev E, 68(3):036122, 2003

    2003

  54. [62]

    Comparing the real-world performance of exponential-family random graph models and latent order logistic models for social network analysis.J R Stat Soc A, 185(2):566–587, 2022

    Duncan A Clark and Mark S Handcock. Comparing the real-world performance of exponential-family random graph models and latent order logistic models for social network analysis.J R Stat Soc A, 185(2):566–587, 2022

    2022

  55. [63]

    A new generative statistical model for graphs: The latent order logistic (LOLOG) model.arXiv preprint arXiv:1804.04583v1, 2018

    Ian E Fellows. A new generative statistical model for graphs: The latent order logistic (LOLOG) model.arXiv preprint arXiv:1804.04583v1, 2018

    2018 arXiv

  56. [64]

    Who speaks up to whom? a relational approach to employee voice.Soc Netw, 33(4):303–316, 2011

    Birgit Pauksztat, Christian Steglich, and Rafael Wittek. Who speaks up to whom? a relational approach to employee voice.Soc Netw, 33(4):303–316, 2011

    2011

  57. [65]

    Social context, spatial structure and social network structure.Soc Netw, 34(1):32–46, 2012

    Patrick Doreian and Norman Conti. Social context, spatial structure and social network structure.Soc Netw, 34(1):32–46, 2012. Capturing Context: Integrating Spatial and Social Network Analyses

    2012

  58. [66]

    Gygax, and Peng Wang

    Ling Heng Henry Wong, André F. Gygax, and Peng Wang. Board interlocking network and the design of executive compensation packages.Soc Netw, 41:85–100, 2015

    2015

  59. [67]

    Goodreau

    Steven M. Goodreau. Advances in exponential random graph (p ∗) models applied to a large social network. Soc Netw, 29(2):231–248, 2007

    2007

  60. [68]

    Relationship patterns in the 19th century: The friendship network in a German boys’ school class from 1880 to 1881 revisited.Soc Netw, 37:1–13, 2014

    Richard Heidler, Markus Gamper, Andreas Herz, and Florian Eßer. Relationship patterns in the 19th century: The friendship network in a German boys’ school class from 1880 to 1881 revisited.Soc Netw, 37:1–13, 2014

    2014

  61. [69]

    Social networks and spatial configuration—how office layouts drive so- cial interaction.Soc Netw, 34(1):47–58, 2012

    Kerstin Sailer and Ian McCulloh. Social networks and spatial configuration—how office layouts drive so- cial interaction.Soc Netw, 34(1):47–58, 2012. Capturing Context: Integrating Spatial and Social Network Analyses

    2012

  62. [70]

    Unpacking reputational power: Intended and unintended determinants of the assessment of actors’ power.Soc Netw, 42:60–71, 2015

    Manuel Fischer and Pascal Sciarini. Unpacking reputational power: Intended and unintended determinants of the assessment of actors’ power.Soc Netw, 42:60–71, 2015

    2015

  63. [71]

    A comparative study of social network models: Network evolution models and nodal attribute models.Soc Netw, 31(4):240–254, 2009

    Riitta Toivonen, Lauri Kovanen, Mikko Kivelä, Jukka-Pekka Onnela, Jari Saramäki, and Kimmo Kaski. A comparative study of social network models: Network evolution models and nodal attribute models.Soc Netw, 31(4):240–254, 2009

    2009

  64. [72]

    Online collective identity: The case of the environmental movement.Soc Netw, 33(3):177–190, 2011

    Robert Ackland and Mathieu O’Neil. Online collective identity: The case of the environmental movement.Soc Netw, 33(3):177–190, 2011

    2011

  65. [73]

    A p* primer: logit models for social networks

    Carolyn J Anderson, Stanley Wasserman, and Bradley Crouch. A p* primer: logit models for social networks. Soc Netw, 21(1):37–66, 1999. 31

    1999

  66. [74]

    Exponential random graph model parameter estimation for very large directed networks.PLoS One, 15(1):e0227804, 2020

    Alex Stivala, Garry Robins, and Alessandro Lomi. Exponential random graph model parameter estimation for very large directed networks.PLoS One, 15(1):e0227804, 2020

    2020

  67. [75]

    Differential impact of directors’ social and financial capital on corporate interlock formation

    Nicholas Harrigan and Matthew Bond. Differential impact of directors’ social and financial capital on corporate interlock formation. In Dean Lusher, Johan Koskinen, and Garry Robins, editors,Exponential Random Graph Models for Social Networks: Theory, Methods, and Applications...

    2013

  68. [76]

    Geodesic cycle length distributions in delusional and other social networks.J Soc Struct, 21(1):35–76, 2020

    Alex Stivala. Geodesic cycle length distributions in delusional and other social networks.J Soc Struct, 21(1):35–76, 2020

    2020

  69. [77]

    Geodesic cycle length distributions in fictional character networks.arXiv preprint arXiv:2303.11597v1, 2023

    Alex Stivala. Geodesic cycle length distributions in fictional character networks.arXiv preprint arXiv:2303.11597v1, 2023

    2023 arXiv

  70. [78]

    Comment on geodesic cycle length distributions in delusional and other social networks.J Soc Struct, 21(1):77–93, 2020

    John Levi Martin. Comment on geodesic cycle length distributions in delusional and other social networks.J Soc Struct, 21(1):77–93, 2020

    2020

  71. [79]

    Stochastic weighted graphs: Flexible model specification and simulation.Soc Netw, 49:37–47, 2017

    James D Wilson, Matthew J Denny, Shankar Bhamidi, Skyler J Cranmer, and Bruce A Desmarais. Stochastic weighted graphs: Flexible model specification and simulation.Soc Netw, 49:37–47, 2017

    2017

  72. [80]

    Pattison, Garry L

    Philippa E. Pattison, Garry L. Robins, Tom A.B. Snijders, and Peng Wang. Exponential random graph models and pendant-triangle statistics.Soc Netw, 79:187–197, 2024

    2024

  73. [81]

    Neighborhood–based models for social networks.Sociol Methodol, 32(1):301–337, 2002

    Philippa Pattison and Garry Robins. Neighborhood–based models for social networks.Sociol Methodol, 32(1):301–337, 2002

    2002

  74. [82]

    Building models for social space: Neighourhood-based models for social networks and affiliation structures.Math & Sci Hum, 42(168):11–29, 2004

    Philippa Pattison and Garry Robins. Building models for social space: Neighourhood-based models for social networks and affiliation structures.Math & Sci Hum, 42(168):11–29, 2004

    2004

  75. [83]

    Hunter, Steven M

    David R. Hunter, Steven M. Goodreau, and Mark S. Handcock. ergm.userterms: A template package for extending statnet.J Stat Softw, 52(2):1–25, 2013

    2013

  76. [84]

    Extending ERGM functionality within statnet: Building custom user terms.https://statnet.org/workshop-ergm-userterms/ergm.userterms_tutorial .pdf, 2019

    David R Hunter and Steven M Goodreau. Extending ERGM functionality within statnet: Building custom user terms.https://statnet.org/workshop-ergm-userterms/ergm.userterms_tutorial .pdf, 2019. Statnet Development Team

    2019

  77. [85]

    An efficient algorithm for enumerating chordless cycles and chordless paths

    Takeaki Uno and Hiroko Satoh. An efficient algorithm for enumerating chordless cycles and chordless paths. In Sašo Džeroski, Pan ˇce Panov, Dragi Kocev, and Ljup ˇco Todorovski, editors,International Conference on Discovery Science, volume 8777 ofLNAI, pages 313–324. Springer, 2014

    2014

  78. [86]

    R Foundation for Statistical Com- puting, Vienna, Austria, 2022

    R Core Team.R: A Language and Environment for Statistical Computing. R Foundation for Statistical Com- puting, Vienna, Austria, 2022

    2022

  79. [87]

    The igraph software package for complex network research.InterJournal, Complex Systems:1695, 2006

    Gábor Csárdi and Tamas Nepusz. The igraph software package for complex network research.InterJournal, Complex Systems:1695, 2006

    2006

  80. [88]

    igraph enables fast and robust network analysis across programming languages.arXiv preprint arXiv:2311.10260v1, 2023

    Michael Antonov, Gábor Csárdi, Szabolcs Horvát, Kirill Müller, Tamás Nepusz, Daniel Noom, Maëlle Salmon, Vincent Traag, Brooke Foucault Welles, and Fabio Zanini. igraph enables fast and robust network analysis across programming languages.arXiv preprint arXiv:2311.10260v1, 2023

    2023 arXiv

  81. [89]

    Springer-Verlag, New York, 2016

    Hadley Wickham.ggplot2: Elegant Graphics for Data Analysis. Springer-Verlag, New York, 2016

    2016

  82. [90]

    Specification of exponential-family random graph models: Terms and computational aspects.J Stat Softw, 24(4):1–24, 2008

    Martina Morris, Mark Handcock, and David Hunter. Specification of exponential-family random graph models: Terms and computational aspects.J Stat Softw, 24(4):1–24, 2008

    2008

  83. [91]

    University of Chicago Press, 1941

    Allison Davis, Burleigh B Gardner, Mary R Gardner, and W Lloyd Warner.Deep South: A sociological anthropological study of caste and class. University of Chicago Press, 1941

    1941

  84. [92]

    Krivitsky and Mark S

    Pavel N. Krivitsky and Mark S. Handcock. Fitting position latent cluster models for social networks with latentnet.J Stat Softw, 24(5), 2008. 32

    2008

  85. [93]

    Krivitsky and Mark S

    Pavel N. Krivitsky and Mark S. Handcock.latentnet: Latent Position and Cluster Models for Statisti- cal Networks. The Statnet Project (https://statnet.org), 2024. R package version 2.11.0. https://CRAN.R-project.org/package=latentnet

    2024

  86. [94]

    A dynamic model for the mutual constitution of individuals and events.J Complex Netw, 10(2):cnac004, 03 2022

    Jürgen Lerner and Alessandro Lomi. A dynamic model for the mutual constitution of individuals and events.J Complex Netw, 10(2):cnac004, 03 2022

    2022

  87. [95]

    Bipartite exponential random graph models with nodal random effects

    Sevag Kevork and Göran Kauermann. Bipartite exponential random graph models with nodal random effects. Soc Netw, 70:90–99, 2022

    2022

  88. [96]

    Measuring knowledge and experience in two mode temporal networks.Soc Netw, 55:63–73, 2018

    Martin G Everett, Chiara Broccatelli, Stephen P Borgatti, and Johan Koskinen. Measuring knowledge and experience in two mode temporal networks.Soc Netw, 55:63–73, 2018

    2018

  89. [97]

    texreg: Conversion of statistical model output in R to L ATEX and HTML tables.J Stat Softw, 55(8):1–24, 2013

    Philip Leifeld. texreg: Conversion of statistical model output in R to L ATEX and HTML tables.J Stat Softw, 55(8):1–24, 2013

    2013

  90. [98]

    Interpretation of gw-degree estimates in ERGMs, June 2016.https://doi.org/10.6084/m9.figshare.3465020.v1

    Michael Levy, Mark Lubell, Philip Leifeld, and Skyler Cranmer. Interpretation of gw-degree estimates in ERGMs, June 2016.https://doi.org/10.6084/m9.figshare.3465020.v1

    2016 doi

  91. [99]

    gwdegree: Improving interpretation of geometrically-weighted degree estimates in exponential random graph models.J Open Source Softw, 1(3):36, 2016

    Michael Levy. gwdegree: Improving interpretation of geometrically-weighted degree estimates in exponential random graph models.J Open Source Softw, 1(3):36, 2016

    2016

  92. [100]

    Comment on geodesic cycle length distributions in delusional and other social net- works

    Alex Stivala. Reply to “Comment on geodesic cycle length distributions in delusional and other social net- works”.J Soc Struct, 21(1):94–106, 2020

    2020

  93. [101]

    Handcock, Pavel N

    Mark S. Handcock, Pavel N. Krivitsky, and Ian Fellows.ergm.tapered: Tapered Exponential-Family Models for Networks, 2022. R package version 1.1-0.https://github.com/statnet/ergm.tapered

    2022

  94. [102]

    New network models facilitate analysis of biological networks.arXiv preprint arXiv:2312.06047v1, 2023

    Alex Stivala. New network models facilitate analysis of biological networks.arXiv preprint arXiv:2312.06047v1, 2023

    2023 arXiv

  95. [103]

    Fellows.lolog: Latent Order Logistic Graph Models, 2023

    Ian E. Fellows.lolog: Latent Order Logistic Graph Models, 2023. R package version 1.3.1.https://CRAN .R-project.org/package=lolog

    2023

  96. [104]

    Choices of theatre events: p* models for affiliation networks with attributes.Metod Zv, 1(2):419–439, 2004

    Filip Agneessens, Henk Roose, and Hans Waege. Choices of theatre events: p* models for affiliation networks with attributes.Metod Zv, 1(2):419–439, 2004

    2004

  97. [105]

    Bridging and bonding capital in two-mode collaboration networks.Policy Stud J, 42(2):197– 225, 2014

    Ramiro Berardo. Bridging and bonding capital in two-mode collaboration networks.Policy Stud J, 42(2):197– 225, 2014

    2014

  98. [106]

    Modeling multi-year customers’ considerations and choices in China’s auto market using two-stage bipartite network analysis.Netw Spat Econ, 21(2):365–385, 2021

    Youyi Bi, Yunjian Qiu, Zhenghui Sha, Mingxian Wang, Yan Fu, Noshir Contractor, and Wei Chen. Modeling multi-year customers’ considerations and choices in China’s auto market using two-stage bipartite network analysis.Netw Spat Econ, 21(2):365–385, 2021

    2021

  99. [107]

    The bases of elite social behaviour: Patterns of club affiliation among members of the House of Lords.Sociology, 46(4):613–632, 2012

    Matthew Bond. The bases of elite social behaviour: Patterns of club affiliation among members of the House of Lords.Sociology, 46(4):613–632, 2012

    2012

  100. [108]

    Interrelated issues and over- lapping policy sectors: Swiss water politics.http://nbn-resolving.de/urn:nbn:de:bsz: 352-0-294740, 2015

    Laurence Brandenberger, Isabelle Schläpfer, Philip Leifeld, and Manuel Fischer. Interrelated issues and over- lapping policy sectors: Swiss water politics.http://nbn-resolving.de/urn:nbn:de:bsz: 352-0-294740, 2015

    2015

  101. [109]

    The dual network structure of organizational problem solving: A case study on open source software development.Soc Netw, 35(2):237–250, 2013

    Guido Conaldi and Alessandro Lomi. The dual network structure of organizational problem solving: A case study on open source software development.Soc Netw, 35(2):237–250, 2013

    2013

  102. [110]

    Drivers and consequences of structure in plant–lemur ecological networks.J Anim Ecol, 91(10):2010–2022, 2022

    Camille DeSisto and James Paul Herrera. Drivers and consequences of structure in plant–lemur ecological networks.J Anim Ecol, 91(10):2010–2022, 2022

    2010

  103. [111]

    Duxbury and Dana L

    Scott W. Duxbury and Dana L. Haynie. Building them up, breaking them down: Topology, vendor selection patterns, and a digital drug market’s robustness to disruption.Soc Netw, 52:238–250, 2018. 33

    2018

  104. [112]

    The network structure of opioid distribution on a darknet cryptomarket

    Scott W Duxbury and Dana L Haynie. The network structure of opioid distribution on a darknet cryptomarket. J Quant Criminol, 34(4):921–941, 2018

    2018

  105. [113]

    Scaling and statistical models for affiliation networks: patterns of participation among Soviet politicians during the Brezhnev era.Soc Netw, 24(3):231–259, 2002

    Katherine Faust, Karin E Willert, David D Rowlee, and John Skvoretz. Scaling and statistical models for affiliation networks: patterns of participation among Soviet politicians during the Brezhnev era.Soc Netw, 24(3):231–259, 2002

    2002

  106. [114]

    Closing integrative gaps in complex environmental governance systems.Ecol Soc, 27(1):15, 2022

    Harrison S Fried, Matthew Hamilton, and Ramiro Berardo. Closing integrative gaps in complex environmental governance systems.Ecol Soc, 27(1):15, 2022

    2022

  107. [115]

    Modelling the large and dynamically growing bipartite network of German patents and inventors.J R Stat Soc Ser A Stat Soc, 186(3):557–576, 03 2023

    Cornelius Fritz, Giacomo De Nicola, Sevag Kevork, Dietmar Harhoff, and Göran Kauermann. Modelling the large and dynamically growing bipartite network of German patents and inventors.J R Stat Soc Ser A Stat Soc, 186(3):557–576, 03 2023

    2023

  108. [116]

    Functional roles of frugivores and plants shape hyper-diverse mutualistic interactions under two antagonistic conservation scenar- ios.Biotropica, 54(2):444–454, 2022

    Lisieux Fuzessy, Gisela Sobral, Daiane Carreira, Débora Cristina Rother, Gedimar Barbosa, Mariana Landis, Mauro Galetti, Tad Dallas, Vinícius Cardoso Cláudio, Laurence Culot, and Pedro Jordano. Functional roles of frugivores and plants shape hyper-diverse mutualistic interacti...

    2022

  109. [117]

    Transaction costs, power, and multi-level forest governance in Indonesia.Ecol Econ, 114:168–179, 2015

    Caleb Gallemore, Monica Di Gregorio, Moira Moeliono, Maria Brockhaus, and Rut Dini Prasti H. Transaction costs, power, and multi-level forest governance in Indonesia.Ecol Econ, 114:168–179, 2015

    2015

  110. [118]

    The local and global structure of knowledge production in an emergent research field: An exponential random graph analysis.Soc Netw, 33(1):20–30, 2011

    Neha Gondal. The local and global structure of knowledge production in an emergent research field: An exponential random graph analysis.Soc Netw, 33(1):20–30, 2011

    2011

  111. [119]

    Neha Gondal. Duality of departmental specializations and PhD exchange: A Weberian analysis of status in interaction using multilevel exponential random graph models (mERGM).Soc Netw, 55:202–212, 2018

    2018

  112. [120]

    Cross-level linkages in an ecology of climate change adaptation policy games.Ecol Soc, 23(2):36, 2018

    Matthew Hamilton, Mark Lubell, and Emilinah Namaganda. Cross-level linkages in an ecology of climate change adaptation policy games.Ecol Soc, 23(2):36, 2018

    2018

  113. [121]

    Using affiliation networks to study the determinants of multilateral research cooperation: some empirical evidence from eu framework programs in biotechnology

    Cilem Hazir and Corinne Autant-Bernard. Using affiliation networks to study the determinants of multilateral research cooperation: some empirical evidence from eu framework programs in biotechnology. Working Paper 1212, GATE, 2012.https://doi.org/10.2139/ssrn.2060275

    2012 doi

  114. [122]

    Heaney and Philip Leifeld

    Michael T. Heaney and Philip Leifeld. Contributions by interest groups to lobbying coalitions.J Polit, 80(2):494–509, 2018

    2018

  115. [123]

    The formation of task-oriented groups: Exploring combat activities in online games

    Yun Huang, Mengxiao Zhu, Jing Wang, Nishith Pathak, Cuihua Shen, Brian Keegan, Dmitri Williams, and Noshir Contractor. The formation of task-oriented groups: Exploring combat activities in online games. In 2009 International Conference on Computational Science and Engineering,...

    2009

  116. [124]

    Baseline models for two-mode social network data.Policy Stud J, 40(3):458–491, 2012

    Lorien Jasny. Baseline models for two-mode social network data.Policy Stud J, 40(3):458–491, 2012

    2012

  117. [125]

    Two-mode brokerage in policy networks.Soc Netw, 41:36–47, 2015

    Lorien Jasny and Mark Lubell. Two-mode brokerage in policy networks.Soc Netw, 41:36–47, 2015

    2015

  118. [126]

    Do editors or articles drive collaboration? multilevel statistical network analysis of Wikipedia coauthorship

    Brian Keegan, Darren Gergle, and Noshir Contractor. Do editors or articles drive collaboration? multilevel statistical network analysis of Wikipedia coauthorship. InProceedings of the ACM 2012 Conference on Com- puter Supported Cooperative Work, CSCW ’12, page 427–436, New Yor...

    2012

  119. [127]

    Demonstration of exponential random graph models in tourism studies: Is tourism a means of global peace or the bottom line?Ann Tour Res, 69:31–41, 2018

    Jalayer Khalilzadeh. Demonstration of exponential random graph models in tourism studies: Is tourism a means of global peace or the bottom line?Ann Tour Res, 69:31–41, 2018

    2018

  120. [128]

    Modeling resource network relationships between re- sponse organizations and affected neighborhoods after a technological disaster.Voluntas, 28(5):2145–2175, 2017

    Chih-Hui Lai, Chen-Chao Tao, and Yu-Chung Cheng. Modeling resource network relationships between re- sponse organizations and affected neighborhoods after a technological disaster.Voluntas, 28(5):2145–2175, 2017

    2017

  121. [129]

    National parliamentary coordination after Lisbon: A network approach

    Philip Leifeld and Thomas Malang. National parliamentary coordination after Lisbon: A network approach. Paper prepared for the 1st European Conference on Social Networks (EUSN), Barcelona, Spain, July 2014. 34

    2014

  122. [130]

    Local interactions and homophily effects in actor collaboration networks for urban resilience governance.Appl Netw Sci, 6(1):89, 2021

    Qingchun Li and Ali Mostafavi. Local interactions and homophily effects in actor collaboration networks for urban resilience governance.Appl Netw Sci, 6(1):89, 2021

    2021

  123. [131]

    Doctors’ preferences in the selection of patients in online medical consultations: an empirical study with doctor–patient consultation data.Healthcare, 10(8):1435, 2022

    Yingjie Lu and Qian Wang. Doctors’ preferences in the selection of patients in online medical consultations: an empirical study with doctor–patient consultation data.Healthcare, 10(8):1435, 2022

    2022

  124. [132]

    Network structure and institutional complexity in an ecology of water management games.Ecol Soc, 19(4):23, 2014

    Mark Lubell, Garry Robins, and Peng Wang. Network structure and institutional complexity in an ecology of water management games.Ecol Soc, 19(4):23, 2014

    2014

  125. [133]

    Team formation and performance on nanoHub: a network selection challenge in scientific communities

    Drew Margolin, K Ognyanoya, Meikuan Huang, Yun Huang, and Noshir Contractor. Team formation and performance on nanoHub: a network selection challenge in scientific communities. In Balázs Vedres and Marco Scotti, editors,Networks in Social Policy Problems, chapter 5, page 80–10...

    2012

  126. [134]

    Rebecca L Mauldin, Carin Wong, Jason Fernandez, and Kayo Fujimoto. Network modeling of assisted living facility residents’ attendance at programmed group activities: Proximity and social contextual correlates of attendance.Gerontologist, 61(5):703–713, 2021

    2021

  127. [135]

    Policy networks, stakeholder interactions and climate adaptation in the region of South East Queensland, Australia.Reg Environ Change, 14(2):527–539, 2014

    Ryan RJ McAllister, Rod McCrea, and Mark N Lubell. Policy networks, stakeholder interactions and climate adaptation in the region of South East Queensland, Australia.Reg Environ Change, 14(2):527–539, 2014

    2014

  128. [136]

    From local to central: a network analysis of who manages plant pest and disease outbreaks across scales.Ecol Soc, 20(1):67, 2015

    Ryan RJ McAllister, Catherine J Robinson, Kirsten Maclean, Angela M Guerrero, Kerry Collins, Bruce M Taylor, and Paul J De Barro. From local to central: a network analysis of who manages plant pest and disease outbreaks across scales.Ecol Soc, 20(1):67, 2015

    2015

  129. [137]

    Partnership networks for urban development: how structure is shaped by risk.Policy Stud J, 43(3):379–398, 2015

    Ryan RJ McAllister, Bruce M Taylor, and Ben P Harman. Partnership networks for urban development: how structure is shaped by risk.Policy Stud J, 43(3):379–398, 2015

    2015

  130. [138]

    Balancing collaboration with coordination: contesting eradication in the Australian plant pest and disease biosecurity system.Int J Commons, 11(1):330–354, 2017

    Ryan RJ McAllister, Catherine J Robinson, Alinta Brown, Kirsten Maclean, Suzy Perry, and Shuang Liu. Balancing collaboration with coordination: contesting eradication in the Australian plant pest and disease biosecurity system.Int J Commons, 11(1):330–354, 2017

    2017

  131. [139]

    Interdependent policy instrument preferences: a two-mode network approach.J Public Policy, 39(4):609–636, 2019

    Florence Metz, Philip Leifeld, and Karin Ingold. Interdependent policy instrument preferences: a two-mode network approach.J Public Policy, 39(4):609–636, 2019

    2019

  132. [140]

    Anne-Marie Niekamp, Liesbeth AG Mercken, Christian JPA Hoebe, and Nicole HTM Dukers-Muijrers. A sexual affiliation network of swingers, heterosexuals practicing risk behaviours that potentiate the spread of sexually transmitted infections: a two-mode approach.Soc Netw, 35(2):2...

    2013

  133. [141]

    Collaboration networks in applied conservation projects across Europe.PLoS One, 11(10):e0164503, 2016

    Andreea Nita, Laurentiu Rozylowicz, Steluta Manolache, Cristiana Maria Cioc ˘anea, Iulia Viorica Miu, and Viorel Dan Popescu. Collaboration networks in applied conservation projects across Europe.PLoS One, 11(10):e0164503, 2016

    2016

  134. [142]

    Offline constraints in online drug marketplaces: An exploratory analysis of a cryptomarket trade network.Int J Drug Policy, 56:92–100, 2018

    Lukas Norbutas. Offline constraints in online drug marketplaces: An exploratory analysis of a cryptomarket trade network.Int J Drug Policy, 56:92–100, 2018

    2018

  135. [143]

    Sejung Park and Rong Wang. Assessing the capability of government information intervention and socioeco- nomic factors of information sharing during the COVID-19 pandemic: a cross-country study using big data analytics.Behav Sci, 12(6):190, 2022

    2022

  136. [144]

    Hang Ren, Lu Zhang, Travis A Whetsell, and N Emel Ganapati. Analyzing multisector stakeholder collabora- tion and engagement in housing resilience planning in greater Miami and the beaches through social network analysis.Nat Hazards Rev, 24(1):04022036, 2023

    2023

  137. [145]

    Regime shifts in the Anthropocene: drivers, risks, and resilience.PLoS One, 10(8):e0134639, 2015

    Juan Carlos Rocha, Garry D Peterson, and Reinette Biggs. Regime shifts in the Anthropocene: drivers, risks, and resilience.PLoS One, 10(8):e0134639, 2015

    2015

  138. [146]

    Winners and losers in the ecology of games: Network position, con- nectivity, and the benefits of collaborative governance regimes.J Public Adm Res Theory, 27(4):647–660, 2017

    Tyler A Scott and Craig W Thomas. Winners and losers in the ecology of games: Network position, con- nectivity, and the benefits of collaborative governance regimes.J Public Adm Res Theory, 27(4):647–660, 2017. 35

    2017

  139. [147]

    Comparing utility-based and network-based approaches in modeling customer preferences for engineering de- sign

    Zhenghui Sha, Youyi Bi, Mingxian Wang, Amanda Stathopoulos, Noshir Contractor, Yan Fu, and Wei Chen. Comparing utility-based and network-based approaches in modeling customer preferences for engineering de- sign. InProceedings of the Design Society: International Conference on...

    2019

  140. [148]

    Modeling participation behaviors in design crowd- sourcing using a bipartite network-based approach.J Comput Inf Sci Eng, 19(3):031010, 2019

    Zhenghui Sha, Ashish M Chaudhari, and Jitesh H Panchal. Modeling participation behaviors in design crowd- sourcing using a bipartite network-based approach.J Comput Inf Sci Eng, 19(3):031010, 2019

    2019

  141. [149]

    The structure and pattern of global partnerships in the REDD+ mechanism.For Policy Econ, 135:102640, 2022

    Seongmin Shin, Mi Sun Park, Hansol Lee, and Himlal Baral. The structure and pattern of global partnerships in the REDD+ mechanism.For Policy Econ, 135:102640, 2022

    2022

  142. [150]

    tough on crime

    John A Shjarback and Jacob TN Young. The “tough on crime” competition: A network approach to understand- ing the social mechanisms leading to federal crime control legislation in the United States from 1973–2014. Am J Crim Just, 43(2):197–221, 2018

    1973

  143. [151]

    Bubbling up the good ideas: A two-mode network analysis of an intra-organizational idea challenge.J Comput Mediat Commun, 21(3):210–229, 2016

    Bryan Stephens, Wenhong Chen, and John Sibley Butler. Bubbling up the good ideas: A two-mode network analysis of an intra-organizational idea challenge.J Comput Mediat Commun, 21(3):210–229, 2016

    2016

  144. [152]

    Marginality and team building in collaborative crowdsourcing.Online Inf Rev, 44(4):827–846, 2020

    Rong Wang. Marginality and team building in collaborative crowdsourcing.Online Inf Rev, 44(4):827–846, 2020

    2020

  145. [153]

    Cooperation in networks: political parties and interest groups in EU policy-making in Germany.Eur Union Polit, 21(1):130–151, 2020

    Arndt Wonka and Sebastian Haunss. Cooperation in networks: political parties and interest groups in EU policy-making in Germany.Eur Union Polit, 21(1):130–151, 2020

    2020

  146. [154]

    Motivations for self-assembling into project teams.Soc Netw, 35(2):251–264, 2013

    Mengxiao Zhu, Yun Huang, and Noshir S Contractor. Motivations for self-assembling into project teams.Soc Netw, 35(2):251–264, 2013. 36

    2013

Pith tools

Reviewed August 9, 2026 · model on record in the stance chip above.