Spectra of modular and small-world matrices

We compute spectra of symmetric random matrices describing graphs with general modular structure and arbitrary inter- and intra-module degree distributions, subject only to the constraint of finite mean connectivities. We also evaluate spectra of a certain class of small-world matrices generated from random graphs by introducing shortcuts via additional random connectivity components. Both adjacency matrices and the associated graph Laplacians are investigated. For the Laplacians, we find Lifshitz-type singular behaviour of the spectral density in a localized region of small |?| values. In the case of modular networks, we can identify contributions of local densities of state from individual modules. For small-world networks, we find that the introduction of short cuts can lead to the creation of satellite bands outside the central band of extended states, exhibiting only localized states in the band gaps. Results for the ensemble in the thermodynamic limit are in excellent agreement with those obtained via a cavity approach for large finite single instances, and with direct diagonalization results.

On the k-anonymization of time-varying and multi-layer social graphs

The popularity of online social media platforms provides an unprecedented opportunity to study real-world complex networks of interactions. However, releasing this data to researchers and the public comes at the cost of potentially exposing private and sensitive user information. It has been shown that a naive anonymization of a network by removing the identity of the nodes is not sufficient to preserve users’ privacy. In order to deal with malicious attacks, k -anonymity solutions have been proposed to partially obfuscate topological information that can be used to infer nodes’ identity. In this paper, we study the problem of ensuring k anonymity in time-varying graphs, i.e., graphs with a structure that changes over time, and multi-layer graphs, i.e., graphs with multiple types of links. More specifically, we examine the case in which the attacker has access to the degree of the nodes. The goal is to generate a new graph where, given the degree of a node in each (temporal) layer of the graph, such a node remains indistinguishable from other k-1 nodes in the graph. In order to achieve this, we find the optimal partitioning of the graph nodes such that the cost of anonymizing the degree information within each group is minimum. We show that this reduces to a special case of a Generalized Assignment Problem, and we propose a simple yet effective algorithm to solve it. Finally, we introduce an iterated linear programming approach to enforce the realizability of the anonymized degree sequences. The efficacy of the method is assessed through an extensive set of experiments on synthetic and real-world graphs.

Going it alone? North Korea’s adaptability as a small power in a changing world

This article uses small states scholarship to map North Korea’s evolution from a post-colonial small state to a system-influencing state due to its nuclear weapons programme. The framework allows for contributions to: (1) The DPRK literature which in some parts has suggested the future collapse of the state, (2) The small states literature that suggests they can only survive if they integrate larger political and/or economic units, (3) The mainstream IR literature and its dominant realist streak that considers great powers and their will as the main drivers in contemporary world politics.

What difference a writing centre makes:a small scale study

Purpose – Academic writing is often considered to be a weakness in contemporary students, while good reporting and writing skills are highly valued by graduate employers. A number of universities have introduced writing centres aimed at addressing this problem; however, the evaluation of such centres is usually qualitative. The paper seeks to consider the efficacy of a writing centre by looking at the impact of attendance on two “real world” quantitative outcomes – achievement and progression. Design/methodology/approach – Data mining was used to obtain records of 806 first-year students, of whom 45 had attended the writing centre and 761 had not. Findings – A highly significant association between writing centre attendance and achievement was found. Progression to year two was also significantly associated with writing centre attendance. Originality/value – Further, quantitative evaluation of writing centres is advocated using random allocation to a comparison condition to control for potential confounds such as motivation.

SMEs in a globalised world:survival and growth strategies on Europe's geographical periphery

This insightful book shows how small and medium enterprises (SMEs) from some of the traditionally less dynamic peripheral economies of the 'old' EU - namely Ireland, Italy, Portugal and Spain - have responded to the twin challenges of globalisation and industrial restructuring. Through a series of unique case studies the contributing authors discuss how these economies, and in particular the SME sector, can be transformed. The book begins by examining the key drivers of the globally competitive SME sector in the EU, before moving on to explore the relationship between multinational enterprises (MNEs), SMEs and industrial development. The authors investigate important policy implications and provide lessons for SME development and growth. With empirical and theoretical contributions on SMEs in both the manufacturing and the services sectors, this essential book will be invaluable for researchers and policymakers in small business economics and management. Postgraduate students of entrepreneurship, business economics, industrial economics and European studies will appreciate this unique set of insights.

Information theoretic prototype selection for unattributed graphs

In this paper we propose a prototype size selection method for a set of sample graphs. Our first contribution is to show how approximate set coding can be extended from the vector to graph domain. With this framework to hand we show how prototype selection can be posed as optimizing the mutual information between two partitioned sets of sample graphs. We show how the resulting method can be used for prototype graph size selection. In our experiments, we apply our method to a real-world dataset and investigate its performance on prototype size selection tasks. © 2012 Springer-Verlag Berlin Heidelberg.

Non-Western small states:activists or survivors?

In this introduction to the collection, we explain its focus on non-Western small states. While the terms ‘non-Western’ and ‘small states’ are problematic – we discuss these problems here – the smallness and non-Westerness of the states studied by the contributing authors set them apart in a way that has attracted little academic attention so far. They allow them to operate with fewer normative and practical constraints than their bigger, Western counterparts; offer them a wide range of (often historically forged) political ties; and force them to draw on a diversity of approaches and strategic thinking, and a creativity, that they are too rarely credited for. Non-Western small states, rather than being mere survivors constrained to the world’s periphery, are better understood as activist states intent on existing. The collection offers a range of analytical keys to make sense of these states and their role in the international scene.