Page 1 Next

Displaying 1 – 20 of 21

Showing per page

A graph-theoretic characterization of the core in a homogeneous generalized assignment game

Tadeusz Sozański (2006)

Banach Center Publications

An exchange network is a socioeconomic system in which any two actors are allowed to negotiate and conclude a transaction if and only if their positions-mathematically represented by the points of a connected graph-are joined by a line of this graph. A transaction consists in a bilaterally agreed-on division of a profit pool assigned to a given line. Under the one-exchange rule, every actor is permitted to make no more than one transaction in each negotiation round. Bienenstock and Bonacich ([1])...

A study of the dynamic of influence through differential equations∗

Emmanuel Maruani, Michel Grabisch, Agnieszka Rusinowska (2012)

RAIRO - Operations Research

The paper concerns a model of influence in which agents make their decisions on a certain issue. We assume that each agent is inclined to make a particular decision, but due to a possible influence of the others, his final decision may be different from his initial inclination. Since in reality the influence does not necessarily stop after one step, but may iterate, we present a model which allows us to study the dynamic of influence. An innovative...

A study of the dynamic of influence through differential equations∗

Emmanuel Maruani, Michel Grabisch, Agnieszka Rusinowska (2012)

RAIRO - Operations Research

The paper concerns a model of influence in which agents make their decisions on a certain issue. We assume that each agent is inclined to make a particular decision, but due to a possible influence of the others, his final decision may be different from his initial inclination. Since in reality the influence does not necessarily stop after one step, but may iterate, we present a model which allows us to study the dynamic of influence. An innovative...

An application framework to systematically develop complex learning resources based on collaborative knowledge engineering

David Gañán, Santi Caballé, Jordi Conesa, Fatos Xhafa (2015)

International Journal of Applied Mathematics and Computer Science

This contribution proposes software infrastructure to support new types of learning methodologies and resources based on collaborative knowledge engineering by means of an innovative application framework called the virtualized collaborative sessions framework (VCSF). The VCSF helps meet challenging collaborative knowledge engineering requirements in online learning, such as increasing group members' learning performance during the on-line collaborative learning process. In turn, systematic application...

Composition and structure of social networks

Ove Frank (1997)

Mathématiques et Sciences Humaines

Social networks representing one or more relationships between individuals and one or more categorical characteristics of the individuals exhibit both structure and composition. Probabilistic models of such networks can be used for analyzing the interrelations between structural and compositional variables, for instance in order to find how structure can be explained by composition or how structure explains composition. Different models are discussed and different statistical methods are employed...

Convergence analysis for asymmetric Deffuant-Weisbuch model

Jiangbo Zhang (2014)

Kybernetika

In this paper, we investigate the convergence behavior of the asymmetric Deffuant-Weisbuch (DW) models during the opinion evolution. Based on the convergence of the asymmetric DW model that generalizes the conventional DW model, we first propose a new concept, the separation time, to study the transient behavior during the DW model's opinion evolution. Then we provide an upper bound of the expected separation time with the help of stochastic analysis. Finally, we show relations of the separation...

Dynamics of social networks: A deterministic approach

David Pearson, Mark McCartney (2002)

International Journal of Applied Mathematics and Computer Science

Our aim is to model the dynamics of social networks, which comprises the problem of how people get to know each other, like each other, detest each other, etc. Most existing models are stochastic in nature and, obviously, based on random events. Our approach is deterministic and based on ordinary differential equations. This should not be seen as a challenge to stochastic models, but rather as a complement.

Lack of Gromov-hyperbolicity in small-world networks

Yilun Shang (2012)

Open Mathematics

The geometry of complex networks is closely related with their structure and function. In this paper, we investigate the Gromov-hyperbolicity of the Newman-Watts model of small-world networks. It is known that asymptotic Erdős-Rényi random graphs are not hyperbolic. We show that the Newman-Watts ones built on top of them by adding lattice-induced clustering are not hyperbolic as the network size goes to infinity. Numerical simulations are provided to illustrate the effects of various parameters...

Modeling acquaintance networks based on balance theory

Vida Vukašinović, Jurij Šilc, Riste Škrekovski (2014)

International Journal of Applied Mathematics and Computer Science

An acquaintance network is a social structure made up of a set of actors and the ties between them. These ties change dynamically as a consequence of incessant interactions between the actors. In this paper we introduce a social network model called the Interaction-Based (IB) model that involves well-known sociological principles. The connections between the actors and the strength of the connections are influenced by the continuous positive and negative interactions between the actors and, vice...

Parameters in collective decision making models : estimation and sensitivity

Tom A. B. Snijders, Evelien P. H. Zeggelink, Frans N. Stokman (1997)

Mathématiques et Sciences Humaines

Simulation models for collective decision making are based on theoretical and empirical insight in the decision making process, but still contain a number of parameters of which the values are determined ad hoc. For the dynamic access model, some of such parameters are discussed, and it is proposed to extend the utility functions with a random term of which the variance also is an unknown parameter. These parameters can be estimated by fitting model predictions to data, where the predictions can...

Segmentation in personal networks

Tom A. B. Snijders, Marinus Spreen (1997)

Mathématiques et Sciences Humaines

A concept and several measures for segmentation of personal networks are proposed. It is argued that the implications of segmentation of personal networks are, in a sense, the opposite of those of segmentation of entire networks. The measures are illustrated by the example of the trust network in a civil service departement. For the case where relations in the personal network are observed by a sample rather than completely, estimators for the segmentation measures are given.

Social network evolution and actor oriented models. Applications in the fields of friendship formation, decision making, emergence of cooperation, and coalition formation

Evelien P. H. Zeggelink (1997)

Mathématiques et Sciences Humaines

We present an overview of different actor oriented models of network evolution, that have been developed in the last couple of years. The models are constructed in different fields of application and all have in common that the emergence of network structure is directly or indirectly of interest. Each model is based on a set of actors and a set of behavioral rules of these actors, resulting in interaction mechanisms and the coming into existence of some network pattern of relationships. Actors vary...

Structural analysis of social networks with respect to different levels of aggregation

Hans J. Hummell, Wolfgang Sodeur (1997)

Mathématiques et Sciences Humaines

The article aims at the integration of the two research traditions of multi-level and of network analysis. To this effect, a strategy is presented which can be traced back to P.F. Lazarsfeld and H. Menzel's typology of units and of their properties. After having extended their classification to take account of more network concepts than was needed at their time, the Lazarsfeld-Menzel-Classification is used as a conceptual instrument to translate a research question, which first looks like a specialty...

Structural endogamy and the network “graphe de parenté”

Douglas R. White (1997)

Mathématiques et Sciences Humaines

This article, one of a series, approaches the topics of marriage and kinship through a revitalized kinetic structural approach that shifts the primary focus from abstract models of rules, terminologies, attitudes and norms to exploration of concrete relations in a population, analyzed graph-theoretically in their full complexity as networks. Network representation using the graphe de parenté (see below) serves as the basis for examining marriage alliance theory, population structure (such as endogamy...

Currently displaying 1 – 20 of 21

Page 1 Next