Showing papers in "Social Networks in 2006"

TL;DR: This paper develops a unified framework for the measurement of centrality and shows centrality to be intimately connected with the cohesive subgroup structure of a network.

TL;DR: It is found that social networks with multiple interaction contexts may have certain interesting properties due to the presence of overlapping cliques, and assortativity by degree does not necessarily improve network robustness to random omission of nodes as predicted by current theory.

TL;DR: Dense networks were the most robust in the face of all kinds of error except edge deletion, which suggests that, for random networks and random error, the authors shall be able to construct confidence intervals around centrality scores.

TL;DR: The results suggest that people who see themselves vulnerable to external forces tend to inhabit closed networks of weak connections, and people who seek to keep their strong tie partners apart, and thereby bridge structural holes, tend to be individualists, to believe that they control the events in their lives, and to have higher levels of neuroticism.

TL;DR: In the US House and Senate, each piece of legislation is sponsored by a unique legislator and they can publicly express their support for the legislation by cosponsoring it by publicly expressing support for it as mentioned in this paper.

TL;DR: A simple way to acquire comprehensive information and a condensed way to represent the complexity of a person's support network so this information can easily be included in classic survey analyses is presented.

TL;DR: Men were shown to be more effective in creating hard social capital, but, unexpectedly, women were not found to be the emotional specialists they often are thought to be.

TL;DR: Strong evidence of triadic effects is found—people are more likely to remain in contact with others when they share patterns of contact with third parties, giving a sense of how networks structure themselves over time.

TL;DR: This paper examines the use of individual, dyadic and system-level analyses in the study of relational data in organizational networks to suggest that dyadic analyses are particularly appropriate when the dependent variable is quantitative and/or involves multiple behaviors.

TL;DR: This paper solves two problems, searching for the optimal core/periphery structure and devising a valid statistical test to replace the one invalidated by the search, with an adaptation of the Kernighan–Lin search algorithm and with a permutation test incorporating this algorithm.

TL;DR: The clustering technique for one-mode social network data is adapted to identify positions in affiliation networks by drawing on recent extensions of p(*) models to two-mode data.

TL;DR: Results show that question order by questions, all-labeled response categories and a graphical display lay-out with images lead to a better data quality of egocentered network questionnaire, regardless of the data collection mode.

TL;DR: Following 77 MBA graduates over three time periods finds evidence for an inner–outer core network structure in which ties providing high psychosocial support and low career support populate the inner core.

TL;DR: This work focuses on simple exchange networks and presents a formal model for predicting profit splits from such structures and combines the generalized Nash bargaining solution from game theory with the assumption that both relational features and network positions affect exchange outcomes.

TL;DR: Modified theorems for the equilibria forms are presented together with a generalization of the equilibrium concept and the transitions between networks on the lattices of all graphs with a fixed number of vertices through the addition and deletion of ties are explored.

TL;DR: This is the first study of the impact of accuracy within small world chains, and a Markov model with a probability of simply guessing an intermediary of 0.52 gives an excellent fit to the observations, suggesting that people make the wrong small world choice more than half the time.

TL;DR: By analyzing a model and tennis players’ partnership networks, it is shown that combination of vertex fitness and homophily yields a VIP-club made of elite vertices that are influential but not easily accessed from the majority.

TL;DR: In this paper, exact bounds for degree centralization given density as well as order are provided. But they do not consider the geometry of the feasible region, which is different with graph size.

TL;DR: Comparisons with support networks identified through lifecycle interviews and 24 h recall support the construct validity of the survey approach in both ethnic groups.

TL;DR: The original approach of these authors is modified, employing measures that, in this opinion, show a larger degree of coherence and accuracy in the proposed objectives.

TL;DR: It is demonstrated that contrary to anticipation, the firm’s profit smoothly approaches the profit in the complete network as the rewiring probability increases, but that the per consumer profit is saturated to a finite non-zero value when the reWiring probability is near zero, implying a small world transition.

TL;DR: Social networks can be embedded in an n-dimensional space, where the dimensions may reveal or denote underlying properties of interest, and it is shown there exists a non-monotonic effect of dimensionality change.

TL;DR: This article identifies the nodes of a network with cells of an automaton and considers nodes adjacent if they are neighboring cells in the automaton, allowing us to determine structural influences of strategy evolution in the game of Chicken.

TL;DR: In an example involving 317 banks, a canonical correlation analysis (CCA) is applied to two multiplex networks: interdependence and cooperative alliances and four significant patterns of association are identified.

TL;DR: All earlier results obtained by Bonacich are re-examined and there is given a new graph-theoretic necessary and sufficient condition for the existence of nonempty core for the game representing a homogenous one-exchange network.