Interacting neural networks and the emergence of social structure

The article describes a computational model for the simulation of the emergence of social structure or social order, respectively. The model is theoretically based on the theory of social typifying by Berger and Luckmann. It consists of interacting artificial actors (agents), which are represented by two neural networks, an action net, and a perception net. By mutually adjusting of their actions, the agents are able to constitute a self‐organized social order in dependency of their personal characteristics and certain features of their environment. A fictitious example demonstrates the applicability of the model to problems of extra‐terrestrial robotics. © 2007 Wiley Periodicals, Inc. Complexity 12: 41–52, 2007     

Continuos social decision procedures

Classical social decision procedures are supposed to map lists of preference orderings into binary relations which describe society ‘preferences’. But when there are infinitely many alternatives the resulting plethora of possible preference orderings make it impossible to differentiate ‘nearby’ preference relations. If the preference information used to make social decisions is imperfect, society may wish to implement a continuous social decision procedure (SDP) so that nearby preference configurations will map into nearby social preference relations. It is shown here that a continuity requirement can severely restrict the admissible behavior of a social decision procedure. Furthermore, a characterization of continuous SDPs is presented which facilitates the examination of such procedures and their relation to various voting mechanisms.     

Compressing strongly connected subgroups in social networks: An entropy-based approach

To detect and study cohesive subgroups of actors is a main objective in social network analysis. What are the respective relations inside such groups and what separates them from the outside. Entropy-based analysis of network structures is an up-and-coming approach. It turns out to be a powerful instrument to detect certain forms of cohesive subgroups and to compress them to superactors without loss of information about their embeddedness in the net: Compressing strongly connected subgroups leaves the whole net’s and the (super-)actors’ information theoretical indices unchanged; i.e., such compression is information-invariant. The actual article relates on the reduction of networks with hundreds of actors. All entropy-based calculations are realized in an expert system shell.     

Can we have confidence in generic structures?

The system dynamics concept of ‘generic structure’ is dividable into three sub-types. This paper analyses the validity of these three, using both practical and theoretical perspectives. Firstly, a new set of measures is developed for generating validity—‘confidence’—amongst a group using generic structures in a practical modelling situation. It is concluded that different confidence criteria are implicitly employed; there is an argument for trading-off model precision and analytical quality for simplicity and ease of use and future research is needed to combine these ‘process’ and ‘content’ aspects of confidence. From a theoretical stance it is shown that with two of the sub-types a scientific notion of confidence is achievable whereas the third (‘archetypes’) involves merely metaphorical thinking. It is concluded that the theoretical status of archetypes requires further development, whilst ensuring that its benefits are retained.     

Théorie tannakienne non commutative

Inspired by a recent paper by Deligne [2], we extend the Tannaka-Krein duility results (over a field) to the non-commutative situation. To be precise, we establish a 1-1 corresponde:ice between ‘tensorial autonomous categories’ equipped with a ‘fibre functor’ (i. e. tannakian categories without the commutativity condition on the tensor product), and ‘quantum groupoids’ (as defined by Maltsiniotis, [9]) which are ‘transitive’ (7.1.). When the base field is perfect, a quantum groupoid over Spec B is transitive iff it is projective and faithfully fiat over B? _k B. Moreover, the fibre functor is unique up to ‘quantum isomorphism’ (7.6.). Actually, we show Tannaka-Krein duality results in the more general setting where there is no monoidal structure on the category (and the functor); the algebraic object corresponding to such a category is a ‘semi-transitive’ coalgebroid (5.2. and 5.8.).     

Writing practitioner case studies to help behavioural OR researchers ground their theories: application of the mangle perspective

Behavioural research into the practice of OR needs to be grounded. Case studies written by practitioners can potentially help address this need but currently most do not. The paper explores a way of describing OR projects that place the emphasis on the ‘actors’ who provide the motivating force and the consequences of their actions. The ‘mangle’ perspective focuses on the dynamic intertwining of people, technology and concepts; this can provide the basis for an insightful narrative describing the reality of the project in terms of the planned approach, the problems met and the outcomes. Two examples are given, one of a conventional model building exercise, the second of a ‘soft OR’ intervention: both describe projects conducted by practitioners for commercial purposes. It is concluded that, by using the mangle perspective, the OR case writer can winnow the wheat from the chaff in order to write a succinct informative narrative, a narrative that could be utilized by behavioural OR (BOR) researchers. It is further concluded that BOR researchers should engage with ‘practice theory’ to deepen their understanding of what actually happens in projects.     

Binariness and rational choice

The concept of numerical representability of preferences together with maximality is at the heart of the concept of rationality embodied in classical optimization models. The difficulty of representing social preferences arises from inherent intransitivities thrown up by democratic voting procedures and by non-binary choice rules which need to be adopted to cope with these intransitivities. An alternative (weaker) concept of representability is developed and it is shown that this concept can partially accommodate intransitivity and non-binariness. ‘Weak transitivity’ and ‘weak binaries’ conditions are provided and it is shown that these conditions are necessary and sufficient for ‘weak representability’. While the weak transitivity condition would be violated by social aggregation procedures, the non-binary functions used by social choice theorists do indeed satisfy the condition of ‘weak binariness’.     

Process and content: two ways of using SSM

Soft systems methodology (SSM) includes several ways of gaining a rich appreciation of the problem situation addressed. ‘Analysis One’, exploration of the intervention itself, is the subject here, since it is sparsely covered in the literature. The analysis is conducted in terms of three roles: ‘client’, ‘problem solver’ and ‘problem owner’. Whoever is in the role of ‘problem solver’ is free to define a list of possible ‘problem owners’, which brings many perspectives to bear on the situation. It was realized that ‘client’ and ‘problem solver’ should themselves feature in the ‘problem owner’ list. The ‘problem’ owned by the ‘problem solver’ is that of undertaking the intervention. This led to a realization that SSM is relevant to both the content of a perceived situation (SSMc) and the process of dealing with that content (SSMp). This development is described and illustrated by work in the National Health Service. The focus of the SSM use was to define the intellectual process for a service specification project which NHS professionals would themselves carry out.     

Coordination in Dynamic Social Networks Under Heterogeneity

People often make choices or form opinions depending on the social relations they have, but they also choose their relations depending on their preferred behavior and their opinions. Most of the existing models of coevolution of networks and individual behavior assume that actors are homogeneous. In this article, we relax this assumption in a context in which actors try to coordinate their behavior with their partners. We investigate with a game-theoretic model whether social cohesion and coordination change when interests of actors are not perfectly aligned as compared to the homogeneous case. Using analytical and simulation methods we characterize the set of stable networks and examine the consequences of heterogeneity for social optimality and segregation in emerging networks.     

Fuzzy sets-the approximation of semisets

This paper deals with alternative set theory which substantially departs from classical set theory. The main notion of it -a semiset-is proposed to model the same intuitive notion as fuzzy set but it is more general. The reasonable tool for ‘grasping’ semisets could be provided by fuzzy sets whose applicability is beyond discussion. In the paper reasons for such an approximation are given and two ways how to provide it are proposed. The fact that the membership function is modeled within the theory should be stressed. At the end, some problems and an indication for further investigation are discussed.     

The Role of Metanetworks in Network Evolution

The question of what structures of relations between actors emerge in the evolution of social networks is of fundamental sociological interest. The present research proposes that processes of network evolution can be usefully conceptualized in terms of a network of networks, or “metanetwork,” wherein networks that are one link manipulation away from one another are connected. Moreover, the geography of metanetworks has real effects on the course of network evolution. Specifically, both equilibrium and non-equilibrium networks located in more desirable regions of the metanetwork are found to be more probable. These effects of metanetwork geography are illustrated by two dynamic network models: one in which actors pursue access to unique information through “structural holes,” and the other in which actors pursue access to valid information by minimizing path length. Finally, I discuss future directions for modeling network dynamics in terms of metanetworks.     

Mexican high school students' social representations of mathematics,its teaching and learning

This paper reports a qualitative research that identifies Mexican high school students’ social representations of mathematics. For this purpose, the social representations of ‘mathematics’, ‘learning mathematics’ and ‘teaching mathematics’ were identified in a group of 50 students. Focus group interviews were carried out in order to obtain the data. The constant comparative style was the strategy used for the data analysis because it allowed the categories to emerge from the data. The students’ social representations are: (A) Mathematics is…(1) important for daily life, (2) important for careers and for life, (3) important because it is in everything that surrounds us, (4) a way to solve problems of daily life, (5) calculations and operations with numbers, (6) complex and difficult, (7) exact and (6) a subject that develops thinking skills; (B) To learn mathematics is…(1) to possess knowledge to solve problems, (2) to be able to solve everyday problems, (3) to be able to make calculations and operations, and (4) to think logically to be able to solve problems; and (C) To teach mathematics is…(1) to transmit knowledge, (2) to know to share it, (3) to transmit the reasoning ability, and (4) to show how to solve problems.     

Network formation and knowledge gains

Incentive-based models for network formation link micro actions to changes in network structure. Sociologists have extended these models on a number of fronts, but there remains a tendency to treat actors as homogenous agents and to disregard social theory. Drawing upon literature on the strategic use of networks for knowledge gains, we specify models exploring the co-evolution of networks and knowledge gains. Our findings suggest that pursuing transitive ties is the most successful strategy, as more reciprocity and cycling result from this pursuit, thus encouraging learning across the network. We also discuss the role of network size, global network structure, and parameter strength in actors’ attainment of knowledge resources.     

Higher index theory for certain expanders and Gromov monster groups,II

In this paper, the second of a series of two, we continue the study of higher index theory for expanders. We prove that if a sequence of graphs has girth tending to infinity, then the maximal coarse Baum–Connes assembly map is an isomorphism for the associated metric space X. As discussed in the first paper in this series, this has applications to the Baum–Connes conjecture for ‘Gromov monster’ groups.We also introduce a new property, ‘geometric property (T)’. For the metric space associated to a sequence of graphs, this property is an obstruction to the maximal coarse assembly map being an isomorphism. This enables us to distinguish between expanders with girth tending to infinity, and, for example, those constructed from property (T) groups.     

The Emergence of Social Order by Processes of Typifying: A Computational Model

The article argues that Rational Choice approaches are not sufficient to explain the “how” of the emergence of social order. Therefore, the concept of “typifying” according to the theory of Berger and Luckmann is understood as the most important form of establishing social orders between different social actors. A computational model is described that captures the basic features of the typifying process. Each artifical actor consists of two different neural nets, an “action net” and a “perception net”. These nets allow an actor to establish social rules of interaction with other actors, to remember the other actors after a time and to typify new actors as persons that belong to the same type as actors the first actor is already “acquainted” with. Experimental results and theoretical consequences are also given.     

Multivalued social choice functions and strategic manipulation with counterthreats

In this paper, we examine the manipulability properties of social decision rules which select a non-empty subset of the set of alternatives. Assuming that if an individual prefers x to y, then he prefers the outcome set {x, y} to {y}, and also {x} to {x, y}, we show that a wide class of scf's which allow ties even in pairwise choice violates one of the weakest notions of strategyproofness — a single individual can profitably misrepresent his preferences, even when he takes into account the possibility of countercoalitions. This class of scf's also violates exact consistency — no equilibrium situation gives the same outcome set as the ‘true profile’.     

P-varieties - a signature independent characterization of varieties of ordered algebras

This paper is concerned mainly with classes (categories) of ordered algebras which in some signature are axiomatizable by a set of inequations between terms (‘varieties’ of ordered algebras) and also classes which are axiomatizable by implications between inequations (‘quasi varieties’ of ordered algebras). For example, if the signature contains a binary operation symbol (for the monoid operation) and a constant symbol (for the identity) the class of ordered monoids M can be axiomatized by a set of inequations (i.e. expressions of the form t≤t'. However, if the signature contains only the binary operation symbol, the same class M cannot be so axiomatized (since it is not now closed under subalgebras). Thus, there is a need to find structural, signature independent conditions on a class of ordered algebras which are necessary and sufficient to guarantee the existence of a signature in which the class is axiomatizable by a set of inequations (between terms in this signature). In this paper such conditions are found by utilizing the notion of ‘P-categories’. A P-category C is a category such that each ‘Hom-set’ C(a,b) is equipped with a distiguished partial order which is preserved by composition. Aside from proving the characterization theorem, it is also the purpose of the paper to begin the investigation of P-categories.     

The multiple-job repair kit problem

The repair kit problem is that of finding the optimal set of parts in the kit of a repairman. An important aspect of this problem, in many real-life situations, is that several job-sites are visited before a kit is restocked. In this paper, we present two heuristics for solving the multiple-job repair kit problem. Both heuristics can be used to determine a solution under the service-objective (minimal holding cost for a required job-fill rate) as well as the cost-objective (minimal expected total cost, including a penalty cost for each ‘broken’ job). They generate a series of kits ‘from empty to complete’ by adding one part at a time, and then select the kit with the smallest (approximate) total cost. The ‘Job Heuristic (JH)’ adds parts based on the ratio of holding cost to increase in job-fill rate, whereas the ‘Part Heuristic (PH)’ focuses on the ratio of holding cost to increase in the part-fill rate. Since part-fill rates are much easier to calculate, the PH is easier to apply. In fact, we show how it can be applied in a spreadsheet software package. The JH, however, is more exact. Indeed, it determines the optimal solution for all the examples (for which we are able to determine the optimal solution by complete search) considered in our numerical experiments. The PH also performs well. It generally has a cost error of less than 2% and determines the optimal solution in most cases, even if part failures are highly dependent. Based on these results, we recommend the use of the PH in practice.     

The Dynamics of Closeness and Betweenness

Although both betweenness and closeness centrality are claimed to be important for the effectiveness of someone's network position, it has not been comprehensively studied which networks emerge if actors strive to optimize their centrality in the network in terms of betweenness and closeness. We study each of these centrality measures separately, but we also analyze what happens if actors value betweenness and closeness simultaneously. Network dynamics differ considerably in a scenario with either betweenness or closeness incentives compared with a scenario in which closeness and betweenness incentives are combined. There are not only more stable networks if actors’ betweenness and closeness are combined, but also these stable networks are less stylized.