Abstract
A three-parameter model of a random directed graph (digraph) is specified by the probability of ‘up arrows' from vertexito vertexjwherei < j, the probability of ‘down arrows' fromitojwherei ≥ j,and the probability of bidirectional arrows betweeniandj.In this model, a phase transition—the abrupt appearance of a giant strongly connected component—takes place as the parameters cross a critical surface. The critical surface is determined explicitly. Before the giant component appears, almost surely all non-trivial components are small cycles. The asymptotic probability that the digraph contains no cycles of length 3 or more is computed explicitly. This model and its analysis are motivated by the theory of food webs in ecology.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
