Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Is the network of heterosexual contact in Japan scale free?

ABSTRACT: Elucidation of the structure of human sexual networks is not only an interesting topic in the area of social networks but also an important clue for understanding the spreading risk of sexually transmitted infections (STIs). Some previous studies have indicated that sexual networks are scale free, while others have suggested that they are not. We conducted a Web-based survey on sexual contact in Japan to collect data on cumulative (total) heterosexual partners and the number of recent (in the last three or previous three months) heterosexual partners. To determine whether the number of heterosexual contacts in Japan has a power-law tail, we used maximum likelihood fitting methods and Kolmogorov-Smirnov tests. For confirmation, we also used the Akaike information criterion (AIC) and the Bayesian information criterion (BIC). Our results indicate that the distributions of the number of sexual partners in Japan have power-law tails.

SUBMITTER: Ito H

PROVIDER: S-EPMC6711537 | biostudies-literature | 2019

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Is the network of heterosexual contact in Japan scale free?

Ito Hiromu H Tamura Kazuhiro K Wada Takayuki T Yamamoto Taro T Morita Satoru S

PloS one 20190827 8

Elucidation of the structure of human sexual networks is not only an interesting topic in the area of social networks but also an important clue for understanding the spreading risk of sexually transmitted infections (STIs). Some previous studies have indicated that sexual networks are scale free, while others have suggested that they are not. We conducted a Web-based survey on sexual contact in Japan to collect data on cumulative (total) heterosexual partners and the number of recent (in the la ...[more]

PMID: 31454371

Similar Datasets

Variational principle for scale-free network motifs.

Project description:For scale-free networks with degrees following a power law with an exponent τ ∈ (2, 3), the structures of motifs (small subgraphs) are not yet well understood. We introduce a method designed to identify the dominant structure of any given motif as the solution of an optimization problem. The unique optimizer describes the degrees of the vertices that together span the most likely motif, resulting in explicit asymptotic formulas for the motif count and its fluctuations. We then classify all motifs into two categories: motifs with small and large fluctuations.

| S-EPMC6494877 | biostudies-other

Development of a social contact self-efficacy scale for 'third agers' in Japan.

Project description:Background"Third agers" are people over retirement age in relatively good health; third agers make up an increasing percentage of the global population as the world's longevity increases. Therefore, the challenge of prolonging a healthy third age and shortening the unhealthy period during the "fourth age" in the global health and social contexts is important in this process. However, no means to measure and support this has been developed as yet. We developed the Social Contact Self-Efficacy Scale for Third Agers (SET) and evaluated its reliability and validity.MethodsWe used a self-administered mail survey covering 2,600 randomly selected independent older adults living in Yokohama, Japan. The construct validity of the SET was determined using exploratory factor and confirmatory factor analyses. Its criterion-related validity was assessed using the General Self-Efficacy Scale (GSES), the Japan Science and Technology Agency Index of Competence (JST-IC), and subjective health status.ResultsIn total, 1,139 older adults provided responses. Exploratory and confirmatory factor analyses identified eight items within two factors: social space mobility and social support relationship. The final model had a Cronbach's alpha 0.834, goodness-of-fit index 0.976, adjusted goodness-of-fit index 0.955, comparative fit index 0.982, and root mean square error of approximation 0.050. There was good correlation between scale scores and the GSES (r = 0.552, p < 0.001), JST-IC (r = 0.495, p < 0.001) and subjective health status (r = 0.361, p < 0.001).ConclusionsThe SET showed sufficient reliability and validity to assess self-efficacy in promoting social contact among third agers. This scale may help third agers in gaining and expanding opportunities for social contact, which can improve their physical health and quality of life and contribute to care prevention and healthy longevity.

| S-EPMC8219158 | biostudies-literature

NiemaGraphGen: A memory-efficient global-scale contact network simulation toolkit.

Project description:Epidemic simulations require the ability to sample contact networks from various random graph models. Existing methods can simulate city-scale or even country-scale contact networks, but they are unable to feasibly simulate global-scale contact networks due to high memory consumption. NiemaGraphGen (NGG) is a memory-efficient graph generation tool that enables the simulation of global-scale contact networks. NGG avoids storing the entire graph in memory and is instead intended to be used in a data streaming pipeline, resulting in memory consumption that is orders of magnitude smaller than existing tools. NGG provides a massively-scalable solution for simulating social contact networks, enabling global-scale epidemic simulation studies.

| S-EPMC10038133 | biostudies-literature

Infectious disease control using contact tracing in random and scale-free networks.

Project description:Contact tracing aims to identify and isolate individuals that have been in contact with infectious individuals. The efficacy of contact tracing and the hierarchy of traced nodes-nodes with higher degree traced first-is investigated and compared on random and scale-free (SF) networks with the same number of nodes N and average connection K. For values of the transmission rate larger than a threshold, the final epidemic size on SF networks is smaller than that on corresponding random networks. While in random networks new infectious and traced nodes from all classes have similar average degrees, in SF networks the average degree of nodes that are in more advanced stages of the disease is higher at any given time. On SF networks tracing removes possible sources of infection with high average degree. However a higher tracing effort is required to control the epidemic than on corresponding random networks due to the high initial velocity of spread towards the highly connected nodes. An increased latency period fails to significantly improve contact tracing efficacy. Contact tracing has a limited effect if the removal rate of susceptible nodes is relatively high, due to the fast local depletion of susceptible nodes.

| S-EPMC1618487 | biostudies-literature

Minimum Dominating Sets in Scale-Free Network Ensembles

Project description:We study the scaling behavior of the size of minimum dominating set (MDS) in scale-free networks, with respect to network size N and power-law exponent ?, while keeping the average degree fixed. We study ensembles generated by three different network construction methods, and we use a greedy algorithm to approximate the MDS. With a structural cutoff imposed on the maximal degree

| S-EPMC3636516 | biostudies-literature

Quantifying heterogeneous contact patterns in Japan: a social contact survey.

Project description:BACKGROUND:Social contact surveys can greatly help in quantifying the heterogeneous patterns of infectious disease transmission. The present study aimed to conduct a contact survey in Japan, offering estimates of contact by age and location and validating a social contact matrix using a seroepidemiological dataset of influenza. METHODS:An internet-based questionnaire survey was conducted, covering all 47 prefectures in Japan and including a total of 1476 households. The social contact matrix was quantified assuming reciprocity and using the maximum likelihood method. By imposing several parametric assumptions for the next-generation matrix, the empirical seroepidemiological data of influenza A (H1N1) 2009 was analysed and we estimated the basic reproduction number, R0. RESULTS:In total, the reported number of contacts on weekdays was 10,682 whereas that on weekend days was 8867. Strong age-dependent assortativity was identified. Forty percent of weekday contacts took place at schools or workplaces, but that declined to 14% on weekends. Accounting for the age-dependent heterogeneity with the known social contact matrix, the minimum value of the Akaike information criterion was obtained and R0 was estimated at 1.45 (95% confidence interval: 1.42, 1.49). CONCLUSIONS:Survey datasets will be useful for parameterizing the heterogeneous transmission model of various directly transmitted infectious diseases in Japan. Age-dependent assortativity, especially among children, along with numerous contacts in school settings on weekdays implies the potential effectiveness of school closure.

| S-EPMC6425701 | biostudies-literature

Long-period rhythmic synchronous firing in a scale-free network.

Project description:Stimulus information is encoded in the spatial-temporal structures of external inputs to the neural system. The ability to extract the temporal information of inputs is fundamental to brain function. It has been found that the neural system can memorize temporal intervals of visual inputs in the order of seconds. Here we investigate whether the intrinsic dynamics of a large-size neural circuit alone can achieve this goal. The network models we consider have scale-free topology and the property that hub neurons are difficult to be activated. The latter is implemented by either including abundant electrical synapses between neurons or considering chemical synapses whose efficacy decreases with the connectivity of the postsynaptic neuron. We find that hub neurons trigger synchronous firing across the network, loops formed by low-degree neurons determine the rhythm of synchronous firing, and the hardness of exciting hub neurons avoids epileptic firing of the network. Our model successfully reproduces the experimentally observed rhythmic synchronous firing with long periods and supports the notion that the neural system can process temporal information through the dynamics of local circuits in a distributed way.

| S-EPMC3864271 | biostudies-literature

Dynamic contact network between ribosomal subunits enables rapid large-scale rotation during spontaneous translocation.

Project description:During ribosomal translation, the two ribosomal subunits remain associated through intersubunit bridges, despite rapid large-scale intersubunit rotation. The absence of large barriers hindering rotation is a prerequisite for rapid rotation. Here, we investigate how such a flat free-energy landscape is achieved, in particular considering the large shifts the bridges undergo at the periphery. The dynamics and energetics of the intersubunit contact network are studied using molecular dynamics simulations of the prokaryotic ribosome in intermediate states of spontaneous translocation. Based on observed occupancies of intersubunit contacts, residues were grouped into clusters. In addition to the central contact clusters, peripheral clusters were found to maintain strong steady interactions by changing contacts in the course of rotation. The peripheral B1 bridges are stabilized by a changing contact pattern of charged residues that adapts to the rotational state. In contrast, steady strong interactions of the B4 bridge are ensured by the flexible helix H34 following the movement of protein S15. The tRNAs which span the subunits contribute to the intersubunit binding enthalpy to an almost constant degree, despite their different positions in the ribosome. These mechanisms keep the intersubunit interaction strong and steady during rotation, thereby preventing dissociation and enabling rapid rotation.

| S-EPMC4538834 | biostudies-literature

Controlling the efficiency of trapping in a scale-free small-world network.

Project description:Designing appropriate techniques to effectively control the trapping process in complex systems towards desirable efficiency is of paramount importance in the study of trapping problem. In this paper, we present three different methods guiding trapping process in a scale-free small-world network with a deep trap positioned at an initial node. All the proposed approaches dominate the trapping process by varying the transition probability of random walks. In the first two techniques, the transition probability is modified by an introduced weight parameter and a stochastic parameter, respectively. And the third scheme is a combination of the first two approaches, controlled by both parameters synchronously. For all the three control strategies, we derive both analytically and numerically the average trapping time (ATT) as the measure of the trapping efficiency, with the obtained explicit expressions being in good agreement with their corresponding exact numerical solutions. Our results indicate that the weight parameter changes simultaneously the dominating scaling of ATT and its prefactor. Different from the weight parameter, the stochastic parameter only modifies the prefactor, keeping the leading scaling unchanged. Finally, compared with the first two manners, the third strategy is a fine control, possessing the advantages of the first two ones. This work deepens the understanding of controlling trapping process in complex systems.

| S-EPMC4158604 | biostudies-other

Complex Quantum Network Manifolds in Dimension d > 2 are Scale-Free.

Project description:In quantum gravity, several approaches have been proposed until now for the quantum description of discrete geometries. These theoretical frameworks include loop quantum gravity, causal dynamical triangulations, causal sets, quantum graphity, and energetic spin networks. Most of these approaches describe discrete spaces as homogeneous network manifolds. Here we define Complex Quantum Network Manifolds (CQNM) describing the evolution of quantum network states, and constructed from growing simplicial complexes of dimension d. We show that in d = 2 CQNM are homogeneous networks while for d > 2 they are scale-free i.e. they are characterized by large inhomogeneities of degrees like most complex networks. From the self-organized evolution of CQNM quantum statistics emerge spontaneously. Here we define the generalized degrees associated with the δ-faces of the d-dimensional CQNMs, and we show that the statistics of these generalized degrees can either follow Fermi-Dirac, Boltzmann or Bose-Einstein distributions depending on the dimension of the δ-faces.

| S-EPMC4564853 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data