Grant: Discovery Grants Program - Individual
University of Toronto
$34,000.00
Theoretical foundations of online social networks
EF 2011-12
Résumé
Online social networks have revolutionized the way we interact and share information over the Internet, and social networking applications such as YouTube, Flickr, MySpace, Facebook, etc., have millions of active users. While already being enormously popular, we currently have a very limited formal understanding of online social networks. The goal of this research project to fill in this gap by working towards a theoretical foundation for the understanding and algorithm design for online social networks. The two main topics of the project will be on providing a mathematical models and results on how online social networks are formed, and on how we can use the understanding of the topologies and characteristics of online social networks to design efficient algorithms and protocols for content search, sharing, and distribution. Below we provide a brief
description of these two main themes.
As part of the project, we propose to develop novel mathematical models of how online social networks are formed, and be able to formally characterize the network structure, topologies, and properties of online social networks. While there are models available that characterize the macroscopic properties of social networks, such as the well-known small world phenomena, there are currently no satisfying models for the microscopic properties such as on (a) how individual users decide on the network connections they create, and (b) what networks properties and topologies emerge from the individual decision and actions made by users.
In addition, we propose to use the knowledge about network topologies of online social network to design efficient algorithms and protocols to share and distributed information. Particular applications that we will focus on is (a) content search, (b) content distribution, (c) recommender systems, and (d) community identification.
Methodologies that we will be using for our analysis include game theory, random graphs, expander graphs,
We believe that the formal understanding, mathematical models and characterization, and insights into online social networks can help to created and design novel online social networking, and communication, applications that go well beyond of what today's social networking applications are capable of doing. Our long term goal is to design algorithms and protocols that allow to build online social networking applications that behave, and have capabilities, similar to the social networks that we use in our everyday life. As such, our models and results will also provide insights into how and why the social networks that we form and use in our everyday life are so efficient for information search. sharing, and communication.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
239727-2010
Name nom
Marbach, Peter
Department département
Computer Science
Organization id
31
Institution établissement
University of Toronto
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2010
Award amount
34000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
803
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer communications
Area of application fr
Téléinformatique
Research subject code
2508
Research subject group en
Electrical and electronic engineering
Research subject group fr
Génie électrique et électronique
Research subject en
Communications networks
Research subject fr
Réseaux de télécommunications
Partie
2
Nb partie
5
Application title
Theoretical foundations of online social networks
Keyword
NSERC
Application summary
Online social networks have revolutionized the way we interact and share information over the Internet, and social networking applications such as YouTube, Flickr, MySpace, Facebook, etc., have millions of active users. While already being enormously popular, we currently have a very limited formal understanding of online social networks. The goal of this research project to fill in this gap by working towards a theoretical foundation for the understanding and algorithm design for online social networks. The two main topics of the project will be on providing a mathematical models and results on how online social networks are formed, and on how we can use the understanding of the topologies and characteristics of online social networks to design efficient algorithms and protocols for content search, sharing, and distribution. Below we provide a brief
description of these two main themes.
As part of the project, we propose to develop novel mathematical models of how online social networks are formed, and be able to formally characterize the network structure, topologies, and properties of online social networks. While there are models available that characterize the macroscopic properties of social networks, such as the well-known small world phenomena, there are currently no satisfying models for the microscopic properties such as on (a) how individual users decide on the network connections they create, and (b) what networks properties and topologies emerge from the individual decision and actions made by users.
In addition, we propose to use the knowledge about network topologies of online social network to design efficient algorithms and protocols to share and distributed information. Particular applications that we will focus on is (a) content search, (b) content distribution, (c) recommender systems, and (d) community identification.
Methodologies that we will be using for our analysis include game theory, random graphs, expander graphs,
We believe that the formal understanding, mathematical models and characterization, and insights into online social networks can help to created and design novel online social networking, and communication, applications that go well beyond of what today's social networking applications are capable of doing. Our long term goal is to design algorithms and protocols that allow to build online social networking applications that behave, and have capabilities, similar to the social networks that we use in our everyday life. As such, our models and results will also provide insights into how and why the social networks that we form and use in our everyday life are so efficient for information search. sharing, and communication.