Human sexual contact network as a bipartite graph

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Human Sexual Contact Network as a Bipartite Graph

A simple model to encapsulate the essential growth properties of the web of human sexual contacts is presented. In the model only heterosexual connection is considered and represented by a random growing bipartite graph where both male-female contact networks grow simultaneously. The time evolution of the model is analysed by a rate equation approach leading to confirm that the male and the fem...

متن کامل

Graph Embedding with Rich Information through Bipartite Heterogeneous Network

Graph embedding has attracted increasing attention due to its critical application in social network analysis. Most existing algorithms for graph embedding only rely on the typology information and fail to use the copious information in nodes as well as edges. As a result, their performance for many tasks may not be satisfactory. In this paper, we proposed a novel and general framework of repre...

متن کامل

Supervised Bipartite Graph Inference

We formulate the problem of bipartite graph inference as a supervised learning problem, and propose a new method to solve it from the viewpoint of distance metric learning. The method involves the learning of two mappings of the heterogeneous objects to a unified Euclidean space representing the network topology of the bipartite graph, where the graph is easy to infer. The algorithm can be form...

متن کامل

Bipartite Graph Tiling

For each s ≥ 2, there exists m0 such that the following holds for all m ≥ m0: Let G be a bipartite graph with n = ms vertices in each partition set. If m is odd and minimum degree δ(G) ≥ n+3s 2 − 2, then G contains m vertex-disjoint copies of Ks,s. If m is even, the same holds under the weaker condition δ(G) ≥ n/2+ s− 1. This is sharp and much stronger than a conjecture of Wang [25] (for large n).

متن کامل

on bipartite divisor graph for character degrees

‎the concept of the bipartite divisor graph for integer subsets has been considered in [‎m‎. ‎a‎. ‎iranmanesh and c‎. ‎e‎. ‎praeger‎, ‎bipartite divisor graphs for integer subsets‎, ‎{em graphs combin.}‎, ‎{bf 26} (2010) 95--105‎.]‎. ‎in this paper‎, ‎we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph‎. ‎we show that if $g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physica A: Statistical Mechanics and its Applications

سال: 2002

ISSN: 0378-4371

DOI: 10.1016/s0378-4371(02)00628-3