PPT-Graphs and Social Networks
Author : lindy-dunigan | Published Date : 2019-03-17
Why Social Graphs Are Different Communities CommunityDetection Methods Jeffrey D Ullman Stanford University Infolab Social Graphs Graphs can be either directed or
Presentation Embed Code
Download Presentation
Download Presentation The PPT/PDF document "Graphs and Social Networks" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Graphs and Social Networks: Transcript
Why Social Graphs Are Different Communities CommunityDetection Methods Jeffrey D Ullman Stanford University Infolab Social Graphs Graphs can be either directed or undirected Example The Facebook friends graph undirected. Dr. Andrew Wallace PhD . BEng. (hons) . EurIng. andrew.wallace@cs.umu.se. Overview. Sets. Implementation. Complexity. Graphs. Constructing . Graphs. Graph examples. Sets. Collection of items. No specified ordered. Isabelle Stanton, UC Berkeley. Gabriel . Kliot. , Microsoft Research XCG. Modern graph datasets are huge. The web graph had over a trillion links in 2011. Now?. . facebook. has “more than 901 million users with average degree 130”. Power law . graphs. Small world graphs. Preferential attachment. Barabási. and Albert showed that when large networks are formed. by the rules of . preferential attachment . , the resulting graph shows. Definitions and concepts . How do they networks relate to health?. Case studies . Session outcomes . To outline the nature of social and community networks . To define the concepts of social support and social capital . Power law . graphs. Small world graphs. Preferential attachment. Barabási. and Albert showed that when large networks are formed. by the rules of . preferential attachment . , the resulting graph shows. Graphs. . Graphs . capture . much more detail than numerical summaries, so very useful for learning about data and communicating its features.. At the same time, graphical interpretation isn’t standard in the way that numerical summaries are, and our eyes can fool us.. Arvind Narayanan and Vitaly Shmatikov. The University of Texas at Austin. Presenter: Humam Nameer. Problem Facts:. - All of us here are . Target. in this domain. It directly effects us!!. - Events, location, occasions, pictures, video and even intentions are at public display. Thanks to Mr. Hammond @ . www.mrhammond.org/math/mathlessons/7-8.ppt. Review. We have been looking at many different ways to present data. . Now let’s see how people can use these charts and graphs to mislead you.. Section . 10.3. Representing Graphs: . Adjacency Lists. Definition. : An . adjacency list . can be used to represent a graph with no multiple edges by specifying the vertices that are adjacent to each vertex of the graph.. The vertical scale is too big or too small, or skips numbers, or doesn’t start at zero.. The graph isn’t labeled properly.. Data is left out.. But some real life misleading graphs go above and beyond the classic types. Some are intended to mislead, others are intended to shock. And in some cases, well-meaning individuals just got it all plain wrong. These are some of my favorite recent-history misleading graphs from real life.. Planar graphs. 2. Planar graphs. Can be drawn on the plane without crossings. Plane graph: planar graph, given together with an embedding in the plane. Many applications…. Questions:. Testing if a graph is planar. Steven Procopio, Ph.D.. PAR Policy Director. PAR is an independent voice, offering solutions to critical public issues in Louisiana through accurate, objective research and focusing public attention on those solutions.. Matching Algorithms and Networks Algorithms and Networks: Matching 2 This lecture Matching: problem statement and applications Bipartite matching (recap) Matching in arbitrary undirected graphs: Edmonds algorithm Prof. . Ralucca Gera, . Applied Mathematics Dept.. Naval Postgraduate School. Monterey, California. rgera@nps.edu. Excellence Through Knowledge. Learning Outcomes. Identify the . main concepts of complex network .
Download Document
Here is the link to download the presentation.
"Graphs and Social Networks"The content belongs to its owner. You may download and print it for personal use, without modification, and keep all copyright notices. By downloading, you agree to these terms.
Related Documents