SearcharxivSearch

arXiv subjects

Oliver Mason

Publications and source records attributed to Oliver Mason.

At least 19 recordsLinked to original sources

A note on diffusive solutions of the Lyapunov and Riccati inequalities for quasi-monotone (QM) mappings on cones

We consider three key properties of Metzler and nonnegative matrices and extensions of these to classes of self-dual proper convex cones. Specifically, we study mappings that are quasi-monotone (QM) with respect to a cone $K$ and discuss results extending D-stability, diagonal Lyapunov stability, and diagonal Riccati stability to this setting. Mappings that act diffusively with respect to the cone are used as generalisations of diagonal matrices. Relationships with recent results for symmetric cones obtained using Jordan algebraic methods are also discussed.

math.OC

Observations on robust diffusive stability and common Lyapunov functions

We consider the problem of robust diffusive stability (RDS) for a pair of coupled stable discrete-time positive linear-time invariant (LTI) systems. We first show that the existence of a common diagonal Lyapunov function is sufficient for RDS and highlight how this condition differs from recent results using linear copositive Lyapunov functions. We also present an extension of these results, showing that the weaker condition of \emph{joint} linear copositive function existence is also sufficient for RDS. Finally, we present two results on RDS for extended Leslie matrices arising in population dynamics.

math.DS

A density-dependent metapopulation model: Extinction, persistence and source-sink dynamics

We consider a nonlinear coupled discrete-time model of population dynamics. This model describes the movement of populations within a heterogeneous landscape, where the growth of subpopulations are modelled by (possibly different) bounded Kolmogorov maps and coupling terms are defined by nonlinear functions taking values in $(0,1)$. These couplings describe the proportions of individuals dispersing between regions. We first give a brief survey of similar discrete-time dispersal models. We then derive sufficient conditions for the stability/instability of the extinction equilibrium, for the existence of a positive fixed point and for ensuring uniform strong persistence. Finally we numerically explore a planar version of our model in a source-sink context, to show some of the qualitative behaviour that the model we consider can capture: for example, periodic behaviour and dynamics reminiscent of chaos.

math.DS

Inferring Stochastic Group Interactions within Structured Populations via Coupled Autoregression

The internal behaviour of a population is an important feature to take account of when modelling their dynamics. In line with kin selection theory, many social species tend to cluster into distinct groups in order to enhance their overall population fitness. Temporal interactions between populations are often modelled using classical mathematical models, but these sometimes fail to delve deeper into the, often uncertain, relationships within populations. Here, we introduce a stochastic framework that aims to capture the interactions of animal groups and an auxiliary population over time. We demonstrate the model's capabilities, from a Bayesian perspective, through simulation studies and by fitting it to predator-prey count time series data. We then derive an approximation to the group correlation structure within such a population, while also taking account of the effect of the auxiliary population. We finally discuss how this approximation can lead to ecologically realistic interpretations in a predator-prey context. This approximation also serves as verification to whether the population in question satisfies our various assumptions. Our modelling approach will be useful for empiricists for monitoring groups within a conservation framework and also theoreticians wanting to quantify interactions, to study cooperation and other phenomena within social populations.

stat.ME

Pattern-Based Prediction of Population Outbreaks

Insect outbreaks are biotic disturbances in forests and agroecosystems that cause economic and ecological damage. This phenomenon depends on a variety of biological and physical factors. The complexity and practical importance of the issue have made the problem of predicting outbreaks a focus of recent research. Here, we propose the Pattern-Based Prediction (PBP) method for predicting population outbreaks. It is based on the Alert Zone Procedure, combined with elements from machine learning. It uses information on previous time series values that precede an outbreak event as predictors of future outbreaks, which can be useful when monitoring pest species. We illustrate the methodology using simulated datasets and real time series data obtained by monitoring aphids in wheat crops in Southern Brazil. We obtained an average test accuracy of $84.6\%$ in the simulation studies implemented with stochastic models, and $95.0\%$ for predicting outbreaks using the real dataset. This shows the feasibility of the PBP method in predicting outbreaks in population dynamics. We benchmarked our results against established state-of-the-art machine learning methods, namely Support Vector Machines, Deep Neural Networks, Long Short Term Memory and Random Forests. The PBP method yielded a competitive performance, associated with higher true-positive rates in most comparisons, while being able to provide interpretability rather than being a black-box method. This is an improvement over current state-of-the-art machine learning tools, especially when being used by non-specialists, such as ecologists aiming to use a quantitative approach for pest monitoring. We provide open-source code to implement the PBP method in Python, through the \texttt{pypbp} package, which may be directly downloaded from the Python Package Index server or accessed through \url{https://pypbp-documentation.readthedocs.io}

q-bio.QM

A Supervised Learning Approach to Rankability

The rankability of data is a recently proposed problem that considers the ability of a dataset, represented as a graph, to produce a meaningful ranking of the items it contains. To study this concept, a number of rankability measures have recently been proposed, based on comparisons to a complete dominance graph via combinatorial and linear algebraic methods. In this paper, we review these measures and highlight some questions to which they give rise before going on to propose new methods to assess rankability, which are amenable to efficient estimation. Finally, we compare these measures by applying them to both synthetic and real-life sports data.

math.CO

Observations on the Bias of Nonnegative Mechanisms for Differential Privacy

We study two methods for differentially private analysis of bounded data and extend these to nonnegative queries. We first recall that for the Laplace mechanism, boundary inflated truncation (BIT) applied to nonnegative queries and truncation both lead to strictly positive bias. We then consider a generalization of BIT using translated ramp functions. We explicitly characterise the optimal function in this class for worst case bias. We show that applying any square-integrable post-processing function to a Laplace mechanism leads to a strictly positive maximal absolute bias. A corresponding result is also shown for a generalisation of truncation, which we refer to as restriction. We also briefly consider an alternative approach based on multiplicative mechanisms for positive data and show that, without additional restrictions, these mechanisms can lead to infinite bias.

cs.CR

Bounding the l_2 sensitivity for positive linear observers

We consider the design of differentially private Luenberger observers for positive linear systems. In particular, we derive a bound for the $l_2$ sensitivity of Luenberger observers, which is used to quantify the noise required to achieve relaxed differential privacy via the Gaussian mechanism. An approach to minimise this bound for positive observers is described and several bounds relevant to this problem are derived.

eess.SY

Diagonal stability of a class of discrete-time positive switched systems with delay

A class of discrete-time nonlinear positive time-delay switched systems with sector-type nonlinearities is studied. Sufficient conditions for the existence of common and switched diagonal Lyapunov--Krasovskii functionals for this system class are derived; these are expressed as feasibility conditions for systems of linear algebraic inequalities. Corresponding spectral conditions for the existence of common L--K functionals are also described. Furthermore, it is shown that the proposed approaches can be applied to discrete-time models of digital filters and neural networks. Finally, a numerical example is given to illustrate the effectiveness of theoretical results.

math.OC

Barabanov norms, Lipschitz continuity and monotonicity for the max algebraic joint spectral radius

We present several results describing the interplay between the max algebraic joint spectral radius (JSR) for compact sets of matrices and suitably defined matrix norms. In particular, we extend a classical result for the conventional algebra, showing that the JSR can be described in terms of induced norms of the matrices in the set. We also show that for a set generating an irreducible semigroup (in a cone-theoretic sense), a monotone Barabanov norm always exists. This fact is then used to show that the max algebraic JSR is locally Lipschitz continuous on the space of compact irreducible sets of matrices with respect to the Hausdorff distance. We then prove that the JSR is Hoelder continuous on the space of compact sets of nonnegative matrices. Finally, we prove a strict monotonicity property for the max algebraic JSR that echoes a fact for the classical JSR.

math.OC

Diagonal Riccati Stability and the Hadamard Product

We present an extension of a recent characterisation of diagonal Riccati stability and, using this, extend a result of Kraaijevanger on diagonal Lyapunov stability to Riccati stability of time-delay systems. We also describe a class of transformations that preserve the property of being diagonally Riccati stable and apply these two results to provide novel stability results for classes of time-delay systems.

math.OC

Optimal Differentially Private Mechanisms for Randomised Response

We examine a generalised Randomised Response (RR) technique in the context of differential privacy and examine the optimality of such mechanisms. Strict and relaxed differential privacy are considered for binary outputs. By examining the error of a statistical estimator, we present closed solutions for the optimal mechanism(s) in both cases. The optimal mechanism is also given for the specific case of the original RR technique as introduced by Warner in 1965.

cs.CR

Extreme Points of the Local Differential Privacy Polytope

We study the convex polytope of n x n stochastic matrices that define locally differentially private mechanisms. We first present invariance properties of the polytope and results reducing the number of constraints needed to define it. Our main results concern the extreme points of the polytope. In particular, we completely characterise these for matrices with 1, 2 or n non-zero columns.

math.CO

Differentially Private Response Mechanisms on Categorical Data

We study mechanisms for differential privacy on finite datasets. By deriving \emph{sufficient sets} for differential privacy we obtain necessary and sufficient conditions for differential privacy, a tight lower bound on the maximal expected error of a discrete mechanism and a characterisation of the optimal mechanism which minimises the maximal expected error within the class of mechanisms considered.

cs.DM

Diagonal Riccati Stability and Applications

We consider the question of diagonal Riccati stability for a pair of real matrices A, B. A necessary and sufficient condition for diagonal Riccati stability is derived and applications of this to two distinct cases are presented. We also describe some motivations for this question arising in the theory of generalised Lotka-Volterra systems.

math.OC

Stability Criteria for SIS Epidemiological Models under Switching Policies

We study the spread of disease in an SIS model. The model considered is a time-varying, switched model, in which the parameters of the SIS model are subject to abrupt change. We show that the joint spectral radius can be used as a threshold parameter for this model in the spirit of the basic reproduction number for time-invariant models. We also present conditions for persistence and the existence of periodic orbits for the switched model and results for a stochastic switched model.

math.DS

Differential Privacy in Metric Spaces: Numerical, Categorical and Functional Data Under the One Roof

We study Differential Privacy in the abstract setting of Probability on metric spaces. Numerical, categorical and functional data can be handled in a uniform manner in this setting. We demonstrate how mechanisms based on data sanitisation and those that rely on adding noise to query responses fit within this framework. We prove that once the sanitisation is differentially private, then so is the query response for any query. We show how to construct sanitisations for high-dimensional databases using simple 1-dimensional mechanisms. We also provide lower bounds on the expected error for differentially private sanitisations in the general metric space setting. Finally, we consider the question of sufficient sets for differential privacy and show that for relaxed differential privacy, any algebra generating the Borel $σ$-algebra is a sufficient set for relaxed differential privacy.

cs.DB