2000 character limit reached
Hierarchy depth in directed networks
Published 8 Mar 2013 in physics.soc-ph and cond-mat.stat-mech | (1303.2085v1)
Abstract: We explore depth measures for flow hierarchy in directed networks. We define two measures -- rooted depth and relative depth, and discuss differences between them. We investigate how the two measures behave in random Erdos-Renyi graphs of different sizes and densities and explain obtained results.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.