I would much rather have an algorithm which chooses the sparsity of the graph and then gives you back a sub graph that has that sort of sparsity. Instead what we've got is this like a proxy measure of the like local corruption amount that's allowed but it certainly can give you some indication of how sparse the end graph will be. The AC-DC iterative process first will process the output node so once you've run with a particular threshold you'll be able to seelike how many nodes is added to the output connection. This will provide some guide to then how many nodes will be upstream because if you have one half of the nodes outputting to the end connection then it seems like

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode