module submission: 2024-Jarigsma-001

2024-Jarigsma-001/CHANGELOG.md

@@ -0,0 +1,2 @@
+## 1.0.0
+- Creation of the module.

2024-Jarigsma-001/LICENSE

@@ -0,0 +1,9 @@
+MIT License
+
+Copyright 2024 Amber Esha Jarigsma
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

2024-Jarigsma-001/NASSA.yml

@@ -0,0 +1,41 @@
+id: 2024-Jarigsma-001
+nassaVersion: 0.5.1
+moduleType: Algorithm
+title: Preferential Attachment Network
+moduleVersion: 1.0.0
+contributors:
+ - name: Jarigsma, Amber Esha
+   roles: [ "Copyright Holder", "Author", "Creator"]
+   email: a.e.jarigsma@student.vu.nl
+   orcid: 0009-0008-9842-7913
+lastUpdateDate: 2024-11-28
+description: >
+ This NetLogo algorithm simulates network formation using preferential attachment. New nodes are more likely to connect to existing nodes with higher degrees, reflecting a "lottery" system where popular nodes attract more links. 
+references:
+  moduleReferences: [ Wilensky-2005 ]
+inputs:
+  - name: initial-number-nodes
+    type: integer
+    unit: nodes
+    description: the number of unconnected nodes existing before preferential attachment is applied.
+outputs:
+  - name: network
+    type: object (agent and link sets)
+    description: nodes (turtles, breed nodes) and edges (links) between nodes, formed with iterations of preferential attachment.
+domainKeywords:
+  regions: 
+    - global
+  subjects: 
+    - social networks
+modellingKeywords:
+  - agent interaction
+  - preferential attachment
+  - network dynamics
+programmingKeywords:
+  - network simulation
+  - stochastic
+implementations:
+  - language: NetLogo
+    softwareDependencies:
+      - NetLogo >= v6.4.0
+license: MIT

2024-Jarigsma-001/README.md

@@ -0,0 +1,28 @@
+# Preferential Attachment Network
+*by Amber Esha Jarigsma*  
+
+This algorithm is a version of preferential attachment algorithm, generating networks where nodes (agents) are connected based on their existing number of links, simulating the "rich-get-richer" effect. It uses a lottery-style partner selection method to form links between nodes, favoring those with more existing connections. This structure can model social networks, trade networks in ancient societies, settlement hierarchies, or other real-world systems where growth follows a preferential attachment pattern.  
+
+## License
+**MIT** 
+
+## References
+For an alternative approach to implementing a preferential attachment network, see:
+Wilensky, U. (2005). NetLogo Preferential Attachment model. http://ccl.northwestern.edu/netlogo/models/PreferentialAttachment. Center for Connected Learning and Computer-Based Modeling, Northwestern University, Evanston, IL.
+
+In this model, partner selection is determined through the selection of a random link, with one of the two nodes at either end of the link serving as the new partner. This method simplifies the implementation by leveraging existing network properties, eliminating the need to explicitly calculate or store node degrees. In contrast, the implementation described here generates a weighted list of nodes based on their degrees, from which a partner is selected. While Wilensky’s approach reduces computational complexity, it sacrifices some of the flexibility and reusability offered by this more modular design, which separates key functions and explicitly tracks node attributes.
+
+Additionally, the nw extension in NetLogo provides a built-in procedure, nw:generate-preferential-attachment, for generating scale-free networks based on the Barabási–Albert algorithm. However, as this is part of an extension and not written in NetLogo's native language, it may be less transparent and customisable compared to explicit implementations.
+
+This implementation draws inspiration from Wilensky (2005) and the foundational work it cites. For further background on preferential attachment and scale-free networks, see:
+
+Albert-László Barabási. Linked: The New Science of Networks. Perseus Publishing, Cambridge, Massachusetts, pages 79–92.
+
+Albert-László Barabási & Reka Albert. "Emergence of Scaling in Random Networks." Science, Vol. 286, Issue 5439, 15 October 1999, pages 509–512.
+
+## Further information
+This model is an algorithm implemented in NetLogo. 
+Users can choose how many (unattached) nodes to begin the algorithm with. 
+Node size is proportional to the number of links the node has.
+
+<img width="622" alt="Screenshot 2024-11-15 at 22 28 25" src="https://github.com/user-attachments/assets/b7b7b9fa-aeb2-49ce-bd3d-ea9482c05f2f">