How pairs of partners emerge in an initially fully connected society
J.Karpinska, K.Malarz, K.Kulakowski (AGH-UST)

TL;DR
This paper models social partner formation as a dynamic process on a fully connected graph where resources and interactions evolve, leading to stable pairs or 'marriages' and inactive nodes, illustrating how social bonds emerge.
Contribution
It introduces a novel dynamic model of resource exchange and interaction reorganization that explains the emergence of stable pairs in social networks.
Findings
Stable pairs with symmetric interactions emerge over time.
The proportion of active nodes depends on the rate of interaction change.
The model can be interpreted as a social algorithm leading to marriages.
Abstract
A social group is represented by a graph, where each pair of nodes is connected by two oppositely directed links. At the beginning, a given amount of resources is assigned randomly to each node . Also, each link is initially represented by a random positive value, which means the percentage of resources of node which is offered to node . Initially then, the graph is fully connected, i.e. all non-diagonal matrix elements are different from zero. During the simulation, the amounts of resources change according to the balance equation. Also, nodes reorganise their activity with time, going to give more resources to those which give them more. This is the rule of varying the coefficients . The result is that after some transient time, only some pairs of nodes survive with non-zero and , each pair with symmetric and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
