Abstract
In this note we study inhomogeneous random bipartite graphs in random environment. These graphs can be thought of as an extension of the classical Erdös-Rényi random graphs in a random environment. We show that the expected number of perfect matchings obeys a precise quenched asymptotic and that it can be approximated using an iterative process that converges exponentially fast.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.