This paper considers a Multiple Objective variant of the Critical Disruption Path problem to extend its suitability in a range of security operations relying on path-based network interdiction, including flight pattern optimisation for surveillance.

Given a random sample drawn from a Multivariate Bernoulli Variable (MBV), we consider the problem of estimating the structure of the undirected graph for which the distribution is pairwise Markov and the parameters' vector of its exponential form. We propose a simple method that provides a closed form estimator of the parameters' vector and through its support also provides an estimate of the undirected graph associated with the MBV distribution. The estimator is proved to be asymptotically consistent but it is feasible only in low-dimensional regimes.

We prove the nonlinear asymptotic stability of stably stratified solutions to the Incompressible Porous Media equation (IPM) for initial perturbations in ?H1- (R2) ? ?H s(R2) with s > 3 and for any 0 < < 1. Such result improves the existing literature, where the asymptotic stability is proved for initial perturbations belonging at least to H20(R2). More precisely, the aim of the article is threefold. First, we provide a simplified and improved proof of global-in-time well-posedness of the Boussinesq equations with strongly damped vorticity in H1- (R2)?

This paper concerns the study of a non-smooth logistic regression function. The focus is on a high-dimensional binary response case by penalizing the decomposition of the unknown logit regression function on a wavelet basis of functions evaluated on the sampling design. Sample sizes are arbitrary (not necessarily dyadic) and we consider general designs. We study separable wavelet estimators, exploiting sparsity of wavelet decompositions for signals belonging to homogeneous Besov spaces, and using efficient iterative proximal gradient descent algorithms.

Networks are pervasive in computer science and in real world applications. It is often useful to leverage distinctive node features to regroup such data in clusters, by making use of a single representative node per cluster. Such contracted graphs can help identify features of the original networks that were not visible before. As an example, we can identify contiguous nodes having the same discrete property in a social network. Contracting a graph allows a more scalable analysis of the interactions and structure of the network nodes.

We present a mathematical model describing the evolution of sea ice and meltwater during summer. The system is described by two coupled partial differential equations for the ice thickness h(x,t) and pond depth w(x,t) fields. The model is similar, in principle, to the one put forward by Luthije et al. (2006), but it features i) a modified melting term, ii) a non-uniform seepage rate of meltwater through the porous ice medium and a minimal coupling with the atmosphere via a surface wind shear term, ?s (Scagliarini et al. 2020).

In this paper, we aim at developing new methods to join machine learning techniques and macroscopic differential models for vehicular traffic estimation and forecast. It is well known that data-driven and model- driven approaches have (sometimes complementary) advantages and drawbacks. We consider here a dataset with flux and velocity data of vehicles moving on a highway, collected by fixed sensors and classified by lane and by class of vehicle.