Papers › Premagic and Ideal Flow Matrices
Premagic and Ideal Flow Matrices
Kardi Teknomo
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Several interesting properties of a special type of matrix that has a row sum equal to the column sum are shown with the proofs. Premagic matrix can be applied to strongly connected directed network graph due to its nodes conservation flow. Relationships between Markov Chain, ideal flow and random walk on directed graph are also discussed.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections