A utility-maximization framework with dot-product compatibilities that can regenerate any undirected graph and generate similar synthetic networks via agent-based simulations.
Moreover, α∗∗ the solution of the associated SOP, verifies: ∀(i, j) ∈ J1..N K2, α∗∗ i,j = (αmax {i,j})∗ min {i,j} D
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Generating social networks with static and dynamic utility-maximization approaches
A utility-maximization framework with dot-product compatibilities that can regenerate any undirected graph and generate similar synthetic networks via agent-based simulations.