Search

The puzzle of origins and future of government and social complexity in human and social dynamics, arguably a characteristic feature of the emergence and long-term evolution of hierarchy and power in the history of civilizations, is an enduring topic that has challenged political scientists, anthropological archaeologists, and other social scientists and historians. This paper proposes a new computational theory for the emergence of social complexity that accounts for the earliest formation of systems of government (pristine polities) in prehistory and early antiquity, as well as present and future political development. This general social theory is based on a “fast process” of crisis and opportunistic decision-making through collective action, which feeds a “slow” process of political development or decay. The “fast” core iterative process is “canonical” in the sense that it undergoes variations on a recurring theme of signal detection, information-processing, problem-solving, successful adaptation and occasional failure. When a group is successful in managing or overcoming serious situational changes (stresses or opportunities, endogenous or exogenous, social or physical) a probabilistic phase transition may occur, under a specified set of conditions, yielding a long-term (slow) probabilistic accrual process of emergent sociopolitical complexity and development. A reverse process may account for decay. The canonical theory is being formally implemented through the “PoliGen” agent-based model (ABM), based on the new Multi-Agent Simulator of Networks and Neighborhoods (MASON). Empirically, the theory is testable with the datasets on polities developed by the Long-Range Analysis of War (LORANOW) Project. This paper focuses on the concepts, mechanisms, and basic formal structure that constitute the canonical theory and inform the subsequent simulation model. [ABSTRACT FROM AUTHOR]

In the paper four semirings for solving social networks problems are constructed. The closures of the matrix of a given signed graph over balance and cluster semirings can be used to decide whether the graph is balanced or clusterable. The closure of relational matrix over geodetic semirings contains for every pair of vertices u and v the length and the number of u - v geodesics; and for geosetic semiring the length and the set of vertices on u - v geodesics. The algorithms for computing the geodetic and the geosetic closure matrix are also given. [ABSTRACT FROM AUTHOR]

The theory of regular equivalence has advanced over the last 15 years on a number of different fronts. Notation and terminology have developed often making it difficult to obtain a coherent view of the area as a whole. This paper attempts to provide a framework in which to develop and explore the general mathematical theory of regular equivalence and to place a number of the more important results into that framework. [ABSTRACT FROM AUTHOR]

This paper examines Dawes (1975) model on commons dilemma (CD) situation and proposes an alternative model which formulates CD. Firstly, it makes clear that Dawes model does not have the characteristics of CD. Secondly, it specifies resource unit condition which models of commons dilemma must satisfy. Thirdly, it presents CD model, which is obtained by setting the condition in Dawes model. And lastly, it examines some nature of the proposed model and find that in CD situation, fine is distributed proportionally to each players property. [ABSTRACT FROM AUTHOR]