Searcharxiv⌕ Search

arXiv subjects

Mitsunori Ogawa

Publications and source records attributed to Mitsunori Ogawa.

7 recordsLinked to original sources

Prognosis-equivalent mapping of clinical measurements via survival analysis

A continuous clinical measurement recorded in fixed physical units may have different prognostic meaning across patients when its effect depends on a patient-level modifier. For example, the same tumor diameter may imply markedly different prognosis in an infant and an adult, because patient size can modify its prognostic effect. We formalize this problem through prognosis-equivalent mapping for time-to-event outcomes. The resulting estimand maps a measurement value observed at one modifier level to the value under a reference modifier level that yields the same conditional prognostic quantity. The basic operation is to equate a monotone conditional prognostic score and invert the reference-side curve. In observational data, however, treatment may be selected according to the modifier and the measurement, so a direct equate-and-invert procedure may reflect differences in treatment assignment as well as the prognostic meaning of the measurement itself. We therefore define, in addition to a direct approach, a policy-standardized mapping that standardizes treatment under a common policy using the g-formula. We also introduce an origin-referenced mapping that compares changes in prognostic score from a common anchor, thereby separating modifier-specific prognostic levels from modifier dependence in the measurement--prognosis relationship. Using Cox models, we develop linear and flexible inversion estimators with analytic and bootstrap confidence bands. Simulations evaluate finite-sample performance and illustrate how treatment standardization and origin referencing clarify what is being mapped.

stat.ME↗

Non-asymptotic goodness-of-fit tests and model selection in valued stochastic blockmodels

A valued stochastic blockmodel (SBM) is a general way to view networked data in which nodes are grouped into blocks and links between them are measured by counts or labels. This family allows for varying dyad sampling schemes, thereby including the classical, Poisson, and labeled SBMs, as well as those in which some edge observations are censored. This paper addresses the question of testing goodness-of-fit of such non-Bernoulli SBMs, focusing in particular on finite-sample tests. We derive explicit Markov bases moves necessary to generate samples from reference distributions and define goodness-of-fit statistics for determining model fit, comparable to those in the literature for related model families. For the labeled SBM, which includes in particular the censored-edge model, we study the asymptotic behavior of said statistics. One of the main purposes of testing goodness-of-fit of an SBM is to determine whether block membership of the nodes influences network formation. Power and Type 1 error rates are verified on simulated data. Additionally, we discuss the use of asymptotic results in selecting the number of blocks under the latent-block modeling assumption. The method derived for Poisson SBM is applied to ecological networks of host-parasite interactions. Our data analysis conclusions differ in selecting the number of blocks for the species from previous results in the literature.

stat.ME↗

Existence of Firth's modified estimates in binomial regression models

In logistic regression modeling, Firth's modified estimator is widely used to address the issue of data separation, which results in the nonexistence of the maximum likelihood estimate. Firth's modified estimator can be formulated as a penalized maximum likelihood estimator in which Jeffreys' prior is adopted as the penalty term. Despite its widespread use in practice, the formal verification of the corresponding estimate's existence has not been established. In this study, we establish the existence theorem of Firth's modified estimate in binomial logistic regression models, assuming only the full column rankness of the design matrix. We also discuss other binomial regression models obtained through alternating link functions and prove the existence of similar penalized maximum likelihood estimates for such models.

math.ST↗

Markov degree of configurations defined by fibers of a configuration

We consider a series of configurations defined by fibers of a given base configuration. We prove that Markov degree of the configurations is bounded from above by the Markov complexity of the base configuration. As important examples of base configurations we consider incidence matrices of graphs and study the maximum Markov degree of configurations defined by fibers of the incidence matrices. In particular we give a proof that the Markov degree for two-way transportation polytopes is three.

math.CO↗

Markov degree of the Birkhoff model

We prove the conjecture by Diaconis and Eriksson (2006) that the Markov degree of the Birkhoff model is three. In fact, we prove the conjecture in a generalization of the Birkhoff model, where each voter is asked to rank a fixed number, say r, of candidates among all candidates. We also give an exhaustive characterization of Markov bases for small r.

math.ST↗

Markov Bases for Typical Block Effect Models of Two-way Contingency Tables

Markov basis for statistical model of contingency tables gives a useful tool for performing the conditional test of the model via Markov chain Monte Carlo method. In this paper we derive explicit forms of Markov bases for change point models and block diagonal effect models, which are typical block-wise effect models of two-way contingency tables, and perform conditional tests with some real data sets.

math.ST↗