SearcharxivSearch

arXiv subjects

M. Dashti

Publications and source records attributed to M. Dashti.

2 recordsLinked to original sources

Network Inference from Population-Level Observation of Epidemics

Using the continuous-time susceptible-infected-susceptible (SIS) model on networks, we investigate the problem of inferring the class of the underlying network when epidemic data is only available at population-level (i.e. the number of infected individuals at a finite set of discrete times of a single realisation of the epidemic), the only information likely to be available in real world settings. To tackle this, epidemics on networks are approximated by a Birth-and-Death process which keeps track of the number of infected nodes at population level. The rates of this surrogate model encode both the structure of the underlying network and disease dynamics. We use extensive simulations over Regular, Erdős-Rényi and Barabási-Albert networks to build network class-specific priors for these rates. % show that different well-known network classes map onto distinct regions of the parameter space of this model. We then use Bayesian model selection to recover the most likely underlying network class, based only on a single realisation of the epidemic. We show that the proposed methodology yields good results on both synthetic and real-world networks.

q-bio.PE

Approximation of Bayesian Inverse Problems for PDEs

Inverse problems are often ill-posed, with solutions that depend sensitively on data. In any numerical approach to the solution of such problems, regularization of some form is needed to counteract the resulting instability. This paper is based on an approach to regularization, employing a Bayesian formulation of the problem, which leads to a notion of well-posedness for inverse problems, at the level of probability measures. The stability which results from this well-posedness may be used as the basis for quantifying the approximation, in finite dimensional spaces, of inverse problems for functions. This paper contains a theory which utilizes the stability to estimate the distance between the true and approximate posterior distributions, in the Hellinger metric, in terms of error estimates for approximation of the underlying forward problem. This is potentially useful as it allows for the transfer of estimates from the numerical analysis of forward problems into estimates for the solution of the related inverse problem. In particular controlling differences in the Hellinger metric leads to control on the differences between expected values of polynomially bounded functions and operators, including the mean and covariance operator. The ideas are illustrated with the classical inverse problem for the heat equation, and then applied to some more complicated non-Gaussian inverse problems arising in data assimilation, involving determination of the initial condition for the Stokes or Navier-Stokes equation from Lagrangian and Eulerian observations respectively.

math.NA