Diversity of graphs with highly variable connectivity

A popular approach for describing the structure of many complex networks focuses on graph theoretic properties that characterize their large-scale connectivity. While it is generally recognized that such descriptions based on aggregate statistics do not uniquely characterize a particular graph and also that many such statistical features are interdependent, the relationship between competing descriptions is not entirely understood. This paper lends perspective on this problem by showing how the degree sequence and other constraints (e.g., connectedness, no self-loops or parallel edges) on a particular graph play a primary role in dictating many features, including its correlation structure. Building on recent work, we show how a simple structural metric characterizes key differences between graphs having the same degree sequence. More broadly, we show how the (often implicit) choice of a background set against which to measure graph features has serious implications for the interpretation and comparability of graph theoretic descriptions

Darwinian Data Structure Selection

Data structure selection and tuning is laborious but can vastly improve an application's performance and memory footprint. Some data structures share a common interface and enjoy multiple implementations. We call them Darwinian Data Structures (DDS), since we can subject their implementations to survival of the fittest. We introduce ARTEMIS a multi-objective, cloud-based search-based optimisation framework that automatically finds optimal, tuned DDS modulo a test suite, then changes an application to use that DDS. ARTEMIS achieves substantial performance improvements for \emph{every} project in $5$ Java projects from DaCapo benchmark, $8$ popular projects and $30$ uniformly sampled projects from GitHub. For execution time, CPU usage, and memory consumption, ARTEMIS finds at least one solution that improves \emph{all} measures for $86\%$ ($37/43$) of the projects. The median improvement across the best solutions is $4.8\%$, $10.1\%$, $5.1\%$ for runtime, memory and CPU usage. These aggregate results understate ARTEMIS's potential impact. Some of the benchmarks it improves are libraries or utility functions. Two examples are gson, a ubiquitous Java serialization framework, and xalan, Apache's XML transformation tool. ARTEMIS improves gson by $16.5$\%, $1\%$ and $2.2\%$ for memory, runtime, and CPU; ARTEMIS improves xalan's memory consumption by $23.5$\%. \emph{Every} client of these projects will benefit from these performance improvements.Comment: 11 page

Magnetic field dependence of electronic properties of MoS2_2 quantum dots with different edges

Using the tight-binding approach, we investigate the energy spectrum of square, triangular and hexagonal MoS$_2$ quantum dots (QDs) in the presence of a perpendicular magnetic field. Novel edge states emerge in MoS$_2$ QDs, which are distributed over the whole edge which we call ring states. The ring states are robust in the presence of spin-orbit coupling (SOC). The corresponding energy levels of the ring states oscillate as function of the perpendicular magnetic field which are related to Aharonov-Bohm oscillations. Oscillations in the magnetic field dependence of the energy levels and the peaks in the magneto-optical spectrum emerge (disappear) as the ring states are formed (collapsed). The period and the amplitude of the oscillation decreases with the size of the MoS$_2$ QDs.Comment: 11 pages, 9 figures, Accepted by Phys. Rev.

Minimal inference from incomplete 2x2-tables

Estimates based on 2x2 tables of frequencies are widely used in statistical applications. However, in many cases these tables are incomplete in the sense that the data required to compute the frequencies for a subset of the cells defining the table are unavailable. Minimal inference addresses those situations where this incompleteness leads to target parameters for these tables that are interval, rather than point, identifiable. In particular, we develop the concept of corroboration as a measure of the statistical evidence in the observed data that is not based on likelihoods. The corroboration function identifies the parameter values that are the hardest to refute, i.e., those values which, under repeated sampling, remain interval identified. This enables us to develop a general approach to inference from incomplete 2x2 tables when the additional assumptions required to support a likelihood-based approach cannot be sustained based on the data available. This minimal inference approach then provides a foundation for further analysis that aims at making sharper inference supported by plausible external beliefs