Convergence of many interacting agents with non-identical connection weights to a deterministic Vlasov limit is proved using a distance that couples optimal transport and graph fractional isomorphism.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AP 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Coupling and Tensorization of Kinetic Theory and Graph Theory
Convergence of many interacting agents with non-identical connection weights to a deterministic Vlasov limit is proved using a distance that couples optimal transport and graph fractional isomorphism.