A Dyadic Perspective of Felt Security: Does Partners’ Security Buffer the Effects of Actors’ Insecurity on Daily Commitment?

Interdependence and attachment models have identified felt security as a critical foundation for commitment by orientating individuals towards relationship-promotion rather than self-protection. However, partners’ security also signals the relative safety to commit to relationships. The current investigation adopted a dyadic perspective to examine whether partners’ security acts as a strong link by buffering the negative effects of actors’ insecurity on daily commitment. Across two daily diary studies (Study 1, N = 78 dyads and Study 2, N = 73 dyads), actors’ X partners’ daily felt security interactions revealed a strong-link pattern: lower actors’ felt security on a given day predicted lower daily commitment, but these reductions were mitigated when partners reported higher levels of felt security that day. Actors’ X partners’ trait insecurity (attachment anxiety) interaction also showed this strong-link pattern in Study 1 but not Study 2. The results suggest that partners’ felt security can help individuals experiencing insecurity overcome their self-protective impulses and feel safe enough to commit to their relationship on a daily basis.

Fully packed loop configurations : polynomiality and nested arches

International audience This extended abstract proves that the number of fully packed loop configurations whose link pattern consists of two noncrossing matchings separated by m nested arches is a polynomial in m. This was conjectured by Zuber (2004) and for large values of m proved by Caselli et al. (2004)

Fully Packed Loop Configurations: Polynomiality and Nested Arches

This article proves a conjecture by Zuber about the enumeration of fully packed loops (FPLs). The conjecture states that the number of FPLs whose link pattern consists of two noncrossing matchings which are separated by $m$ nested arches is a polynomial function in $m$ of certain degree and with certain leading coefficient. Contrary to the approach of Caselli, Krattenthaler, Lass and Nadeau (who proved a partial result) we make use of the theory of wheel polynomials developed by Di Francesco, Fonseca and Zinn-Justin. We present a new basis for the vector space of wheel polynomials and a polynomiality theorem in a more general setting. This allows us to finish the proof of Zubers conjecture.

Correlation network analysis between phenotypic and genotypic traits of chili pepper

The objective of this work was to build weighted correlation networks, in order to discover correlation structures and link patterns among 28 morphoagronomic traits of chili pepper related to seedling, plant, inflorescence, and fruit. Phenotypic and genotypic information of 16 Capsicum genotypes were analyzed. Correlation structures and link patterns can be easily identified in the matrices using the Fruchterman-Reingold algorithm with correlation network information. Both types of correlations showed the same general link pattern among fruit traits, with high broad-sense heritability values and high aptitude of the genotypes for agronomic and ornamental breeding. Leaf dimensions are correlated with a cluster of fruit traits. Correlation networks of chili pepper traits may increase the effectiveness of genotype selection, since both correlated traits and groups can be identified.

Approaches to improve the robustness on interdependent networks against cascading failures with load-based model

With load-based model, considering the loss of capacity on nodes, we investigate how the coupling strength (many-to-many coupled pattern) and link patterns (one-to-one coupled pattern) can affect the robustness of interdependent networks. In one-to-one coupled pattern, we take into account the properties of degree and betweenness, and adopt four kinds of inter-similarity link patterns and random link pattern. In many-to-many coupled pattern, we propose a novel method to build new networks via adding inter-links (coupled links) on the existing one-to-one coupled networks. For a full investigation on the effects, we conduct two types of attack strategies, i.e. RO-attack (randomly remove only one node) and RF-attack (randomly remove a fraction of nodes). We numerically find that inter-similarity link patterns and bigger coupling strength can effectively improve the robustness under RO-attacks and RF-attacks in some cases. Therefore, the inter-similarity link patterns can be applied during the initial period of network construction. Once the networks are completed, the robustness level can be improved via adding inter-links appropriately without changing the existing inter-links and topologies of networks. We also find that BA–BA topology is a better choice and that it is not useful to infinitely increase the capacity which is defined as the cost of networks.

Wieland Drift for Triangular Fully Packed Loop Configurations

Triangular fully packed loop configurations (TFPLs) emerged as auxiliary objects in the study of fully packed loop configurations on a square (FPLs) corresponding to link patterns with a large number of nested arches. Wieland gyration, on the other hand, was invented to show the rotational invariance of the numbers $A_\pi$ of FPLs corresponding to a given link pattern $\pi$. The focus of this article is the definition and study of Wieland drift on TFPLs. We show that the repeated application of this operation eventually leads to a configuration that is left invariant. We also provide a characterization of such stable configurations. Finally we apply Wieland drift to the study of TFPL configurations, in particular giving new and simple proofs of several results.