Expansion properties of large social graphs

Authors:
Fragkiskos D. Malliaros;Vasileios Megalooikonomou
Affiliations:
Computer Engineering and Informatics Department, University of Patras, Rio, Greece;Computer Engineering and Informatics Department, University of Patras, Rio, Greece and Data Engineering Laboratory, Center for Information Science and Technology, Temple University, Philadelphia, ...
Venue:
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
Year:
2011

Citing 12
Cited 0

Isoperimetric numbers of graphs

Journal of Combinatorial Theory Series B
On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Graphs over time: densification laws, shrinking diameters and possible explanations

Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Structure and evolution of online social networks

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Graph evolution: Densification and shrinking diameters

ACM Transactions on Knowledge Discovery from Data (TKDD)
Measurement and analysis of online social networks

Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws

ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
On the evolution of user interaction in Facebook

Proceedings of the 2nd ACM workshop on Online social networks
Predicting positive and negative links in online social networks

Proceedings of the 19th international conference on World wide web
Sampling community structure

Proceedings of the 19th international conference on World wide web
Expansion and search in networks

CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Rumour spreading and graph conductance

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Social network analysis has become an extremely popular research area, where the main focus is the understanding of networks' structure. In this paper, we study the expansibility of large social graphs, a structural property based on the notion of expander graphs (i.e. sparse graphs with strong connectivity properties). It is widely believed that social networks have poor expansion properties, due to their communitybased organization. Moreover, this was experimentally confirmed on small scale networks and it is considered as a global property of social networks (independent of the graph's size) in many applications. What really happens in large scale social graphs? To address this question, we measure the expansion properties of several large scale social graphs using the measure of subgraph centrality. Our findings show a clear difference on the expansibility between small and large scale social networks, and thus structural differences. Our observations could be utilized in a range of applications which are based on social graphs' structure.