Grant: Discovery Grants Program - Individual
University of Ottawa
$16,000.00
Rare events
FY 2012-13
Summary
Rare events arise, often with catastrophic consequences, in fields such as finance, manufacturing and telecommunications. A rare event might be large number of claims in a short period of time bankrupting an insurance company or an unexpectedly high rate of packet arrivals may cause a buffer overload in a telecommunications system. Rare events are difficult to simulate precisely because the event of interest occurs so rarely. The proposal is to calculate the probability of particular large deviations, and find the most probable path. These two pieces of information can help redesign a system to make the rare event even less likely. Of particular interest are large deviations where the most probable path is nonlinear; i.e. it is sometimes the case that one gets sideswiped by a rare event in another part of the system whose failure cascades across the network. A recent idea of an approximate time reversal seems to be the key to solving these nonlinear problems. The applicant hopes to apply these methods to finance (R. Nikzad is working on a problem relevant to the bank of Canada) to rare event simulation (Jesse Collingwood is doing his Ph.D. on rare events in engineering) and to telecommunications.
The applicant has applied mean field analysis to a router buffering TCP/IP traffic and to Wi-Fi nodes sharing an access point. Geometry doesn't play a role in any of the above applications. However to design a medium access protocol for an ad-hoc network of wireless sources one has to take spacial reuse of the bandwidth into account since users can transmit simultaneously if they are sufficiently distant. The applicant hopes find a distributed stochastic algorithm that finds an optimal deterministic schedule for the users in such a network. The candidate also works on nonparametric regression (A. Sumi is using a Cramer von Mises statistic to determine smoothing parameters) and on random matrices (N. Kotb is estimating large covariance matrices and T. Khousa is simulating large random matrices with a given covariance structure).
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
4551-2011
Name nom
McDonald, David
Department département
Mathematics and Statistics
Organization id
28
Institution établissement
University of Ottawa
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2012
Competition year année de concours
2011
Award amount
16000
Program id
RGPIN
Program name 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
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
3008
Research subject group en
Statistics and probability
Research subject group fr
Statistique et probabilité
Research subject en
Applied probability
Research subject fr
Probabilité appliquée
Partie
2
Nb partie
5
Application title
Rare events
Keyword
NSERC
Application summary
Rare events arise, often with catastrophic consequences, in fields such as finance, manufacturing and telecommunications. A rare event might be large number of claims in a short period of time bankrupting an insurance company or an unexpectedly high rate of packet arrivals may cause a buffer overload in a telecommunications system. Rare events are difficult to simulate precisely because the event of interest occurs so rarely. The proposal is to calculate the probability of particular large deviations, and find the most probable path. These two pieces of information can help redesign a system to make the rare event even less likely. Of particular interest are large deviations where the most probable path is nonlinear; i.e. it is sometimes the case that one gets sideswiped by a rare event in another part of the system whose failure cascades across the network. A recent idea of an approximate time reversal seems to be the key to solving these nonlinear problems. The applicant hopes to apply these methods to finance (R. Nikzad is working on a problem relevant to the bank of Canada) to rare event simulation (Jesse Collingwood is doing his Ph.D. on rare events in engineering) and to telecommunications.
The applicant has applied mean field analysis to a router buffering TCP/IP traffic and to Wi-Fi nodes sharing an access point. Geometry doesn't play a role in any of the above applications. However to design a medium access protocol for an ad-hoc network of wireless sources one has to take spacial reuse of the bandwidth into account since users can transmit simultaneously if they are sufficiently distant. The applicant hopes find a distributed stochastic algorithm that finds an optimal deterministic schedule for the users in such a network. The candidate also works on nonparametric regression (A. Sumi is using a Cramer von Mises statistic to determine smoothing parameters) and on random matrices (N. Kotb is estimating large covariance matrices and T. Khousa is simulating large random matrices with a given covariance structure).