Return to Question

Planar graph permanent can be reduced to determinants and so statistics should be amenable.

Pick a uniformly random bipartite planar graph $G$ with $n$ vertices of each color and choose new additional edge on condition that the new bipartite graph $H$ is planar. Denote $f(G)$ and $f(H)$ to number of perfect matchings of each color respectively. The probability distribution of $G$ is different from $H$ since $H$ is no longer picked from uniform distribution.

What is the probability distribution or at least mean and variance of

1. number of perfect matchings $f(G)$

2. number of perfect matchings $f(H)$ (note the probability distribution of $H$ is different from $G$)

3. number of additional perfect matchings $f(H) - f(G)$?

Note number of additional perfect matchings is not a Markov process (it depends on $f(G)$).

Also since number of edges of planar bipartite graphs are bound we do not have much room to draw edges of $H$ in general and this too depends on starting graph $G$ and is not a Markov process.

Planar graph permanent can be reduced to determinants and so statistics should be amenable.

Pick a uniformly random bipartite planar graph $G$ with $n$ vertices of each color and choose new additional edge on condition that the new bipartite graph $H$ is planar. Denote $f(G)$ and $f(H)$ to number of perfect matchings of each color respectively. The probability distribution of $G$ is different from $H$ since $H$ is no longer picked from uniform distribution.

What is the probability distribution or at least mean and variance of

1. number of perfect matchings $f(G)$

2. number of perfect matchings $f(H)$ (note the probability distribution of $H$ is different from $G$)

3. number of additional perfect matchings $f(H) - f(G)$?

Note number of additional perfect matchings is not a Markov process (it depends on $f(G)$).

Also since number of edges of planar bipartite graphs are bound we do not have much room to draw edges of $H$ in general and this too depends on starting graph $G$ and is not a Markov process.

Planar graph permanent can be reduced to determinants and so statistics should be amenable.

1. What is the probability distribution or at least mean and variance of number of perfect matchings of bipartite planar graphs with $n$ vertices of each color?

2. Given bipartite planar graph $G$ with $n$ vertices of each color and with $f(G)$ perfect matchings if we add one vertex of each color and choose new additional edge on condition that the new bipartite graph is planar then what is the probability distribution or at least mean and variance of number of additional perfect matchings?

Note number of additional perfect matchings is not a Markov process (it depends on $f(G)$).

Also since number of edges of planar bipartite graphs are bound we do not have much room to draw edges in general and this too depends on starting graph $G$ and is not a Markov process.

Planar graph permanent can be reduced to determinants and so statistics should be amenable.

Pick a uniformly random bipartite planar graph $G$ with $n$ vertices of each color and choose new additional edge on condition that the new bipartite graph $H$ is planar. Denote $f(G)$ and $f(H)$ to number of perfect matchings of each color respectively. The probability distribution of $G$ is different from $H$ since $H$ is no longer picked from uniform distribution.

What is the probability distribution or at least mean and variance of

1. number of perfect matchings $f(G)$

2. number of perfect matchings $f(H)$ (note the probability distribution of $H$ is different from $G$)

3. number of additional perfect matchings $f(H) - f(G)$?

Note number of additional perfect matchings is not a Markov process (it depends on $f(G)$).

Also since number of edges of planar bipartite graphs are bound we do not have much room to draw edges of $H$ in general and this too depends on starting graph $G$ and is not a Markov process.

Planar graph permanent can be reduced to determinants and so statistics should be amenable.

1. What is the probability distribution or at least mean and variance of number of perfect matchings of bipartite planar graphs with $n$ vertices of each color?

Given bipartite planar graph $G$ with $n$ vertices of each color and with $f(G)$ perfect matchings if we add one vertex of each color and choose new additional edge on condition that the new bipartite graph is planar.

2. What is the probability distribution or at least mean and variance of number of additional perfect matchings?

Note number of additional perfect matchings is not a Markov process (it depends on $f(G)$).

Also since number of edges of planar bipartite graphs are bound we do not have much room to draw edges in general and this too depends on starting graph $G$ and is not a Markov process.

Planar graph permanent can be reduced to determinants and so statistics should be amenable.

1. What is the probability distribution or at least mean and variance of number of perfect matchings of bipartite planar graphs with $n$ vertices of each color?

2. Given bipartite planar graph $G$ with $n$ vertices of each color and with $f(G)$ perfect matchings if we add one vertex of each color and choose new additional edge on condition that the new bipartite graph is planar then what is the probability distribution or at least mean and variance of number of additional perfect matchings?

Note number of additional perfect matchings is not a Markov process (it depends on $f(G)$).

Also since number of edges of planar bipartite graphs are bound we do not have much room to draw edges in general and this too depends on starting graph $G$ and is not a Markov process.