6 citations · 9 across the 6 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.SI2026
Higher-order rich clubs and configuration models on general directed hypergraphs
Jason P. Smith, Celia Hacker, Jānis Lazovskis +3
Detecting structure in complex networks, especially those arising from physical systems, is a central problem across the sciences. One approach is via rich club analysis, which ide…
math.CO2026
Linear extensions and directed clique counts via modular partitions
Daniela Egas Santander, Matteo Santoro, Jason P. Smith
Counting linear extensions is a fundamental problem in poset theory. It is known to be #P-complete, with polynomial-time formulas available in special cases. In this work, we devel…