2021
DOI: 10.22191/nejcs/vol3/iss1/5
|View full text |Cite
|
Sign up to set email alerts
|

Entropic dynamics of networks

Abstract: Here we present the entropic dynamics formalism for networks. That is, a framework for the dynamics of graphs meant to represent a network derived from the principle of maximum entropy and the rate of transition is obtained taking into account the natural information geometry of probability distributions. We apply this framework to the Gibbs distribution of random graphs obtained with constraints on the node connectivity. The information geometry for this graph ensemble is calculated and the dynamical process … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 64 publications
0
1
0
Order By: Relevance
“…In each of these, we were able to provide insight on the dynamics by presenting the drift velocity (57) and the equilibrium stationary states (59). Additionally, as future work, we intend to apply the dynamics developed here in the distributions found in network sciences [65]. such that they equate to dA P(A ) f (A ) − dA P(A) f (A) = dA P(A) b i…”
Section: Discussionmentioning
confidence: 97%
“…In each of these, we were able to provide insight on the dynamics by presenting the drift velocity (57) and the equilibrium stationary states (59). Additionally, as future work, we intend to apply the dynamics developed here in the distributions found in network sciences [65]. such that they equate to dA P(A ) f (A ) − dA P(A) f (A) = dA P(A) b i…”
Section: Discussionmentioning
confidence: 97%