Grant: Discovery Grants Program - Individual
Dalhousie University
$22,000.00
Graph models for self-organizing networks
FY 2011-12
Summary
The last decade has seen increased interest in the structure of self-organizing networks such as the World Wide Web, social networks, and biological networks: for example those formed by the interactions of proteins in a cell. This interest has opened up a new direction of study in graph theory, which combines elements of the theory of random graphs, structural graph theory, graph clustering, and infinite graphs. In addition, some of the techniques that need to be employed to model these real-life networks are akin to those used in the natural sciences, but are not part of traditional graph theory: exploration of the data, development and analysis of stochastic models, and validation of the models.
My current research interest lies in the analysis of those stochastic graph models that I consider the most promising. In particular, I intend to continue my study of the ""generalized copy model"". This model is based on the evolutionary principle of duplication and error. New nodes joining the graph ""copy"" each of the links of an existing node with a certain probability, and then add a pre-defined number of randomly chosen extra ""error"" links. A promising new tool to analyze this and other models is the study of the infinite limit of the model.
A second class of models that hold my interest are models that have a ""geometric"" component. This means that each node corresponds to a point in some Euclidean space, and its attachment to the rest of the graph is influenced by its geometric position with respect to other nodes. Geometric models seem to have many features that correspond to those observed in real- life self-organizing networks. In particular, I would like to study the possibility of ""reverse engineering"" a graph generated according to geometric principles: given a graph that is assumed to be generated according to a certain geometric model, is it possible to estimate the position of the corresponding points? Solving this problem would give rise to new tools to extract community structure in social networks, better Web search methods, and generally give us a better understanding of networked data.
Program
Discovery Grants Program - Individual
Recipient
Location
Nova Scotia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
203246-2007
Name nom
Janssen, Jeannette
Department département
Mathematics and Statistics
Organization id
79
Institution établissement
Dalhousie University
Province en
Nova Scotia
Province fr
Nouvelle-Écosse
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2007
Award amount
22000
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
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2717
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Modelling and simulation studies
Research subject fr
Études de modélisation et de simulation
Partie
5
Nb partie
5
Application title
Graph models for self-organizing networks
Keyword
NSERC
Application summary
The last decade has seen increased interest in the structure of self-organizing networks such as the World Wide Web, social networks, and biological networks: for example those formed by the interactions of proteins in a cell. This interest has opened up a new direction of study in graph theory, which combines elements of the theory of random graphs, structural graph theory, graph clustering, and infinite graphs. In addition, some of the techniques that need to be employed to model these real-life networks are akin to those used in the natural sciences, but are not part of traditional graph theory: exploration of the data, development and analysis of stochastic models, and validation of the models.
My current research interest lies in the analysis of those stochastic graph models that I consider the most promising. In particular, I intend to continue my study of the ""generalized copy model"". This model is based on the evolutionary principle of duplication and error. New nodes joining the graph ""copy"" each of the links of an existing node with a certain probability, and then add a pre-defined number of randomly chosen extra ""error"" links. A promising new tool to analyze this and other models is the study of the infinite limit of the model.
A second class of models that hold my interest are models that have a ""geometric"" component. This means that each node corresponds to a point in some Euclidean space, and its attachment to the rest of the graph is influenced by its geometric position with respect to other nodes. Geometric models seem to have many features that correspond to those observed in real- life self-organizing networks. In particular, I would like to study the possibility of ""reverse engineering"" a graph generated according to geometric principles: given a graph that is assumed to be generated according to a certain geometric model, is it possible to estimate the position of the corresponding points? Solving this problem would give rise to new tools to extract community structure in social networks, better Web search methods, and generally give us a better understanding of networked data.