A "network of networks" (from history to algebra)
Daniel Parrochia

TL;DR
This paper explores an algebraic framework for flows and tensions in transportation networks using complex and hermitian matrices, connecting classical network theory with advanced algebraic and geometric structures.
Contribution
It introduces a novel algebraic model of networks using lattices of complex and hermitian matrices, extending classical network concepts to the Siegel space and symplectic groups.
Findings
Lattices of flow/tension values form congruence classes under SL(2,C) and Sp(2n,R).
A new lattice function is defined on the set of all lattices in Siegel space.
The minimal length tree of the network of networks is studied.
Abstract
Recall first the algebraic treatment of flows or tensions in a transportation network , i.e. a connected antisymmetric 1-graph . Assume that, unusually, we take the values of flows (resp. tensions) in . So the algebraic lattices of flow (resp. tension) values associated to are lattices of . These lattices are congruent modulo the action of the special linear group SL(). Then, it is well known one can define a lattice function , as a modular function of weight , on the set of all lattices of . Let now be connected antisymmetric 1-graphs and , the set of hermitian symmetric matrices . Let also be the set of all the lattices of . The previous structure can be transposed to any symmetric…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Geometry · Mathematical Dynamics and Fractals · Advanced Combinatorial Mathematics
