Here the time is given as IST (UTC+5:30)/ TST (UTC +8)/ JST (UTC+9).
Hiroe Tsubaki, Director of ISM
Hiroe Tsubaki, ISM
The Least Informative Quasi-Likelihood under Restricted Moment Structures
The natural exponential family with a dispersion parameter is the least informative distribution of its expectation parameter given the variance function and its likelihood can be used as quasi-likelihood of the generalized linear models even if it is not the true likelihood with the same variance function. In this talk I will review the role of least informative likelihoods in the application of statistical models and expand quasi-likelihood given certain functional restrictions of the 3rd and 4th order moment structures.
Partha Sarathi Mukherjee, ISI
Image restoration using local pixel clustering and jump regression
In this talk, we will discuss various methods of image denoising and image deblurring techniques based on local pixel clustering and jump regression.
Daisuke Murakami, ISM
Transformation-based approach for large non-Gaussian spatial regression modeling
As with the advancement of geographical information systems, non-Gaussian spatial data is getting larger and more diverse. Given such a background, we develop a computationally efficient regression model for large non-Gaussian spatial data. We rely on a transformation-based approach for flexibly modeling a wide variety of non-Gaussian data without explicit assuming of data distribution. Besides, its computational efficiency is enhanced by employing a preconditioning. Monte Carlo experiments show the estimation accuracy and computational efficiency for modeling non-Gaussian data including fat-tailed and/or skewed distributions. The developed model is applied to a spatial analysis focusing on the influence of people flow on the coronavirus disease 2019 in Japan.
Takaaki Koike, ISM
Tail concordance measures: A fair assessment of tail dependence
Quantifying tail dependence is an important issue in various fields such as finance and risk management. The prevalent tail dependence coefficient (TDC), however, is known to underestimate the degree of tail dependence and it fails to capture non-exchangeable tail dependence since the TDC evaluates the limiting tail probability only along the main diagonal. To overcome these issues, two novel tail dependence measures called the maximal tail concordance measure (MTCM) and the average tail concordance measure (ATCM) are proposed. Both measures are constructed based on tail copulas and possess clear probabilistic interpretations in that the MTCM evaluates the largest limiting probability among all comparable rectangles in the tail, and the ATCM is a normalized average of these limiting probabilities. In contrast to the TDC, the MTCM and the ATCM can capture non-exchangeable tail dependence. Moreover, they often admit analytical forms, and satisfy axiomatic properties naturally required to quantify tail dependence. Estimators of the two measures are also constructed. A real data analysis reveals striking tail dependence and tail non-exchangeability of the return series of stock indices, particularly in periods of financial distress.
This is joint work with Shogo Kato (ISM) and Marius Hofert (University of Waterloo).
Parthanil Roy, ISI
How to tell a tale of two tails?
This talk is going to focus on a model named “branching random walk”. Roughly speaking, the dynamics of this model goes as follows. It starts from one particle at the origin. This particle branches into a random number of particles according to a progeny distribution. Each new particle makes an independent displacement on the real line following a displacement distribution. These particles form the first generation. Each first generation particle behave in a similar fashion independently of each other and give rise to the second generation. This process goes on. More precisely, the displacements are iid following the displacement distribution and are independent of the branching mechanism. In this talk, we will discuss how the tails of progeny and displacement distributions determine the long run configuration of the particles.
It is based on a joint work with Souvik Ray, Rajat Subhra Hazra and Philippe Soulier.
Arijit Chakrabarty, ISI
Clustering of rare events
This talk is on understanding how the rare events of deviation of sample mean from population mean cluster. Consider data coming from a stationary process whose marginal distribution has all exponential moments finite. Conditional on the event that the average of the first n observations exceeds the population mean by a prefixed threshold, we study the asymptotic distribution of the length of time for which this deviation persists, as n goes to infinity. It turns out that the answer depends on the memory of the stationary process. In the short memory regime, the asymptotic conditional distrubtion of the persistence time is a law on the set of natural numbers, whereas in the long memory regime, the persistence time goes almost surely to infinity. In the latter regime, the asymptotic conditional law under an appropriate scaling is studied.
This is a joint work with Gennady Samorodnitsky.
Frederick Kin Hing Phoa, ISSAS
A Mixture Model of Truncated Zeta Distributions with Applications to Scientific Collaboration Networks
The degree distribution has attracted considerable attention from network scientists in the last few decades to have knowledge of the topological structure of networks. It is widely acknowledged that many real networks have power-law degree distributions. However, the deviation from such a behavior often appears when the range of degrees is small. Even worse, the conventional employment of the continuous power-law distribution usually causes an inaccurate inference as the degree should be discrete-valued. To remedy these obstacles, we propose a finite mixture model of truncated zeta distributions for a broad range of degrees that disobeys a power-law behavior in the range of small degrees while maintaining the scale-free behavior. The maximum likelihood algorithm alongside the model selection method is presented to estimate model parameters and the number of mixture components. The validity of the suggested algorithm is evidenced by Monte Carlo simulations. We apply our method to five disciplines of scientific collaboration networks with remarkable interpretations. The proposed model outperforms the other alternatives in terms of the goodness-of-fit.
This is a joint work with Dr. Hohyun Jung.
Rahul Roy, ISI
Drainage networks and the Brownian web
We discuss various models of drainage networks and show that their asymptotic limit under diffusive scaling is the Brownian web.