Snowballing Effects in Preferential Attachment: The Impact of The Initial Links Huanyang Zheng and Jie Wu Computer and Information Sciences Temple University.

Slides:



Advertisements
Similar presentations
Scale Free Networks.
Advertisements

Albert-László Barabási
Analysis and Modeling of Social Networks Foudalis Ilias.
Lecture 21 Network evolution Slides are modified from Jurij Leskovec, Jon Kleinberg and Christos Faloutsos.
Information Networks Generative processes for Power Laws and Scale-Free networks Lecture 4.
Synopsis of “Emergence of Scaling in Random Networks”* *Albert-Laszlo Barabasi and Reka Albert, Science, Vol 286, 15 October 1999 Presentation for ENGS.
1 Dr. Michael D. Featherstone Introduction to e-Commerce Network Theory.
1 Symmetrical Pair Scheme: a Load Balancing Strategy to Solve Intra- movie Skewness for Parallel Video Servers Song Wu and Hai Jin Huazhong University.
“ Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks ”
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
The influence of search engines on preferential attachment Dan Li CS3150 Spring 2006.
Hierarchy in networks Peter Náther, Mária Markošová, Boris Rudolf Vyjde : Physica A, dec
Topology Generation Suat Mercan. 2 Outline Motivation Topology Characterization Levels of Topology Modeling Techniques Types of Topology Generators.
Emergence of Scaling in Random Networks Barabasi & Albert Science, 1999 Routing map of the internet
TDTS21: Advanced Networking Lecture 8: Online Social Networks Based on slides from P. Gill Revised 2015 by N. Carlsson.
Small Worlds Presented by Geetha Akula For the Faculty of Department of Computer Science, CALSTATE LA. On 8 th June 07.
The Barabási-Albert [BA] model (1999) ER Model Look at the distribution of degrees ER ModelWS Model actorspower grid www The probability of finding a highly.
The structure of the Internet. How are routers connected? Why should we care? –While communication protocols will work correctly on ANY topology –….they.
Deployment Strategies for Differentiated Detection in Wireless Sensor Network Jingbin Zhang, Ting Yan, and Sang H. Son University of Virginia From SECON.
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
CS Lecture 6 Generative Graph Models Part II.
CS246 Search Engine Bias. Junghoo "John" Cho (UCLA Computer Science)2 Motivation “If you are not indexed by Google, you do not exist on the Web” --- news.com.
A Measurement -driven Analysis of Information Propagation in the Flickr Social Network Offense April 29.
The structure of the Internet. How are routers connected? Why should we care? –While communication protocols will work correctly on ANY topology –….they.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
The structure of the Internet. The Internet as a graph Remember: the Internet is a collection of networks called autonomous systems (ASs) The Internet.
How to Analyse Social Network? : Part 2 Power Laws and Rich-Get-Richer Phenomena Thank you for all referred contexts and figures.
Opportunistic Routing Based Scheme with Multi-layer Relay Sets in Cognitive Radio Networks Ying Dai and Jie Wu Department of Computer and Information Sciences.
Measurement and Evolution of Online Social Networks Review of paper by Ophir Gaathon Analysis of Social Information Networks COMS , Spring 2011,
A fast identification method for P2P flow based on nodes connection degree LING XING, WEI-WEI ZHENG, JIAN-GUO MA, WEI- DONG MA Apperceiving Computing and.
1 Worm Modeling and Defense Cliff C. Zou, Don Towsley, Weibo Gong Univ. Massachusetts, Amherst.
Spreading of Epidemic Based on Human and Animal Mobility Pattern
Nothing in (computational) biology makes sense except in the light of evolution after Theodosius Dobzhansky (1970) Power laws, scalefree networks, the.
A Comparative Study of Search Result Diversification Methods Wei Zheng and Hui Fang University of Delaware, Newark DE 19716, USA
1 Networks The Internet may be described as part technology and part human interaction. To describe it as one or the other is not quite accurate. Unlike.
Stochastic sleep scheduling (SSS) for large scale wireless sensor networks Yaxiong Zhao Jie Wu Computer and Information Sciences Temple University.
Socially-aware pub-sub system for human networks Yaxiong Zhao Jie Wu Department of Computer and Information Sciences Temple University Philadelphia
2010 © University of Michigan 1 DivRank: Interplay of Prestige and Diversity in Information Networks Qiaozhu Mei 1,2, Jian Guo 3, Dragomir Radev 1,2 1.
Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU
Optimal Selection of Power Saving Classes in IEEE e Lei Kong, Danny H.K. Tsang Department of Electronic and Computer Engineering Hong Kong University.
Listen to the noise: Bridge dynamics and topology of complex networks Jie Ren ( 任 捷 ) NUS Graduate School for Integrative Sciences & Engineering National.
Analyzing the Vulnerability of Superpeer Networks Against Attack Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
Yongqin Gao, Greg Madey Computer Science & Engineering Department University of Notre Dame © Copyright 2002~2003 by Serendip Gao, all rights reserved.
Class 9: Barabasi-Albert Model-Part I
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Austin Howard & Chris Wohlgamuth April 28, 2009 This presentation is available at
Most of contents are provided by the website Network Models TJTSD66: Advanced Topics in Social Media (Social.
Graph Data Management Lab, School of Computer Science Personalized Privacy Protection in Social Networks (VLDB2011)
Performance Evaluation Lecture 1: Complex Networks Giovanni Neglia INRIA – EPI Maestro 10 December 2012.
Speaker : Yu-Hui Chen Authors : Dinuka A. Soysa, Denis Guangyin Chen, Oscar C. Au, and Amine Bermak From : 2013 IEEE Symposium on Computational Intelligence.
1 Dr. Michael D. Featherstone Introduction to e-Commerce Network Theory 101.
Multi-Task Assignment for CrowdSensing in Mobile Social Network Mingjun Xiao ∗, Jie Wu†, Liusheng Huang ∗, Yunsheng Wang‡, and Cong Liu§
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
Facilitation and inhibition of network percolation by distance-dependent strategy on a two- dimensional plane Chen-Ping Zhu 1,2,3, Long Tao Jia 1, 1.Nanjing.
Non-Markovian Character in Human Mobility: Online and Offline 报告人:蔡世民 合作者:赵志丹,卢扬.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
The simultaneous evolution of author and paper networks
Introduction to e-Commerce
Generative Model To Construct Blog and Post Networks In Blogosphere
En Wang 1,2 , Yongjian Yang 1 , and Jie Wu 2
Effective Social Network Quarantine with Minimal Isolation Costs
Lecture 13 Network evolution
The likelihood of linking to a popular website is higher
Coverage and Distinguishability in Traffic Flow Monitoring
Peer-to-Peer and Social Networks
Fig. 1 Characterizing citation dynamics
Unit 1 Representing Real Numbers
Lecture 21 Network evolution
Research Paper Overview.
Diffusion in Networks
Presentation transcript:

Snowballing Effects in Preferential Attachment: The Impact of The Initial Links Huanyang Zheng and Jie Wu Computer and Information Sciences Temple University

1. Introduction  Evolving networks  Citation networks  Internet  Social networks  P2P networks  Road networks  Amazon networks  Node degrees  Snowballing effects  Rich gets richer  The impact of initial node degree in snowballs?

2. Preferential Attachment  Nodes come into the network one by one  For example, papers come into the citation network one by one  Newly income node attach to previously existing nodes  Attach probability depends on degree  For example:  We prefer to cite papers with more citations

3. Age-sensitive Preferential Attachment  Age-sensitive attachment  For example, we prefer to cite new papers than old papers, if they have the same citations  Attachment probability  Depends on both node degree and age difference  Denoted by  Tradeoff on attachment probability  Older nodes have larger degrees by time  Larger age difference brings a smaller attach probability  Node degree dominates? Age difference dominates?

3. Age-sensitive Preferential Attachment  Percolation phenomenon  Dominated factor determines the network structure

3. Age-sensitive Preferential Attachment  Degree evolving equation:  Two boundaries are α = β and α = β + 1.5

4. Node Degree Snowballing  When α β  Initial node degree is not important  Domination of node degree / age difference  Study the degree snowballing pattern  r i denotes ratio of the additional initial degree to the normal initial degree  r g denotes ratio of increased eventual node degree brought by the additional initial degree  Example: how many additional citations can be eventually brought by the initial self-citations?  r g monotonically increases with respect to r i

4. Node Degree Snowballing  Degree evolving equation:  Set

4. Node Degree Snowballing  Result for the degree snowballing pattern:

5. Experiments  Simulations on the percolation  Boundaries of α = β or α = β + 1.5

5. Experiments  Real data-driven experiments  Arxiv high energy physics phenomenology citation network  Include papers published from January 1993 to April 2003  Include 34,546 papers with 421,578 citations

5. Experiments  Real data-driven experiments  Flickr photo sharing network  Include users from November 2006 to May 2007  Include 167,527 users and 526,874 following relationships

6. Conclusion  Node degree snowballing effects  Evolving networks  Age-sensitive preferential attachment model  Node degree and age difference  Impact of the initial links  Linear stage and diminishing return stage

End Q & A