Patterns And A Generative Model Jan 24, 2014 Authors: Jianwei Niu, Wanjiun Liao, Jing Peng, Chao Tong Presenter: Guoming Wang Published: Performance Computing.

Slides:



Advertisements
Similar presentations
Routing Complexity of Faulty Networks Omer Angel Itai Benjamini Eran Ofek Udi Wieder The Weizmann Institute of Science.
Advertisements

Enabling Speculative Parallelization via Merge Semantics in STMs Kaushik Ravichandran Santosh Pande College.
Pete Bohman Adam Kunk.  Introduction  Related Work  System Overview  Indexing Scheme  Ranking  Evaluation  Conclusion.
Analysis and Modeling of Social Networks Foudalis Ilias.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Finding Self-similarity in People Opportunistic Networks Ling-Jyh Chen, Yung-Chih Chen, Paruvelli Sreedevi, Kuan-Ta Chen Chen-Hung Yu, Hao Chu.
Power Laws: Rich-Get-Richer Phenomena
SILVIO LATTANZI, D. SIVAKUMAR Affiliation Networks Presented By: Aditi Bhatnagar Under the guidance of: Augustin Chaintreau.
The influence of search engines on preferential attachment Dan Li CS3150 Spring 2006.
Network Models Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Models Why should I use network models? In may 2011, Facebook.
HCS Clustering Algorithm
Networks, Lie Monoids, & Generalized Entropy Metrics Networks, Lie Monoids, & Generalized Entropy Metrics St. Petersburg Russia September 25, 2005 Joseph.
Common Properties of Real Networks. Erdős-Rényi Random Graphs.
Sampling from Large Graphs. Motivation Our purpose is to analyze and model social networks –An online social network graph is composed of millions of.
Cascading Behavior in Large Blog Graphs: Patterns and a model offence.
Advanced Topics in Data Mining Special focus: Social Networks.
TELCOM2125: Network Science and Analysis
1 A Random-Surfer Web-Graph Model Avrim Blum, Hubert Chan, Mugizi Rwebangira Carnegie Mellon University.
Computer Science 1 Web as a graph Anna Karpovsky.
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
Defect prediction using social network analysis on issue repositories Reporter: Dandan Wang Date: 04/18/2011.
COVERTNESS CENTRALITY IN NETWORKS Michael Ovelgönne UMIACS University of Maryland 1 Chanhyun Kang, Anshul Sawant Computer Science Dept.
The Erdös-Rényi models
Information Networks Power Laws and Network Models Lecture 3.
Analysis and Modeling of the Open Source Software Community Yongqin Gao, Greg Madey Computer Science & Engineering University of Notre Dame Vincent Freeh.
Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.
Computing and Communicating Functions over Sensor Networks A.Giridhar and P. R. Kumar Presented by Srikanth Hariharan.
DERIVATIVES The Derivative as a Function DERIVATIVES In this section, we will learn about: The derivative of a function f.
DERIVATIVES The Derivative as a Function DERIVATIVES In this section, we will learn about: The derivative of a function f.
Weighted Graphs and Disconnected Components Patterns and a Generator IDB Lab 현근수 In KDD 08. Mary McGlohon, Leman Akoglu, Christos Faloutsos.
Network Aware Resource Allocation in Distributed Clouds.
LANGUAGE NETWORKS THE SMALL WORLD OF HUMAN LANGUAGE Akilan Velmurugan Computer Networks – CS 790G.
LIMITS AND DERIVATIVES 2. In Sections 2.2 and 2.4, we investigated infinite limits and vertical asymptotes.  There, we let x approach a number.  The.
Clustering Spatial Data Using Random Walk David Harel and Yehuda Koren KDD 2001.
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
Network Survivability Yishi Li, Matt Willis (Mentor: Svetlana Poroseva) Summer 2005 Research Experience for Undergraduates at Florida State University.
Murtaza Abbas Asad Ali. NETWORKOLOGY THE SCIENCE OF NETWORKS.
Detecting Phantom Nodes in Wireless Sensor Networks Joengmin Hwang, Tian He, Yongdae Kim (ACM Infocom2007) Presenter : Justin.
Self-Similarity of Complex Networks Maksim Kitsak Advisor: H. Eugene Stanley Collaborators: Shlomo Havlin Gerald Paul Zhenhua Wu Yiping Chen Guanliang.
Analyzing the Vulnerability of Superpeer Networks Against Attack B. Mitra (Dept. of CSE, IIT Kharagpur, India), F. Peruani(ZIH, Technical University of.
ANALYSIS AND IMPLEMENTATION OF GRAPH COLORING ALGORITHMS FOR REGISTER ALLOCATION By, Sumeeth K. C Vasanth K.
BotGraph: Large Scale Spamming Botnet Detection Yao Zhao, Yinglian Xie, Fang Yu, Qifa Ke, Yuan Yu, Yan Chen, and Eliot Gillum Speaker: 林佳宜.
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.
Mining and Visualizing the Evolution of Subgroups in Social Networks Falkowsky, T., Bartelheimer, J. & Spiliopoulou, M. (2006) IEEE/WIC/ACM International.
J. Hwang, T. He, Y. Kim Presented by Shan Gao. Introduction  Target the scenarios where attackers announce phantom nodes.  Phantom node  Fake their.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
Most of contents are provided by the website Network Models TJTSD66: Advanced Topics in Social Media (Social.
Comparison of Tarry’s Algorithm and Awerbuch’s Algorithm CS 6/73201 Advanced Operating System Presentation by: Sanjitkumar Patel.
Panther: Fast Top-k Similarity Search in Large Networks JING ZHANG, JIE TANG, CONG MA, HANGHANG TONG, YU JING, AND JUANZI LI Presented by Moumita Chanda.
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs Leman Akoglu, Mary McGlohon, Christos Faloutsos Carnegie Mellon University School.
Brief Announcement : Measuring Robustness of Superpeer Topologies Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
Speaker : Yu-Hui Chen Authors : Dinuka A. Soysa, Denis Guangyin Chen, Oscar C. Au, and Amine Bermak From : 2013 IEEE Symposium on Computational Intelligence.
Multicast Scaling Laws with Hierarchical Cooperation Chenhui Hu, Xinbing Wang, Ding Nie, Jun Zhao Shanghai Jiao Tong University, China.
Data Consolidation: A Task Scheduling and Data Migration Technique for Grid Networks Author: P. Kokkinos, K. Christodoulopoulos, A. Kretsis, and E. Varvarigos.
1 Patterns of Cascading Behavior in Large Blog Graphs Jure Leskoves, Mary McGlohon, Christos Faloutsos, Natalie Glance, Matthew Hurst SDM 2007 Date:2008/8/21.
1 Link Privacy in Social Networks Aleksandra Korolova, Rajeev Motwani, Shubha U. Nabar CIKM’08 Advisor: Dr. Koh, JiaLing Speaker: Li, HueiJyun Date: 2009/3/30.
Dynamic Network Analysis Case study of PageRank-based Rewiring Narjès Bellamine-BenSaoud Galen Wilkerson 2 nd Second Annual French Complex Systems Summer.
The simultaneous evolution of author and paper networks
EE327 Final Representation Qianyang Peng F
Minimum Spanning Tree 8/7/2018 4:26 AM
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
IDENTIFICATION OF DENSE SUBGRAPHS FROM MASSIVE SPARSE GRAPHS
Network Science: A Short Introduction i3 Workshop
Statistical properties of network community structure
Network Science: A Short Introduction i3 Workshop
Graph and Tensor Mining for fun and profit
The structure and evolution of scientific collaboration in eLib
The spectral evolution of impulsive solar X-ray flares
复杂网络可控性 研究进展 汪秉宏 2014 北京 网络科学论坛.
Presentation transcript:

Patterns And A Generative Model Jan 24, 2014 Authors: Jianwei Niu, Wanjiun Liao, Jing Peng, Chao Tong Presenter: Guoming Wang Published: Performance Computing and Communications Conference (IPCCC), 2012 IEEE 31st International

Nanyang Technological University | Outline ▪ Introduction ▪ Definitions And Properties ▪ Observations ▪ Model

Nanyang Technological University | Temporal evolution of social networks ▪ How do social network evolve through network? ▪ How do the different components of an entire network form and die? ▪ Is the second largest component in a network really very small in size? Temporal evolution of social networks has attracted considerable interest among researchers

Nanyang Technological University | 3 Method Empirical observations Analyze the mergings Propose model ? ! Problem Future work Two types of mergings: 1. mergings between the disconnected components themselves 2. Mergings between the disconnected components and the giant component Datasets studied

Nanyang Technological University | 4 Definitions and interested Properties G = (V, E) Graph G consists of a set of nodes V and a set of edges E. GCC Final size of the DCs The typical directed networks can be stated By a “bow-tie” structure, and usually have a giant connected component(GCC) which involves a significantly large fraction of nodes The number of nodes in that DC when it dies. It reveals how large DCs can grow before dying out 1 4 DC Longevity of DCs The disconnected components(DC) of a network are defined as the small components that are not connected to any other components in the network The length of the period from the birth of a DC to its death. It reflects how long the DCs can live before they merge with other DCs 2 3 What properties or patterns can we obtain from the temporal evolution of DCs ?

Nanyang Technological University | Observation1 Longevity distribution of DCs in each dataset All plots demonstrate a decaying trend, and after the vertical line x = k, the curves begin to oscillate apparently. The units of the longevity values are in snapshots. The longevity of each DC counts the number of snapshots that such a DC can live in the observation period of each dataset.

Nanyang Technological University | Observation2 Final size distribution of DCs in each dataset. The fitted lines and the slopes are shown. The plots demonstrate power laws

Nanyang Technological University | Observations Observation1 The curve of the overall DC longevity distribution shows a decaying trend, with oscillations at the tail, indicating that the short-lived DCs account for a large fraction of all the DCs, and the longevity of long-lived DCs do not follow a simple fixed pattern. Observation2(Final Size Power Law(FSPL)) Let sc denote the final size of a disconnected component, and let nc denote the number of disconnected components whose final size are sc. Then nc and sc follow a power law with exponent B

Nanyang Technological University | Longevity distribution of DCs that are absorbed by GCC The trend of the curves revealing the similarity between these distributions and the overall longevity distribution shown previously. Which can be regarded as a hint that the majority of DCs are absorbed by the GCC.

Nanyang Technological University | Final size distribution of DCs that are absorted by GCC The fitted lines and the slopes demonstrate again the FSPL and similarity between these distributions and the overall final size distribution

Nanyang Technological University | Longevity distribution of DCs that merge with other DCs The curves show a decaying trend, where short-lived DCs are common. There are still small spikes in the decaying part of the curves, and after that, the curves enter a relatively stable state.

Nanyang Technological University | Final size distribution of DCs that merge with other DCs

Nanyang Technological University | Different timestamp

Nanyang Technological University | Mergings of Disconnected Components A DC can either be absorbed by the GCC, or merge with other DCs; The target is to know if there is an obvious difference in number between these two types of mergings Number of DCs is much less compared with the mergings involving the GCC. Long-lived DCs are seldom involved in the DC mergings The count of DCs decreases as the longevity value increases.

Nanyang Technological University | Observation3 The mergings among DCs are all small in size, and specially most of the mergings happen between two DCs.

Nanyang Technological University | Proposed Model ▪ The decaying trend in DC longevity distribution ▪ The FSPL in the final-size distribution of DCs ▪ The small merging sizes

Nanyang Technological University | Surfer Model – generative steps 1. v chooses a host node u uniformly at random from all the existing nodes in the network, and forms a link to u 2. Generate a random number count which is geometrically distributed with expectation pfrnd/(1- pfrnd).Node v randomly chooses count edges of u expect the edge as it can if there are not enough edges. 3. Let x1, x2…xk denote the nodes on the other ends of these chosen edges in step(2). Node v forms links to x1, x2…xk, and then goes to step(2), recursively visiting all these nodes

Nanyang Technological University | Surfer Model – Generative steps depiction

Nanyang Technological University | Pseudo code

Nanyang Technological University | Pseudo code

Nanyang Technological University | 20 Conclusion and Future work Empirical observations and analyse longevity and final sizeof DC Detecting anomalies and forcasting the future states…? Surfer model Longevity: decaying trend Final-size: power law

Nanyang Technological University | 21 Thank you – Enjoy the rest of your night