Using an agent-based sexual-network model to analyze the impact of mitigation efforts for controlling chlamydia.

Chlamydia trachomatis (Ct) is the most reported sexually transmitted infection in the United States, with a major cause of infertility, pelvic inflammatory disease, and ectopic pregnancy among women. Despite decades of screening women for Ct, rates increase among young African Americans (AA). We create and analyze a heterosexual agent-based network model to help understand the spread of Ct. We calibrate the model parameters to agree with survey data showing Ct prevalence of 12% of the women and 10% of the men in the 15-25 year-old AA in New Orleans, Louisiana. Our model accounts for both long-term and casual partnerships. The network captures the assortative mixing of individuals by preserving the joint-degree distributions observed in the data. We compare the effectiveness of intervention strategies based on randomly screening men, notifying partners of infected people, which includes partner treatment, partner screening, and rescreening for infection. We compare the difference between treating partners of an infected person both with and without testing them. We observe that although increased Ct screening, rescreening, and treating most of the partners of infected people will reduce the prevalence, these mitigations alone are not sufficient to control the epidemic. The current practice is to treat the partners of an infected individual without first testing them for infection. The model predicts that if a sufficient number of the partners of all infected people are tested and treated, then there is a threshold condition where the epidemic can be mitigated. This threshold results from the expanded treatment network created by treating an individual's infected partners' partners. Although these conclusions can help design future Ct mitigation studies, we caution the reader that these conclusions are for the mathematical model, not the real world, and are contingent on the validity of the model assumptions.

Generating Bipartite Networks with a Prescribed Joint Degree Distribution.

We describe a class of new algorithms to construct bipartite networks that preserves a prescribed degree and joint-degree (degree-degree) distribution of the nodes. Bipartite networks are graphs that can represent real-world interactions between two disjoint sets, such as actor-movie networks, author-article networks, co-occurrence networks, and heterosexual partnership networks. Often there is a strong correlation between the degree of a node and the degrees of the neighbors of that node that must be preserved when generating a network that reflects the structure of the underling system. Our bipartite 2K (B2K) algorithms generate an ensemble of networks that preserve prescribed degree sequences for the two disjoint set of nodes in the bipartite network, and the joint-degree distribution that is the distribution of the degrees of all neighbors of nodes with the same degree. We illustrate the effectiveness of the algorithms on a romance network using the NetworkX software environment to compare other properties of a target network that are not directly enforced by the B2K algorithms. We observe that when average degree of nodes is low, as is the case for romance and heterosexual partnership networks, then the B2K networks tend to preserve additional properties, such as the cluster coefficients, than algorithms that do not preserve the joint-degree distribution of the original network.