0
SFI Social Networking Application Survey
What are “Social Networks”
Powerlaws Social Networks are “scale free”
Graph Complexity Social graphs are key graphs, but there are other graphs, layered and intermingled with the social graphs
Nodes Hubs and Links Node Hub Link
Links have attributes Node Node <ul><li>Feedback  </li></ul><ul><li>Distance or Decay </li></ul><ul><li>Intelligence </li>...
Page Rank Intelligence
Key Graphs
ELGG SWOT
Saywire SWOT
Open Journal SWOT
Buddypress / Wordpress MU
Upcoming SlideShare
Loading in...5
×

Social Network Software - Q3 2009

267

Published on

Published in: Technology, Business
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
267
On Slideshare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
3
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide
  • Social Networks are contextual sharing engines that use a social-circles network model aka “social graph”
  • Cite: Albert-László Barabási Social Networks are “scale free” which means that the associations are based on a power law or Pareto distribution
  • Scale free networks have three components: Nodes, Hubs (collections of Nodes) and links.
  • Links have qualitative properties
  • Google Pagerank is an example of qualitative intelligence Mathematical PageRanks (out of 100) for a simple network (PageRanks reported by Google are rescaled logarithmically). Page C has a higher PageRank than Page E, even though it has fewer links to it; the link it has is of a much higher value. A web surfer who chooses a random link on every page (but with 15% likelihood jumps to a random page on the whole web) is going to be on Page E for 8.1% of the time. (The 15% likelihood of jumping to an arbitrary page corresponds to a damping factor of 85%.) Without damping, all web surfers would eventually end up on Pages A, B, or C, and all other pages would have PageRank zero. Page A is assumed to link to all pages in the web, because it has no outgoing links.
  • The different software available has biases towards the “Key” graph managed by the tools. Fos SFI, Hub-centric graphs are the appropriate solution, since the SFI content is the Hub.
  • ELGG Software
  • Saywire Application Service Provider
  • Open Journal Peer-review community software
  • New Kid on the block, Buddypress/Wordpress MU
  • Transcript of "Social Network Software - Q3 2009"

    1. 1. SFI Social Networking Application Survey
    2. 2. What are “Social Networks”
    3. 3. Powerlaws Social Networks are “scale free”
    4. 4. Graph Complexity Social graphs are key graphs, but there are other graphs, layered and intermingled with the social graphs
    5. 5. Nodes Hubs and Links Node Hub Link
    6. 6. Links have attributes Node Node <ul><li>Feedback </li></ul><ul><li>Distance or Decay </li></ul><ul><li>Intelligence </li></ul>Link Attributes
    7. 7. Page Rank Intelligence
    8. 8. Key Graphs
    9. 9. ELGG SWOT
    10. 10. Saywire SWOT
    11. 11. Open Journal SWOT
    12. 12. Buddypress / Wordpress MU
    1. A particular slide catching your eye?

      Clipping is a handy way to collect important slides you want to go back to later.

    ×