Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
freem
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Openai/693343d7-a38c-8012-a67c-11cbed4c0fd9
(section)
Add languages
Page
Discussion
English
Read
Edit
Edit source
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
Edit source
View history
General
What links here
Related changes
Special pages
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Extend agent tuple: === <syntaxhighlight>A = (S, M, P, C, F, A_c, Ω, θ) </syntaxhighlight> where θ are persistent social attributes or embedding vectors used for similarity. Define network adjacency with affinities: <syntaxhighlight>W_{i,j}(t) ∈ [0,1] (weighted directed adjacency) W_{i,j}(t+1) = g( W_{i,j}(t), Aff(A_i, A_j), interaction_history, τ ) </syntaxhighlight> Simple discrete dynamics (link formation / rewiring): <syntaxhighlight>ΔW_{ij} = λ_form · (Aff(A_i,A_j) - W_{ij}) - λ_decay · W_{ij} + η_{ij}(t) W_{ij} ← clamp(W_{ij} + ΔW_{ij}, 0, 1) </syntaxhighlight> Interpretation: * high Aff → increase connection strength, * decay and noise terms model forgetting and turnover.
Summary:
Please note that all contributions to freem are considered to be released under the Creative Commons Attribution-ShareAlike 4.0 (see
Freem:Copyrights
for details). If you do not want your writing to be edited mercilessly and redistributed at will, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource.
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)