This article uses graph theory to provide novel evidence regarding market integration, a favorable condition for systemic risk to appear in. Relying on daily futures returns covering a 12-year period, we examine cross- and intermarket linkages, both within the commodity complex and between...

A method is presented for the calculation of all exact ground states of diluted Ising antiferromagnets and random field Ising systems in an arbitrary range of magnetic fields Bϵ [Bstart, Bend] resp. Δϵ [Δstart, Δend]. It works by calculating all jump-fields B, Δ where the system changes...

The statistical tools of Complex Network Analysis are of useful to understand salient properties of complex systems, may these be natural or pertaining human engineered infrastructures. One of these that is receiving growing attention for its societal relevance is that of electricity...

In this contribution we show that natural rock fracture networks, acting as media for the delivery of a variety of geological fluids, can be studied by using the principles of complex systems. Natural networks at different length scales (from the metre to the micrometer) have been analysed by...

A drug use epidemic can be represented by a finite number of states and transition rules that govern the dynamics of drug use in each discrete time step. This paper investigates the spread of drug use in a community where some users are in treatment and others are not in treatment, citing South...

We present a fast (∼ O (N3)) algorithm which calculates groundstates of Ising spin glasses approximately. It works by randomly selecting clusters of spins which exhibit no frustrations. The spins which were not selected, contribute to the local fields of the selected spins. For the...

A stable government is by definition not dominated by any other government. However, it may happen that all governments are dominated. In graph-theoretic terms this means that the dominance graph does not possess a source. In this paper we are able to deal with this case by a clever combination...

In this paper we present an original model of sequential problem choice within scientific communities. Disciplinary knowledge is accumulated by solving problems emerging in a growing tree-like web of research areas. Knowledge production is sequential since the problems solved generate new...

<Para ID="Par1">This paper proposes a new algorithm for the minimum spanning tree verification (MSTV) problem in undirected graphs. The MSTV problem is distinct from the minimum spanning tree construction problem. The above problems have been studied extensively, and there exist several papers in the literature...</para>

We suggest in this paper that voting in political systems can be profitably analysed using complex system analysis. We discuss how we can capture the complexity of voting behaviour by applying graph theory in networks and we develop a simplified theoretical model of voting choice adopting the...