Grant: Discovery Grants Program - Individual
University of Toronto
$22,000.00
Limits of discrete structures
EF 2008-09
Résumé
The usual method to understand the structure of large networks (such as communication networks, or neural networks, etc...) goes by randomly sampling some type of information that we are able to analyze. The main questions are: "What type of information do we need to sample?" and "How do we extract information about the whole network?" The present research proposal suggests a new approach. We assume that the networks grow for an infinite amount of time and then we apply analytic methods for the limit object.
We study a deep mathematical theory which, amongst other things, allows one to model these growing networks. This theory links many subjects such as ergodic theory, combinatorics, probability theory, arithmetic combinatorics. It leads to proofs of mathematical theorems in a surprisingly broad range of areas.
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
341198-2008
Name nom
Szegedy, Balazs
Department département
Computer and Mathematical Sciences
Organization id
31
Institution établissement
University of Toronto
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2008
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
337
Committee name en
Pure & Applied Maths - B
Committee name fr
Maths pures et appliquées - B
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
2914
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Combinatorics
Research subject fr
Combinatoire
Partie
1
Nb partie
5
Application title
Limits of discrete structures
Keyword
NA
Application summary
The usual method to understand the structure of large networks (such as communication networks, or neural networks, etc...) goes by randomly sampling some type of information that we are able to analyze. The main questions are: "What type of information do we need to sample?" and "How do we extract information about the whole network?" The present research proposal suggests a new approach. We assume that the networks grow for an infinite amount of time and then we apply analytic methods for the limit object.
We study a deep mathematical theory which, amongst other things, allows one to model these growing networks. This theory links many subjects such as ergodic theory, combinatorics, probability theory, arithmetic combinatorics. It leads to proofs of mathematical theorems in a surprisingly broad range of areas.