We focus on analysis of dominance, power, influence---that by definition asymmetric---between pairs of individuals in social networks. We conduct dominance analysis based on the canonical analysis of asymmetry that decomposes a square asymmetric matrix into two parts, a symmetric one and a skew-symmetric one, and then applies the singular value decomposition (SVD) on the skew-symmetric part. Each individual node can be projected as one 2-dimensional point based on its row values at each pair of successive singular vectors. The asymmetric relationship between two individuals can then be captured by areas of triangles formed from the two points and the origin in each 2-dimensional space. We quantify node dominance (submissive) score based on ...
This paper shows an overview of the different concepts and techniques that are been used in social n...
According to the DeGroot-Friedkin model of a social network, an individual's social power evolves as...
<p><b>A</b> shows the relationship between initial graph density at <i>t</i> = 0 and graph propertie...
Social network analysis (SNA) focuses on the structure of ties within a set of social actors, e.g., ...
Many social phenomena involve a set of dyadic relations among agents whose actions may be dependent....
In social network analysis, many estimation methods have been developed over the past three decades....
Complex networks represent an extensive variety of systems in nature and human interactions. Network...
Our aim here is to address the problem of decomposing a whole network into a minimal number of ego–c...
The hierarchical organization of dominance relations among animals has wide-ranging implications in ...
This archive contains datasets (DBLP, Cond-Mat, APS) used in the article "Understanding weight-...
The notion of ``balance'' is fundamental for sociologists who study social networks. In formal mathe...
Network structure has been put forward as a possible solution to cooperation problems and social di...
We deliver a short overview of di erent centrality measures and influence concepts in social network...
Journal of Mathematics and System Science 3:531-41In a social network analysis the output provided i...
Understanding social influence and identifying influential members of a community is of interest to ...
This paper shows an overview of the different concepts and techniques that are been used in social n...
According to the DeGroot-Friedkin model of a social network, an individual's social power evolves as...
<p><b>A</b> shows the relationship between initial graph density at <i>t</i> = 0 and graph propertie...
Social network analysis (SNA) focuses on the structure of ties within a set of social actors, e.g., ...
Many social phenomena involve a set of dyadic relations among agents whose actions may be dependent....
In social network analysis, many estimation methods have been developed over the past three decades....
Complex networks represent an extensive variety of systems in nature and human interactions. Network...
Our aim here is to address the problem of decomposing a whole network into a minimal number of ego–c...
The hierarchical organization of dominance relations among animals has wide-ranging implications in ...
This archive contains datasets (DBLP, Cond-Mat, APS) used in the article "Understanding weight-...
The notion of ``balance'' is fundamental for sociologists who study social networks. In formal mathe...
Network structure has been put forward as a possible solution to cooperation problems and social di...
We deliver a short overview of di erent centrality measures and influence concepts in social network...
Journal of Mathematics and System Science 3:531-41In a social network analysis the output provided i...
Understanding social influence and identifying influential members of a community is of interest to ...
This paper shows an overview of the different concepts and techniques that are been used in social n...
According to the DeGroot-Friedkin model of a social network, an individual's social power evolves as...
<p><b>A</b> shows the relationship between initial graph density at <i>t</i> = 0 and graph propertie...