Modeling Social Networks with Overlapping Communities Using Hypergraphs and Their Line Graphs

Computer Science – Social and Information Networks

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

11 pages, 5 figures

Scientific paper

We propose that hypergraphs can be used to model social networks with overlapping communities. The nodes of the hypergraphs represent the communities. The hyperlinks of the hypergraphs denote the individuals who may participate in multiple communities. The hypergraphs are not easy to analyze, however, the line graphs of hypergraphs are simple graphs or weighted graphs, so that the network theory can be applied. We define the overlapping depth $k$ of an individual by the number of communities that overlap in that individual, and we prove that the minimum adjacency eigenvalue of the corresponding line graph is not smaller than $-k_{max}$, which is the maximum overlapping depth of the whole network. Based on hypergraphs with preferential attachment, we establish a network model which incorporates overlapping communities with tunable overlapping parameters $k$ and $w$. By comparing with the Hyves social network, we show that our social network model possesses high clustering, assortative mixing, power-law degree distribution and short average path length.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Modeling Social Networks with Overlapping Communities Using Hypergraphs and Their Line Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Modeling Social Networks with Overlapping Communities Using Hypergraphs and Their Line Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modeling Social Networks with Overlapping Communities Using Hypergraphs and Their Line Graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-27519

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.