Disturbances in the supply of electric power can have serious implications for everyday life as well as for national (homeland) security. A power outage can be initiated by natural disasters, adverse weather, technical failures, human errors, sabotage, terrorism, and acts of war. The vulnerability of a system is described as a sensitivity to threats and hazards, and is measured by P (Q(t) > q), i.e. the probability of at least one disturbance with negative societal consequences Q larger than some critical value q, during a given period of time (0,t]. The aim of the thesis is to present methods for quantitative vulnerability analysis of electric power delivery networks to enable effective strategies for prevention, mitigation, response, and recovery to be developed. Paper I provides a framework for vulnerability assessment of infrastructure systems. The paper discusses concepts and perspectives for developing a methodology for vulnerability analysis, and gives examples related to power systems. Paper II analyzes the vulnerability of power delivery systems by means of statistical analysis of Swedish disturbance data. It is demonstrated that the size of large disturbances follows a power law, and that the occurrence of disturbances can be modeled as a Poisson process. Paper III models electric power delivery systems as graphs. Statistical measures for characterizing the structure of two empirical transmission systems are calculated, and a structural vulnerability analysis is performed, i.e. a study of the connectivity of the graph when vertices and edges are disabled. Paper IV discusses the origin of power laws in complex systems in terms of their structure and the dynamics of disturbance propagation. A branching process is used to model the structure of a power distribution system, and it is shown that the disturbance size in this analytical network model follows a power law. Paper V shows how the interaction between an antagonist and the defender of a power system can be modeled as a game. A numerical example is presented, and it is studied if there exists a dominant defense strategy, and if there is an optimal allocation of resources between protection of components, and recovery. / QC 20100831

Recently there have been reports that certain physiological data seem to have the properties of long-range correlation and self-similarity. These two properties can be characterized by a long-range dependent parameter d, as well as a self-similar parameter H. In Peng et al (1995), the alteration of long-range correlations with life-threatening pathologies are studied by analyzing the heart rate data of different groups of subjects. The self-similarity properties of two well-known processes, namely the Fractional Brownian Motion (FBM) and the Fractional ARIMA (FARIMA), are of interest to see if it is suitable to be used to model the heart rate data in order to examine the health conditions of some patients. The Embedded Branching Process (EBP) method for estimating parameter $H$ and a goodness of fit test for examining the self-similarity of a process based on the EBP method are proposed in Jones and Shen (2004). In this work, the performance of the goodness of fit test are examined using simulated data from the FBM and FARIMA processes. A modification of the distribution of the test statistics under null hypothesis is proposed and has been modified to be more appropriate. Some simulation comparisons of different estimation methods of the parameter $H$ for some FARIMA processes are also presented and applied to heart rate data obtained from Kaohsiung Veterans General Hospital.

Mémoire numérisé par la Division de la gestion de documents et des archives de l'Université de Montréal

Mémoire numérisé par la Division de la gestion de documents et des archives de l'Université de Montréal

Submitted by Franciele Moreira (francielemoreyra@gmail.com) on 2017-09-20T18:06:53Z No. of bitstreams: 2 Dissertação - Bruna Luiza de Faria Rezende- 2017.pdf: 1376216 bytes, checksum: 9c03a69f7f93de81123e21bc0a3a36da (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2017-09-21T10:52:16Z (GMT) No. of bitstreams: 2 Dissertação - Bruna Luiza de Faria Rezende- 2017.pdf: 1376216 bytes, checksum: 9c03a69f7f93de81123e21bc0a3a36da (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2017-09-21T10:52:16Z (GMT). No. of bitstreams: 2 Dissertação - Bruna Luiza de Faria Rezende- 2017.pdf: 1376216 bytes, checksum: 9c03a69f7f93de81123e21bc0a3a36da (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2017-08-31 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / In this work a basic immigration process was investigated which starts with a single colony with a single individual at the origin of a homogeneous tree with the other empty vertices. The process colonies are established at the vertices of the graph and each one grows during a random time, according to a process of general counting until a disaster that annihilates part of the population occurs. After the collapse a random amount of individuals survives and attempts to establish, in a independent manner, new colonies in a neighboring vertices. After a time these formed colonies also suffer catastrophes and the process is repeated. It is important to emphasize that the time until the disaster of each colony is independent of the others. Here this general process was studied under two methods, Poisson growth with geometric catastrophe and Yule growth with binomial catastrophe. That is, in each colony the population grows following a Poisson (or Yule), process during a random time, considered here exponential, and soon after that time its size is reduced according to the geometric (or binomial) law. Conditions were analyzed in the set of parameters so that these processes survived and limits were established that were relevant for the probability of survival, the number of colonies generated during the process and the range of the colonies in relation to the initial point. / Neste trabalho foi investigado um processo básico de imigração o qual é iniciado com uma única colônia com um único indivíduo na origem de uma árvore homogênea com os demais vértices vazios. As colônias do processo se estabelecem nos vértices do grafo e cada uma cresce durante um tempo aleatório, de acordo com um processo de contagem geral até ocorrer um desastre que aniquila parte da população. Após o colapso uma quantidade aleatória de indivíduos sobrevive e tenta estabelecer, de forma independente, novas colônias em vértices vizinhos. Depois de um tempo essas colônias formadas também sofrem catástrofes e o processo se repete. É importante enfatizar que o tempo até o desastre de cada colônia independe do das demais. Aqui esse processo geral foi estudado sujeito a dois métodos, crescimento de Poisson com catástrofe geométrica e crescimento de Yule com catástrofe binomial. Ou seja, em cada colônia a população cresce seguindo um processo de Poisson (ou Yule), durante um tempo aleatório, considerado aqui exponencial, e logo após esse tempo seu tamanho é reduzido de acordo com a lei geométrica (ou binomial). Foram analisadas condições no conjunto de parâmetros para que esses processos sobrevivam e foram estabelecidos limites relevantes para a probabilidade de sobrevivência, o número de colônias geradas durante o processo e o alcance das colônias em relação ao ponto inicial.

Ce travail est consacré à l'étude de limites d'échelle de différentes fonctionnelles de marches aléatoires sur un arbre de Galton-Watson, potentiellement en milieu aléatoire. La marche aléatoire que nous considérons sur cet arbre est une marche aux plus proches voisins récurrente nulle, dont les probabilités de transition dépendent de l'environnement. Plus particulièrement, nous étudions la trace de la marche, c'est-à-dire le sous-arbre constitué des sommets visités par celle-ci. Nous considérons d'abord le cas où dans un certain sens l'environnement est à variance finie, et nous montrons que bien renormalisée la trace converge vers la forêt brownienne. Nous considérons ensuite des hypothèses plus faibles, et nous montrons que la fonction de hauteur de la marche (c'est-à-dire la suite des hauteurs prises par la marche) converge vers le processus de hauteur en temps continu d'un processus de Lévy spectralement positif strictement stable, et que la trace de la marche converge vers l'arbre réel codé par ce même processus. La stratégie employée pour établir ces résultats repose sur l'étude d'un type d'arbres que nous introduisons dans cette thèse : ceux-ci sont des arbres de Galton-Watson à deux types, l'un des types étant stérile, et à longueur d'arête. Notre principal résultat concernant ces arbres assure que leur fonction de hauteur satisfait un principe d'invariance, similaire à celui vérifié par les arbres de Galton-Watson simples. Ces arbres trouvent également une application directe dans les arbres de Galton-Watson multitype à infinité de types, un lien explicite entre les deux nous permettant de montrer qu'ils satisfont également le même principe d'invariance. / This work is devoted to the study of scaling limits of different functionals of random walks on a Galton-Watson tree, potentially in random environment. The randow walk we consider is a null recurrent nearest-neigbout random walk, the probability transition of which depend on the environment. More precisely, we study the trace of the walk, that is the sub-tree made up of the vertices visited by the walk. We first consider the case where in a certain sense the environment has finite variance, and we show that when well-renormalised, the trace converges towards the Brownian forest. We then consider hypotheses of regular variation on the environement, and we show that the height function of the walk (that is the sequence of heights in the tree of the walk) converges towards the continuous time height process of a spectrally positive strictly stable Lévy process, and that the trace of the walk converges towards the real tree coded by this very process. The strategy used to prove these two results is based on the study of a certain kind of trees that we introduce in this thesis: they are Galton-Watson trees with two types, one of which being sterile, and with edge lengths. Our main result about these trees states that their height functions satisfies an invariance principle, similar to that verified by simple Galton-Watson trees. These trees also find a direct application in multitype Galton-Watson trees with infinitely many types, as an explicit link between these two kind of trees allow us to show that they satisfy also the same invariance principle.

La théorie classique de la valorisation des produits dérivés se repose sur l'absence de coûts de transaction et une liquidité infinie. Ces hypothèses sont toutefois ne plus véridiques dans le marché réel, en particulier quand la transaction est grande et les actifs non-liquides. Dans ce marché imparfait, on parle du prix de sur-réplication puisque la couverture parfaite est devenue parfois infaisable.La première partie de cette thèse se concentre sur la proposition d’un modèle qui intègre à la fois le coût de transaction et l’impact sur le prix du sous-jacent. Nous commençons par déduire la dynamique de l’actif en temps continu en tant que la limite de la dynamique en temps discret. Sous la contrainte d’une position nulle sur l’actif au début et à la maturité, nous obtenons une équation quasi-linéaire pour le prix du dérivé, au sens de viscosité. Nous offrons la stratégie de couverture parfaite lorsque l’équation admet une solution régulière. Quant à la couverture d’une option européenne “covered” sous la contrainte gamma, le principe de programme dynamique utilisé précédemment n'est plus valide. En suivant les techniques du cible stochastique et de l’équation différentielle partielle, nous démontrons que le prix de la sur-réplication est devenue une solution de viscosité d’une équation non linéaire de type parabolique. Nous construisons également la stratégie ε-optimale, et proposons un schéma numérique.La deuxième partie de cette thèse est consacrée aux études sur un nouveau schéma numérique d'EDSR, basé sur le processus de branchement. Nous rapprochons tout d’abord le générateur Lipschitzien par une suite de polynômes locaux, puis appliquons l’itération de Picard. Chaque itération de Picard peut être représentée en termes de processus de branchement. Nous démontrons la convergence de notre schéma sur l’horizon temporel infini. Un exemple concret est discuté à la fin dans l’objectif d’illustrer la performance de notre algorithme. / Classical derivatives pricing theory assumes frictionless market and infinite liquidity. These assumptions are however easily violated in real market, especially for large trades and illiquid assets. In this imperfect market, one has to consider the super-replication price as perfect hedging becomes infeasible sometimes.The first part of this dissertation focuses on proposing a model incorporating both liquidity cost and price impact. We start by deriving continuous time trading dynamics as the limit of discrete rebalancing policies. Under the constraint of holding zero underlying stock at the inception and the maturity, we obtain a quasi-linear pricing equation in the viscosity sense. A perfect hedging strategy is provided as soons as the equation admits a smooth solution. When it comes to hedging a covered European option under gamma constraint, the dynamic programming principle employed previously is no longer valid. Using stochastic target and partial differential equation smoothing techniques, we prove the super-replication price now becomes the viscosity solution of a fully non-linear parabolic equation. We also show how ε-optimal strategies can be constructed, and propose a numerical resolution scheme.The second part is dedicated to the numerical resolution of the Backward Stochastic Differential Equation (BSDE). We propose a purely forward numerical scheme, which first approximates an arbitrary Lipschitz driver by local polynomials and then applies the Picard iteration to converge to the original solution. Each Picard iteration can be represented in terms of branching diffusion systems, thus avoiding the usual estimation of conditional expectation. We also prove the convergence on an unlimited time horizon. Numerical simulation is also provided to illustrate the performance of the algorithm.

In this work, we are interested in Growth of Galton-Watson trees under two different models: (1) Galton-Watson (GW) forests with lifetimes and/or immigrants, and (2) Galton-Watson forests with mutation, which we call Galton-Watson-Clone-Mutant forests, or GWCMforests. Under each model, we study certain consistent families (Fλ)λ≥0 of GW/GWCM forests and associated decompositions that include backbone decomposition as studied by many authors. Specifically, consistency here refers to the property that for each μ ≤ λ, the forest Fμ has the same distribution as the subforest of Fλ spanned by the blue leaves in a Bernoulli leaf colouring, where each leaf of Fλ is coloured in blue independently with probability μ/λ. In the first model, the case of exponentially distributed lifetimes and no immigration was studied by Duquesne and Winkel and related to the genealogy of Markovian continuous-state branching processes (CSBP). We characterise here such families in the framework of arbitrary lifetime distributions and immigration according to a renewal process, and show convergence to Sagitov’s (non-Markovian) generalisation of continuous-state branching renewal processes, and related processes with immigration. In the second model, we characterise such families in terms of certain bivariate CSBP with branching mechanisms studied previously by Watanabe and show associated convergence results. This is related to, but more general than Bertoin’s study of GWCM trees, and also ties in with work by Abraham and Delmas, who study directly some of the limiting processes.

Grâce aux progrès de la recherche, on sait aujourd’hui guérir près d’un cancer sur deux. Cependant, certaines tumeurs, telles que les glioblastomes restent parmi les plus agressives et les plus difficiles à traiter. La cause de cette résistance aux traitements pourrait provenir d’une sous-population de cellules ayant des caractéristiques communes aux cellules souches que l’on appelle cellules souches cancéreuses. De nombreux modèles mathématiques et numériques de croissance tumorale existent déjà mais peu tiennent compte de l’hétérogénéité intra-tumorale, qui est aujourd’hui un véritable challenge. Cette thèse s’intéresse à la dynamique des différentes sous-populations cellulaires d’un glioblastome. Elle consiste en l’élaboration d’un modèle mathématique de croissance tumorale reposant sur un processus de branchement de Bellman-Harris, à la fois multi-type et dépendant de l’âge. Ce modèle permet d’intégrer l’hétérogénéité cellulaire. Des simulations numériques reproduisent l’évolution des différents types de cellules et permettent de tester l’action de différents schémas thérapeutiques sur le développement tumoral. Une méthode d’estimation des paramètres du modèle numérique fondée sur le pseudo-maximum de vraisemblance a été adaptée. Cette approche est une alternative au maximum de vraisemblance dans le cas où la distribution de l’échantillon est inconnue. Enfin, nous présentons les expérimentations biologiques qui ont été mises en place dans le but de valider le modèle numérique / The latest advances in cancer research are paving the way to better treatments. However, some tumors such as glioblastomas remain among the most aggressive and difficult to treat. The cause of this resistance could be due to a sub-population of cells with characteristics common to stem cells. Many mathematical and numerical models on tumor growth already exist but few take into account the tumor heterogeneity. It is now a real challenge. This thesis focuses on the dynamics of different cell subpopulations in glioblastoma. It involves the development of a mathematical model of tumor growth based on a multitype, age-dependent branching process. This model allows to integrate cellular heterogeneity. Numerical simulations reproduce the evolution of different types of cells and simulate the action of several therapeutic strategies. A method of parameters estimation based on the pseudo-maximum likelihood has been developed. This approach is an alternative to the maximum likelihood in the case where the sample distribution is unknown. Finally, we present the biological experiments that have been implemented in order to validate the numerical model

Cette thèse se compose de quatre chapitres:Le chapitre 1 étudie la distribution du temps de coalescence (plus récent ancêtre commun) de deux individus tirés au hasard (uniformly) dans la génération actuelle d'un processus de Bienaymé-Galton-Watson en temps continu.Dans le chapitre 2, nous obtenons une représentation de la diffusion de Feller logistique en termes des temps locaux d'un mouvement brownien réfléchi H avec une dérive qui est affine en le temps local accumulé par H à son niveau actuel.Le chapitre 3 considère la diffusion de Feller avec compétition générale. Nous donnons des conditions précises sur le terme de la concurrence, pour le but de décider si le temps d'extinction (qui est aussi la hauteur du processus) reste borné ou non lorsque la taille initiale de la population tend vers l'infini, et de même pour la masse totale du processus.Dans le chapitre 4, nous généralisons les résultats du chapitre 3 pour le cas du processus de branchement à espace d'état continu avec compétition à trajectoires discontinues. / This thesis consists of four chapters:Chapter 1 investigates the distribution of the coalescence time (most recent common ancestor) for two individuals picked at random (uniformly) in the current generation of a continuous time Bienaymé-Galton-Watson process.In chapter 2 we obtain a Ray-Knight representation of Feller's branching diffusion with logistic growth in terms of the local times of a reflected Brownian motion H with a drift that is affine in the local time accumulated by H at its current level.Chapter 3 considers the Feller's branching diffusion with general competition. We give precise conditions on the competition term, in order to decide whether the extinction time (which is also the height of the process) remains or not bounded as the initial population size tends to infinity, and similarly for the total mass of the process.In chapter 4 we generalize the results of chapter 3 to the case of continuous state branching process with competition which has discontinuous paths.