Similar Search Results

The Power Grid as a complex network: A survey

Pagani, Giuliano Andrea; Aiello, Marco - In: Physica A: Statistical Mechanics and its Applications 392 (2013) 11, pp. 2688-2700

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...

Persistent link: https://www.econbiz.de/10011058818

The “small-world” topology of rock fracture networks

Valentini, Luca; Perugini, Diego; Poli, Giampiero - In: Physica A: Statistical Mechanics and its Applications 377 (2007) 1, pp. 323-328

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...

Persistent link: https://www.econbiz.de/10011058969

A graph theoretical perspective of a drug abuse epidemic model

Nyabadza, F.; Mukwembi, S.; Rodrigues, B.G. - In: Physica A: Statistical Mechanics and its Applications 390 (2011) 10, pp. 1723-1732

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...

Persistent link: https://www.econbiz.de/10011061328

Cluster-exact approximation of spin glass groundstates

Hartmann, Alexander K. - In: Physica A: Statistical Mechanics and its Applications 224 (1996) 3, pp. 480-488

We present a fast (∼ O (N3)) algorithm which calculates groundstates of Ising spin glasses approximately. It works by … complexity of this scheme is approximately cubic. To demonstrate how deep in energy this algorithm can get, we applied it to the ….002 (3d). Finally the distribution of overlaps for selected systems is calculated in order to characterize the algorithm. …

Persistent link: https://www.econbiz.de/10011064437

Applications of Relations and Graphs to Coalition Formation

Rusinowska, Agnieszka; Berghammer, Rudolf; Swart, Harrie de - Fondazione ENI Enrico Mattei (FEEM) - 2006

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...

Persistent link: https://www.econbiz.de/10005230883

The ‘problem of problem choice’: A model of sequential knowledge production within scientific communities cientific communities.

Carayol, Nicolas; Dalle, Jean-Michel - Bureau d'Économie Théorique et Appliquée (BETA), … - 2003

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...

Persistent link: https://www.econbiz.de/10005570165

A new algorithm for the minimum spanning tree verification problem

Williamson, Matthew; Subramani, K. - In: Computational Optimization and Applications 61 (2015) 1, pp. 189-204

<Para ID="Par1">This paper proposes a new algorithm for the minimum spanning tree verification (MSTV) problem in … studied extensively, and there exist several papers in the literature devoted to them. Our algorithm for the MSTV problem … combines the insights of Borůvka’s algorithm for constructing a minimum spanning tree with a bucketing scheme. The principal …

Persistent link: https://www.econbiz.de/10011241262

Understanding Voting Behaviour in Complex Political Systems

Athanasios, Lapatinas - In: Mathematical Economics Letters 2 (2014) 3-4, pp. 7-7

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...

Persistent link: https://www.econbiz.de/10011084818

Spectral Characterizations of Some Distance-Regular Graphs

van Dam, Edwin Robert; Haemers, W.H. - Tilburg University, School of Economics and Management - 2000

When can one see from the spectrum of a graph whether it is distance-regular or not?We give some new results for when this is the case.As a consequence we find (among others) that the following distance-regular graphs are uniquely determined by their spectrum: The collinearity graphs of the...

Persistent link: https://www.econbiz.de/10011086749

The Hermitian Two-Graph and its Code

Haemers, W.H.; Kuijken, E. - Tilburg University, Center for Economic Research - 2001

AMS classifications: 05E30; 51E20; 94B05;

Persistent link: https://www.econbiz.de/10011091340