Networks, Crowds, and Markets in Computer Science Seminar
Networks, Crowds and
Markets
Undergraduate Seminar in Computer Science
Prof. Ronitt Rubinfeld
What are we here for?
Connections
Taken from http://thenextweb.com/socialmedia/2013/11/24/facebook-grandparents-need-next-gen-social-network/
Networks
•
Social networks
•
Connections are “friendship”, “know each other”, “family”
•
A question: “How important is geography?”
•
Financial networks
•
Connections are “bank1 took a loan from bank2”
•
A question: How susceptible to disruptions, cascading failures, financial
crises?
•
Information networks
•
Connections are readership, web links
•
A question: How reliable?
How to represent a network?
•
Graph theory:
•
Nodes are entities
•
Edges are connections
people
Know one another
computers
banks
Wireless routers
Facebook pages
Network connection
Loan from each other
Friendship
Can communicate
Some boring details…
•
Text is Easley and Kleinberg “Networks, Crowds and Markets”
•
Talk should be about 45 min
•
Give a practice talk privately for me on Sunday before (this should not
be your first practice talk!)
•
Will focus on social and information network analysis
•
Less on game theory, markets and auctions
Giving a talk
•
Main question: are we awake?
•
Good material
•
Delivery: Can we follow?
•
Monotone voice
•
Impossible to read slides
•
Slides organization
•
Use bullets
•
How to use vullets?
•
Must write anything you want them to remember
•
Ok to rfepeat a definition on board or on slide
•
At least 24 point font
•
Practice the talk – at least 2-3 times
Explore the fascinating world of networks through the lens of social, financial, and information connections. Learn about graph theory, network representation, and the importance of geography in various network types. Get insights on giving engaging talks and delivering content effectively in academic settings.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
Networks, Crowds and Markets Undergraduate Seminar in Computer Science Prof. Ronitt Rubinfeld
Connections Taken from http://thenextweb.com/socialmedia/2013/11/24/facebook-grandparents-need-next-gen-social-network/
Networks Social networks Connections are friendship , know each other , family A question: How important is geography? Financial networks Connections are bank1 took a loan from bank2 A question: How susceptible to disruptions, cascading failures, financial crises? Information networks Connections are readership, web links A question: How reliable?
How to represent a network? Graph theory: Nodes are entities Edges are connections Know one another Network connection Loan from each other Friendship Can communicate people computers banks Facebook pages Wireless routers
Some boring details Text is Easley and Kleinberg Networks, Crowds and Markets Talk should be about 45 min Give a practice talk privately for me on Sunday before (this should not be your first practice talk!) Will focus on social and information network analysis Less on game theory, markets and auctions
Giving a talk Main question: are we awake? Good material Delivery: Can we follow? Monotone voice Impossible to read slides Slides organization Use bullets How to use vullets? Must write anything you want them to remember Ok to rfepeat a definition on board or on slide At least 24 point font Practice the talk at least 2-3 times
