DOCSLIB.ORG

2 Cluster and Feature Modeling from Combinatorial Stochastic Processes 6 2.1 Introduction

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Clusters and Features from Combinatorial Stochastic Processes by Tamara Ann Broderick A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Statistics in the Graduate Division of the University of California, Berkeley Committee in charge: Professor Michael I. Jordan, Chair Professor Thomas L. Griffiths Professor Cari Kaufman Professor James W. Pitman Fall 2014 Clusters and Features from Combinatorial Stochastic Processes Copyright 2014 by Tamara Ann Broderick 1 Abstract Clusters and Features from Combinatorial Stochastic Processes by Tamara Ann Broderick Doctor of Philosophy in Statistics University of California, Berkeley Professor Michael I. Jordan, Chair Clustering involves placing entities into mutually exclusive categories. We wish to relax the requirement of mutual exclusivity, allowing objects to belong simultaneously to multiple classes, a formulation that we refer to as \feature allocation." The first step is a theoretical one. In the case of clustering the class of probability distributions over exchangeable parti- tions of a dataset has been characterized (via exchangeable partition probability functions and the Kingman paintbox). These characterizations support an elegant nonparametric Bayesian framework for clustering in which the number of clusters is not assumed to be known a priori. We establish an analogous characterization for feature allocation; we define notions of \exchangeable feature probability functions" and \feature paintboxes" that lead to a Bayesian framework that does not require the number of features to be fixed a priori. We focus on particular models within this framework that are both practical for inference and provide desirable modeling properties. And we explore a further generalization to fea- ture allocations where objects may exhibit any non-negative integer number of features, or traits. The second step is a computational one. Rather than appealing to Markov chain Monte Carlo for Bayesian inference, we develop a method to transform Bayesian methods for feature allocation (and other latent structure problems) into optimization problems with objective functions analogous to K-means in the clustering setting. These yield approximations to Bayesian inference that are scalable to large inference problems. i Contents Contents i List of Figures iv List of Tables vi List of Algorithms vii 1 Introduction 1 I Models, connections, and inference 5 2 Cluster and feature modeling from combinatorial stochastic processes 6 2.1 Introduction . 6 2.2 Partitions and feature allocations . 8 2.3 Exchangeable probability functions . 10 2.4 Stick lengths . 22 2.5 Subordinators . 28 2.6 Completely random measures . 37 2.7 Discussion . 41 3 Beta processes, stick-breaking, and power laws 43 3.1 Introduction . 43 3.2 The beta process and the Bernoulli process . 46 3.3 Stick-breaking for the Dirichlet process . 49 3.4 Power law behavior . 51 3.5 Stick-breaking for the beta process . 53 3.6 Power law derivations . 57 3.7 Simulation . 65 3.8 Experimental results . 68 3.9 Discussion . 72 3.A A Markov chain Monte Carlo algorithm . 72 ii 4 Combinatorial clustering and the beta negative binomial process 78 4.1 Introduction . 78 4.2 Completely random measures . 81 4.3 Conjugacy and combinatorial clustering . 85 4.4 Mixtures and admixtures . 89 4.5 Asymptotics . 92 4.6 Simulation . 94 4.7 Posterior inference . 95 4.8 Document topic modeling . 99 4.9 Image segmentation and object recognition . 101 4.10 Discussion . 106 4.A Connections . 106 4.B Proofs for Appendix 4.A . 109 4.C Full results for Section 4.5 . 111 4.D Proofs for Appendix 4.C . 113 4.E Conjugacy proofs . 120 4.F Posterior inference details . 136 5 Feature allocations, probability functions, and paintboxes 140 5.1 Introduction . 140 5.2 Feature allocations . 142 5.3 Labeling features . 144 5.4 Exchangeable feature probability function . 150 5.5 The Kingman paintbox and feature paintbox . 155 5.6 Feature frequency models . 158 5.7 Discussion . 168 5.A Intermediate lemmas leading to Lemma 5.6.6 . 169 5.B Proof of Lemma 5.6.6 . 170 5.C Proof of Lemma 5.A.1 . 171 5.D Proof of Lemma 5.A.2 . 172 6 Posteriors, conjugacy, and exponential families for CRMs 175 6.1 Introduction . 175 6.2 Bayesian models based on completely random measures . 178 6.3 Posteriors . 184 6.4 Exponential families . 188 6.5 Size-biased representations . 195 6.6 Marginal processes . 202 6.7 Discussion . 209 6.A Further automatic conjugate priors . 209 6.B Further size-biased representations . 211 6.C Further marginals . 212 iii II Scaling inference 214 7 Streaming variational Bayes 215 7.1 Introduction . 215 7.2 Streaming, distributed, asynchronous Bayesian updating . 216 7.3 Case study: latent Dirichlet allocation . 219 7.4 Evaluation . 223 7.5 Discussion . 226 7.A Variational Bayes . 228 7.B Expectation propagation . 234 8 MAP-based asymptotic derivations from Bayes 239 8.1 Introduction . 239 8.2 MAP asymptotics for clusters . 241 8.3 MAP asymptotics for features . 243 8.4 Extensions . 245 8.5 Experiments . 247 8.6 Discussion . 252 8.A DP-means objective derivation . 252 8.B BP-means objective derivation . 253 8.C Collapsed DP-means objective derivation . 254 8.D Collapsed BP-means objective derivation . 256 8.E Parametric objectives . 256 8.F General multivariate Gaussian likelihood . 258 8.G Proof of BP-means local convergence . 259 Bibliography 261 iv List of Figures 2.1 A Chinese restaurant process seating arrangement. 11 2.2 An Indian buffet process sample. 15 2.3 Stick-breaking. 24 2.4 A P´olya urn interpretation of the Chinese restaurant process. 25 2.5 A P´olya urn interpretation of the Indian buffet process. 27 2.6 A subordinator. 30 2.7 Poisson thinning. 32 2.8 The gamma process. 39 2.9 The beta process. 40 3.1 Poisson point process with beta density. 47 3.2 Bernoulli process. 48 3.3 Stick-breaking process. 50 3.4 Poissonization. 59 3.5 Simulated feature count growth as a function of number of data points. 66 3.6 Features of size j as a function of j and lack of Type III power laws. 67 3.7 Simulated and theoretical feature frequencies. 68 3.8 Latent feature cardinality as a function of MCMC iteration. 70 3.9 Hyperparameter values as a function of MCMC iteration. 70 3.10 Autocorrelation of hyperparameters. 71 3.11 Feature means learned for MNIST handwritten digits data. 72 4.1 Simulated and asymptotic number of clusters. 96 4.2 Number of admixture components found by the finite and exact samplers. 98 4.3 Document length distributions and word.
Recommended publications
  • Partnership As Experimentation: Business Organization and Survival in Egypt, 1910–1949

    Partnership As Experimentation: Business Organization and Survival in Egypt, 1910–1949

    Yale University EliScholar – A Digital Platform for Scholarly Publishing at Yale Discussion Papers Economic Growth Center 5-1-2017 Partnership as Experimentation: Business Organization and Survival in Egypt, 1910–1949 Cihan Artunç Timothy Guinnane Follow this and additional works at: https://elischolar.library.yale.edu/egcenter-discussion-paper-series Recommended Citation Artunç, Cihan and Guinnane, Timothy, "Partnership as Experimentation: Business Organization and Survival in Egypt, 1910–1949" (2017). Discussion Papers. 1065. https://elischolar.library.yale.edu/egcenter-discussion-paper-series/1065 This Discussion Paper is brought to you for free and open access by the Economic Growth Center at EliScholar – A Digital Platform for Scholarly Publishing at Yale. It has been accepted for inclusion in Discussion Papers by an authorized administrator of EliScholar – A Digital Platform for Scholarly Publishing at Yale. For more information, please contact [email protected]. ECONOMIC GROWTH CENTER YALE UNIVERSITY P.O. Box 208269 New Haven, CT 06520-8269 http://www.econ.yale.edu/~egcenter Economic Growth Center Discussion Paper No. 1057 Partnership as Experimentation: Business Organization and Survival in Egypt, 1910–1949 Cihan Artunç University of Arizona Timothy W. Guinnane Yale University Notes: Center discussion papers are preliminary materials circulated to stimulate discussion and critical comments. This paper can be downloaded without charge from the Social Science Research Network Electronic Paper Collection: https://ssrn.com/abstract=2973315 Partnership as Experimentation: Business Organization and Survival in Egypt, 1910–1949 Cihan Artunç⇤ Timothy W. Guinnane† This Draft: May 2017 Abstract The relationship between legal forms of firm organization and economic develop- ment remains poorly understood. Recent research disputes the view that the joint-stock corporation played a crucial role in historical economic development, but retains the view that the costless firm dissolution implicit in non-corporate forms is detrimental to investment.
  • A Model of Gene Expression Based on Random Dynamical Systems Reveals Modularity Properties of Gene Regulatory Networks†

    A Model of Gene Expression Based on Random Dynamical Systems Reveals Modularity Properties of Gene Regulatory Networks†

    A Model of Gene Expression Based on Random Dynamical Systems Reveals Modularity Properties of Gene Regulatory Networks† Fernando Antoneli1,4,*, Renata C. Ferreira3, Marcelo R. S. Briones2,4 1 Departmento de Informática em Saúde, Escola Paulista de Medicina (EPM), Universidade Federal de São Paulo (UNIFESP), SP, Brasil 2 Departmento de Microbiologia, Imunologia e Parasitologia, Escola Paulista de Medicina (EPM), Universidade Federal de São Paulo (UNIFESP), SP, Brasil 3 College of Medicine, Pennsylvania State University (Hershey), PA, USA 4 Laboratório de Genômica Evolutiva e Biocomplexidade, EPM, UNIFESP, Ed. Pesquisas II, Rua Pedro de Toledo 669, CEP 04039-032, São Paulo, Brasil Abstract. Here we propose a new approach to modeling gene expression based on the theory of random dynamical systems (RDS) that provides a general coupling prescription between the nodes of any given regulatory network given the dynamics of each node is modeled by a RDS. The main virtues of this approach are the following: (i) it provides a natural way to obtain arbitrarily large networks by coupling together simple basic pieces, thus revealing the modularity of regulatory networks; (ii) the assumptions about the stochastic processes used in the modeling are fairly general, in the sense that the only requirement is stationarity; (iii) there is a well developed mathematical theory, which is a blend of smooth dynamical systems theory, ergodic theory and stochastic analysis that allows one to extract relevant dynamical and statistical information without solving
  • POISSON PROCESSES 1.1. the Rutherford-Chadwick-Ellis

    POISSON PROCESSES 1.1. the Rutherford-Chadwick-Ellis

    POISSON PROCESSES 1. THE LAW OF SMALL NUMBERS 1.1. The Rutherford-Chadwick-Ellis Experiment. About 90 years ago Ernest Rutherford and his collaborators at the Cavendish Laboratory in Cambridge conducted a series of pathbreaking experiments on radioactive decay. In one of these, a radioactive substance was observed in N = 2608 time intervals of 7.5 seconds each, and the number of decay particles reaching a counter during each period was recorded. The table below shows the number Nk of these time periods in which exactly k decays were observed for k = 0,1,2,...,9. Also shown is N pk where k pk = (3.87) exp 3.87 =k! {− g The parameter value 3.87 was chosen because it is the mean number of decays/period for Rutherford’s data. k Nk N pk k Nk N pk 0 57 54.4 6 273 253.8 1 203 210.5 7 139 140.3 2 383 407.4 8 45 67.9 3 525 525.5 9 27 29.2 4 532 508.4 10 16 17.1 5 408 393.5 ≥ This is typical of what happens in many situations where counts of occurences of some sort are recorded: the Poisson distribution often provides an accurate – sometimes remarkably ac- curate – fit. Why? 1.2. Poisson Approximation to the Binomial Distribution. The ubiquity of the Poisson distri- bution in nature stems in large part from its connection to the Binomial and Hypergeometric distributions. The Binomial-(N ,p) distribution is the distribution of the number of successes in N independent Bernoulli trials, each with success probability p.
  • STOCHASTIC COMPARISONS and AGING PROPERTIES of an EXTENDED GAMMA PROCESS Zeina Al Masry, Sophie Mercier, Ghislain Verdier

    STOCHASTIC COMPARISONS and AGING PROPERTIES of an EXTENDED GAMMA PROCESS Zeina Al Masry, Sophie Mercier, Ghislain Verdier

    STOCHASTIC COMPARISONS AND AGING PROPERTIES OF AN EXTENDED GAMMA PROCESS Zeina Al Masry, Sophie Mercier, Ghislain Verdier To cite this version: Zeina Al Masry, Sophie Mercier, Ghislain Verdier. STOCHASTIC COMPARISONS AND AGING PROPERTIES OF AN EXTENDED GAMMA PROCESS. Journal of Applied Probability, Cambridge University press, 2021, 58 (1), pp.140-163. 10.1017/jpr.2020.74. hal-02894591 HAL Id: hal-02894591 https://hal.archives-ouvertes.fr/hal-02894591 Submitted on 9 Jul 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Applied Probability Trust (4 July 2020) STOCHASTIC COMPARISONS AND AGING PROPERTIES OF AN EXTENDED GAMMA PROCESS ZEINA AL MASRY,∗ FEMTO-ST, Univ. Bourgogne Franche-Comt´e,CNRS, ENSMM SOPHIE MERCIER & GHISLAIN VERDIER,∗∗ Universite de Pau et des Pays de l'Adour, E2S UPPA, CNRS, LMAP, Pau, France Abstract Extended gamma processes have been seen to be a flexible extension of standard gamma processes in the recent reliability literature, for cumulative deterioration modeling purpose. The probabilistic properties of the standard gamma process have been well explored since the 1970's, whereas those of its extension remain largely unexplored. In particular, stochastic comparisons between degradation levels modeled by standard gamma processes and aging properties for the corresponding level-crossing times are nowadays well understood.
  • Hierarchical Dirichlet Process Hidden Markov Model for Unsupervised Bioacoustic Analysis

    Hierarchical Dirichlet Process Hidden Markov Model for Unsupervised Bioacoustic Analysis

    Hierarchical Dirichlet Process Hidden Markov Model for Unsupervised Bioacoustic Analysis Marius Bartcus, Faicel Chamroukhi, Herve Glotin Abstract-Hidden Markov Models (HMMs) are one of the the standard HDP-HMM Gibbs sampling has the limitation most popular and successful models in statistics and machine of an inadequate modeling of the temporal persistence of learning for modeling sequential data. However, one main issue states [9]. This problem has been addressed in [9] by relying in HMMs is the one of choosing the number of hidden states. on a sticky extension which allows a more robust learning. The Hierarchical Dirichlet Process (HDP)-HMM is a Bayesian Other solutions for the inference of the hidden Markov non-parametric alternative for standard HMMs that offers a model in this infinite state space models are using the Beam principled way to tackle this challenging problem by relying sampling [lO] rather than Gibbs sampling. on a Hierarchical Dirichlet Process (HDP) prior. We investigate the HDP-HMM in a challenging problem of unsupervised We investigate the BNP formulation for the HMM, that is learning from bioacoustic data by using Markov-Chain Monte the HDP-HMM into a challenging problem of unsupervised Carlo (MCMC) sampling techniques, namely the Gibbs sampler. learning from bioacoustic data. The problem consists of We consider a real problem of fully unsupervised humpback extracting and classifying, in a fully unsupervised way, whale song decomposition. It consists in simultaneously finding the structure of hidden whale song units, and automatically unknown number of whale song units. We use the Gibbs inferring the unknown number of the hidden units from the Mel sampler to infer the HDP-HMM from the bioacoustic data.
  • Hyperwage Theory

    Hyperwage Theory

    Hyperwage Theory About the cover The cover is a glowing red-hot bark of a tree embedded with the greatest equations of nature that tremendously impacted the thought of mankind and the course of civilization. These are the Maxwell’s electromagnetic field equations, the Navier-Stokes Theorem, Euler’s identity, Newton’s second law of motion, Newton’s law of gravitation, the ideal gas equation of state, Stefan’s law, the Second Law of Thermodynamics, Einstein’s mass-energy equivalence, Einstein’s gravity tensor equation, Lorenz time dilation, Planck’s Law, Heisenberg’s Uncertainty Principle, Schrodinger’s equation, Shannon’s Theorem, and Feynman diagrams in quantum electrodynamics. Concept and design by Thads Bentulan Hyperwage Theory The Misadventures of the Street Strategist Volume 10 Thads Bentulan Street Strategist First Edition 2008 Street Strategist Publications Limited Hyperwage Theory The Misadventures of the Street Strategist Volume 10 by Thads Bentulan ISBN 978-988-17536-9-4 This book is a compilation of articles that first appeared in BusinessWorld, unless otherwise noted. While the author endeavored to credit sources whenever possible, he welcomes corrections for any unacknowledged material. No part of this book may be reproduced, stored, or utilized in any form or by any means, electronic or mechanical, including photocopying, or recording, or by any information storage and retrieval system, including internet websites, without prior written permission. Copyright 2005-2008 by Thads Bentulan [email protected] 08/24/09
  • Introduction to Lévy Processes

    Introduction to Lévy Processes

    Introduction to L´evyprocesses Graduate lecture 22 January 2004 Matthias Winkel Departmental lecturer (Institute of Actuaries and Aon lecturer in Statistics) 1. Random walks and continuous-time limits 2. Examples 3. Classification and construction of L´evy processes 4. Examples 5. Poisson point processes and simulation 1 1. Random walks and continuous-time limits 4 Definition 1 Let Yk, k ≥ 1, be i.i.d. Then n X 0 Sn = Yk, n ∈ N, k=1 is called a random walk. -4 0 8 16 Random walks have stationary and independent increments Yk = Sk − Sk−1, k ≥ 1. Stationarity means the Yk have identical distribution. Definition 2 A right-continuous process Xt, t ∈ R+, with stationary independent increments is called L´evy process. 2 Page 1 What are Sn, n ≥ 0, and Xt, t ≥ 0? Stochastic processes; mathematical objects, well-defined, with many nice properties that can be studied. If you don’t like this, think of a model for a stock price evolving with time. There are also many other applications. If you worry about negative values, think of log’s of prices. What does Definition 2 mean? Increments , = 1 , are independent and Xtk − Xtk−1 k , . , n , = 1 for all 0 = . Xtk − Xtk−1 ∼ Xtk−tk−1 k , . , n t0 < . < tn Right-continuity refers to the sample paths (realisations). 3 Can we obtain L´evyprocesses from random walks? What happens e.g. if we let the time unit tend to zero, i.e. take a more and more remote look at our random walk? If we focus at a fixed time, 1 say, and speed up the process so as to make n steps per time unit, we know what happens, the answer is given by the Central Limit Theorem: 2 Theorem 1 (Lindeberg-L´evy) If σ = V ar(Y1) < ∞, then Sn − (Sn) √E → Z ∼ N(0, σ2) in distribution, as n → ∞.
  • The 7Th Workshop on MARKOV PROCESSES and RELATED TOPICS

    The 7Th Workshop on MARKOV PROCESSES and RELATED TOPICS

    The 7th Workshop on MARKOV PROCESSES AND RELATED TOPICS July 19 - 23, 2010 No.6 Lecture room on 3th floor, Jingshi Building (京京京师师师大大大厦厦厦) Beijing Normal University Organizers: Mu-Fa Chen, Zeng-Hu Li, Feng-Yu Wang Supported by National Natural Science Foundation of China (No. 10721091) Probability Group, Stochastic Research Center School of Mathematical Sciences, Beijing Normal University No.19, Xinjiekouwai St., Beijing 100875, China Phone and Fax: 86-10-58809447 E-mail: [email protected] Website: http://math.bnu.edu.cn/probab/Workshop2010 Schedule 1 July 19 July 20 July 21 July 22 July 23 Chairman Mu-Fa Chen Fu-Zhou Gong Shui Feng Jie Xiong Dayue Chen Opening Shuenn-Jyi Sheu Anyue Chen Leonid Mytnik Zengjing Chen 8:30{8:40 8:30{9:00 8:30{9:00 8:30{9:00 8:30{9:00 M. Fukushima Feng-Yu Wang Jiashan Tang Quansheng Liu Dong Han 8:40{9:30 9:00{9:30 9:00{9:30 9:00{9:30 9:00{9:30 Speaker Tea Break Zhen-Qing Chen Renming Song Xia Chen Hao Wang Zongxia Liang 10:00{10:30 10:00{10:30 10:00{10:30 10:00{10:305 10:00{10:30 Panki Kim Christian Leonard Yutao Ma Xiaowen Zhou Fubao Xi 10:30{11:00 10:30{11:00 10:30{11:00 10:30{11:00 10:30{11:00 Jinghai Shao Xu Zhang Liang-Hui Xia Hui He Liqun Niu 11:00{11:30 11:00{11:20 11:00{11:20 11:00{11:20 11:00{11:20 Lunch Chairman Feng-Yu Wang Shizan Fang Zengjing Chen Zeng-Hu Li Chii-Ruey Hwang Tusheng Zhang Dayue Chen Shizan Fang 14:30{15:00 14:30{15:00 14:30{15:00 14:30{15:00 Ivan Gentil Xiang-Dong Li Alok Goswami Yimin Xiao 15:00{15:30 15:00{15:30 15:00{15:30 15:00{15:30 Speaker Tea Break Fu-Zhou Gong Jinwen
  • Superpositions and Products of Ornstein-Uhlenbeck Type Processes: Intermittency and Multifractality

    Superpositions and Products of Ornstein-Uhlenbeck Type Processes: Intermittency and Multifractality

    Superpositions and Products of Ornstein-Uhlenbeck Type Processes: Intermittency and Multifractality Nikolai N. Leonenko School of Mathematics Cardiff University The second conference on Ambit Fields and Related Topics Aarhus August 15 Abstract Superpositions of stationary processes of Ornstein-Uhlenbeck (supOU) type have been introduced by Barndorff-Nielsen. We consider the constructions producing processes with long-range dependence and infinitely divisible marginal distributions. We consider additive functionals of supOU processes that satisfy the property referred to as intermittency. We investigate the properties of multifractal products of supOU processes. We present the general conditions for the Lq convergence of cumulative processes and investigate their q-th order moments and R´enyifunctions. These functions are nonlinear, hence displaying the multifractality of the processes. We also establish the corresponding scenarios for the limiting processes, such as log-normal, log-gamma, log-tempered stable or log-normal tempered stable scenarios. Acknowledgments Joint work with Denis Denisov, University of Manchester, UK Danijel Grahovac, University of Osijek, Croatia Alla Sikorskii, Michigan State University, USA Murad Taqqu, Boston University, USA OU type process I OU Type process is the unique strong solution of the SDE: dX (t) = −λX (t)dt + dZ(λt) where λ > 0, fZ(t)gt≥0 is a (non-decreasing, for this talk) L´eviprocess, and an initial condition X0 is taken to be independent of Z(t). Note, in general Zt doesn't have to be a non-decreasing L´evyprocess. I For properties of OU type processes and their generalizations see Mandrekar & Rudiger (2007), Barndorff-Nielsen (2001), Barndorff-Nielsen & Stelzer (2011). I The a.s.
  • Nonparametric Bayesian Latent Factor Models for Network Reconstruction

    Nonparametric Bayesian Latent Factor Models for Network Reconstruction

    NONPARAMETRIC BAYESIAN LATENT FACTOR MODELS FORNETWORKRECONSTRUCTION Dem Fachbereich Elektrotechnik und Informationstechnik der TECHNISCHE UNIVERSITÄT DARMSTADT zur Erlangung des akademischen Grades eines Doktor-Ingenieurs (Dr.-Ing.) vorgelegte Dissertation von SIKUN YANG, M.PHIL. Referent: Prof. Dr. techn. Heinz Köppl Korreferent: Prof. Dr. Kristian Kersting Darmstadt 2019 The work of Sikun Yang was supported by the European Union’s Horizon 2020 research and innovation programme under grant agreement 668858 at the Technische Universsität Darmstadt, Germany. Yang, Sikun : Nonparametric Bayesian Latent Factor Models for Network Reconstruction, Darmstadt, Technische Universität Darmstadt Jahr der Veröffentlichung der Dissertation auf TUprints: 2019 URN: urn:nbn:de:tuda-tuprints-96957 Tag der mündlichen Prüfung: 11.12.2019 Veröffentlicht unter CC BY-SA 4.0 International https://creativecommons.org/licenses/by-sa/4.0/ ABSTRACT This thesis is concerned with the statistical learning of probabilistic models for graph-structured data. It addresses both the theoretical aspects of network modelling–like the learning of appropriate representations for networks–and the practical difficulties in developing the algorithms to perform inference for the proposed models. The first part of the thesis addresses the problem of discrete-time dynamic network modeling. The objective is to learn the common structure and the underlying interaction dynamics among the entities involved in the observed temporal network. Two probabilistic modeling frameworks are developed. First, a Bayesian nonparametric framework is proposed to capture the static latent community structure and the evolving node-community memberships over time. More specifi- cally, the hierarchical gamma process is utilized to capture the underlying intra-community and inter-community interactions. The appropriate number of latent communities can be automatically estimated via the inherent shrinkage mechanism of the hierarchical gamma process prior.
  • Option Pricing in Bilateral Gamma Stock Models

    Option Pricing in Bilateral Gamma Stock Models

    OPTION PRICING IN BILATERAL GAMMA STOCK MODELS UWE KUCHLER¨ AND STEFAN TAPPE Abstract. In the framework of bilateral Gamma stock models we seek for adequate option pricing measures, which have an economic interpretation and allow numerical calculations of option prices. Our investigations encompass Es- scher transforms, minimal entropy martingale measures, p-optimal martingale measures, bilateral Esscher transforms and the minimal martingale measure. We illustrate our theory by a numerical example. Key Words: Bilateral Gamma stock model, bilateral Esscher transform, minimal martingale measure, option pricing. 91G20, 60G51 1. Introduction An issue in continuous time finance is to find realistic and analytically tractable models for price evolutions of risky financial assets. In this text, we consider expo- nential L´evymodels Xt St = S0e (1.1) rt Bt = e consisting of two financial assets (S; B), one dividend paying stock S with dividend rate q ≥ 0, where X denotes a L´evyprocess and one risk free asset B, the bank account with fixed interest rate r ≥ 0. Note that the classical Black-Scholes model σ2 is a special case by choosing Xt = σWt + (µ − 2 )t, where W is a Wiener process, µ 2 R denotes the drift and σ > 0 the volatility. Although the Black-Scholes model is a standard model in financial mathematics, it is well-known that it only provides a poor fit to observed market data, because typically the empirical densities possess heavier tails and much higher located modes than fitted normal distributions. Several authors therefore suggested more sophisticated L´evyprocesses with a jump component. We mention the Variance Gamma processes [30, 31], hyperbolic processes [8], normal inverse Gaussian processes [1], generalized hyperbolic pro- cesses [9, 10, 34], CGMY processes [3] and Meixner processes [39].
  • Contents-Preface

    Contents-Preface

    Stochastic Processes From Applications to Theory CHAPMAN & HA LL/CRC Texts in Statis tical Science Series Series Editors Francesca Dominici, Harvard School of Public Health, USA Julian J. Faraway, University of Bath, U K Martin Tanner, Northwestern University, USA Jim Zidek, University of Br itish Columbia, Canada Statistical !eory: A Concise Introduction Statistics for Technology: A Course in Applied F. Abramovich and Y. Ritov Statistics, !ird Edition Practical Multivariate Analysis, Fifth Edition C. Chat!eld A. A!!, S. May, and V.A. Clark Analysis of Variance, Design, and Regression : Practical Statistics for Medical Research Linear Modeling for Unbalanced Data, D.G. Altman Second Edition R. Christensen Interpreting Data: A First Course in Statistics Bayesian Ideas and Data Analysis: An A.J.B. Anderson Introduction for Scientists and Statisticians Introduction to Probability with R R. Christensen, W. Johnson, A. Branscum, K. Baclawski and T.E. Hanson Linear Algebra and Matrix Analysis for Modelling Binary Data, Second Edition Statistics D. Collett S. Banerjee and A. Roy Modelling Survival Data in Medical Research, Mathematical Statistics: Basic Ideas and !ird Edition Selected Topics, Volume I, D. Collett Second Edition Introduction to Statistical Methods for P. J. Bickel and K. A. Doksum Clinical Trials Mathematical Statistics: Basic Ideas and T.D. Cook and D.L. DeMets Selected Topics, Volume II Applied Statistics: Principles and Examples P. J. Bickel and K. A. Doksum D.R. Cox and E.J. Snell Analysis of Categorical Data with R Multivariate Survival Analysis and Competing C. R. Bilder and T. M. Loughin Risks Statistical Methods for SPC and TQM M.