Английская Википедия:Hafnian
Шаблон:Confuse In mathematics, the hafnian is a scalar function of a symmetric matrix that generalizes the permanent.
The hafnian was named by Eduardo R. Caianiello "to mark the fruitful period of stay in Copenhagen (Hafnia in Latin)."[1]
Definition
The hafnian of a <math>2n\times 2n</math> symmetric matrix <math>A</math> is defined as
- <math>
\operatorname{haf}(A) = \sum_{\rho\in P_{2n}^2} \prod_{\{i,j\} \in \rho} A_{i, j}, </math> where <math>P_{2n}^2</math> is the set of all partitions of the set <math>\{1, 2, \dots, 2n\}</math> into subsets of size <math>2</math>.[2][3]
This definition is similar to that of the Pfaffian, but differs in that the signatures of the permutations are not taken into account. Thus the relationship of the hafnian to the Pfaffian is the same as relationship of the permanent to the determinant.[4]
Basic properties
The hafnian may also be defined as
- <math>
\operatorname{haf}(A) = \frac{1}{n!2^n} \sum_{\sigma \in S_{2n}} \prod_{i=1}^n A_{\sigma(2i - 1), \sigma(2i)}, </math>
where <math>S_{2n}</math> is the symmetric group on <math>\{1,2,...,2n\}</math>.[5] The two definitions are equivalent because if <math>\sigma\in S_{2n}</math>, then <math>\{\{\sigma(2i-1),\sigma(2i)\}:i\in\{1,...,n\}\}</math> is a partition of <math>\{1,2,\dots,2n\}</math> into subsets of size 2, and as <math>\sigma</math> ranges over <math>S_{2n}</math>, each such partition is counted exactly <math>n!2^n</math> times. Note that this argument relies on the symmetry of <math>A</math>, without which the original definition is not well-defined.
The hafnian of an adjacency matrix of a graph is the number of perfect matchings (also known as 1-factors) in the graph. This is because a partition of <math>\{1,2,\dots,2n\}</math> into subsets of size 2 can also be thought of as a perfect matching in the complete graph <math>K_{2n}</math>.
The hafnian can also be thought of as a generalization of the permanent, since the permanent can be expressed as
- <math>\operatorname{per}(C)=\operatorname{haf}\begin{pmatrix}
0 & C \\ C^T & 0 \end{pmatrix}</math>.[2] Just as the hafnian counts the number of perfect matchings in a graph given its adjacency matrix, the permanent counts the number of matchings in a bipartite graph given its biadjacency matrix.
The hafnian is also related to moments of multivariate Gaussian distributions. By Wick's probability theorem, the hafnian of a real <math>2n\times 2n</math> symmetric matrix may expressed as
- <math>
\operatorname{haf}(A) = \mathbb E_{\left(X_1,\dots,X_{2n}\right)\sim\mathcal N\left(0,A+\lambda I\right)}\left[X_1\dots X_{2n}\right], </math> where <math>\lambda</math> is any number large enough to make <math>A+\lambda I</math> positive semi-definite. Note that the hafnian does not depend on the diagonal entries of the matrix, and the expectation on the right-hand side does not depend on <math>\lambda</math>.
Generating function
Let <math>S = \begin{pmatrix} A & C \\ C^T & B \end{pmatrix} = S^T</math> be an arbitrary complex symmetric <math>2m \times 2m</math> matrix composed of four <math>m \times m</math> blocks <math>A = A^T</math>, <math>B = B^T</math>, <math>C</math> and <math>C^T</math>. Let <math>z_1, \ldots , z_m</math> be a set of <math>m</math> independent variables, and let <math>Z = \begin{pmatrix} 0 & \textrm{diag}(z_1,z_2,\ldots,z_m) \\ \textrm{diag}(z_1,z_2,\ldots,z_m) & 0 \end{pmatrix}</math> be an antidiagonal block matrix composed of entries <math>z_j</math> (each one is presented twice, one time per nonzero block). Let <math>I</math> denote the identity matrix. Then the following identity holds:[4]
- <math>
\frac{1}{\sqrt{\det \big(I - Z S\big) }} = \sum_{\{n_k\}} \operatorname{haf} \tilde{S}(\{n_k\}) \prod_{k=1}^m \frac{z_k^{n_k}}{n_k!} </math> where the right-hand side involves hafnians of <math>\Big(2\sum_k n_k\Big)\times\Big(2\sum_k n_k\Big)</math> matrices <math>\tilde{S}(\{n_k\}) = \begin{pmatrix} \tilde{A}(\{n_k\}) & \tilde{C}(\{n_k\}) \\ \tilde{C}^T(\{n_k\}) & \tilde{B}(\{n_k\}) \\ \end{pmatrix}</math>, whose blocks <math>\tilde{A}(\{n_k\})</math>, <math>\tilde{B}(\{n_k\})</math>, <math>\tilde{C}(\{n_k\})</math> and <math>\tilde{C}^T(\{n_k\})</math> are built from the blocks <math>A</math>, <math>B</math>, <math>C </math> and <math>C^T</math> respectively in the way introduced in MacMahon's Master theorem. In particular, <math>\tilde{A}(\{n_k\})</math> is a matrix built by replacing each entry <math>A_{k,t}</math> in the matrix <math>A</math> with a <math>n_k \times n_t</math> block filled with <math>A_{k,t}</math>; the same scheme is applied to <math>B</math>, <math>C </math> and <math>C^T</math>. The sum <math>\sum_{\{n_k\}}</math> runs over all <math>k</math>-tuples of non-negative integers, and it is assumed that <math> \operatorname{haf} \tilde{S}(\{n_k=0|k=1\ldots m\}) = 1 </math>.
The identity can be proven[4] by means of multivariate Gaussian integrals and Wick's probability theorem.
The expression in the left-hand side, <math>1 \Big/ \sqrt{\det \big(I - Z S\big) } \Big. </math>, is in fact a multivariate generating function for a series of hafnians, and the right-hand side constitutes its multivariable Taylor expansion in the vicinity of the point <math>z_1 = \ldots = z_m = 0.</math> As a consequence of the given relation, the hafnian of a symmetric <math>2m \times 2m</math> matrix <math>S</math> can be represented as the following mixed derivative of the order <math>m</math>:
- <math>
\operatorname{haf}S = \bigg(\prod_{k=1}^m \frac{\partial}{\partial z_k} \bigg) \Bigg.\frac{1}{\sqrt{\det \big(I - Z S\big)}} \Bigg\vert_{z_j=0}. </math>
The hafnian generating function identity written above can be considered as a hafnian generalization of MacMahon's Master theorem, which introduces the generating function for matrix permanents and has the following form in terms of the introduced notation:
- <math>
\frac{1}{\det \big(I - \textrm{diag} (z_1,z_2,\ldots,z_m) C\big)} = \sum_{\{n_k\}} \operatorname{per} \tilde{C}(\{n_k\}) \prod_{k=1}^m \frac{z_k^{n_k}}{n_k!} </math>
Note that MacMahon's Master theorem comes as a simple corollary from the hafnian generating function identity due to the relation <math>\operatorname{per} (C) = \operatorname{haf} \begin{pmatrix} 0 & C \\ C^T & 0 \end{pmatrix}</math>.
Non-negativity
If <math>C</math> is a Hermitian positive semi-definite <math>n\times n</math> matrix and <math>B</math> is a complex symmetric <math>n\times n</math> matrix, then
- <math>\operatorname{haf}\begin{pmatrix}
B & C \\ \overline{C} & \overline{B} \end{pmatrix}\geq 0,</math> where <math>\overline{C}</math> denotes the complex conjugate of <math>C</math>.[6]
A simple way to see this when <math>\begin{pmatrix} C & B \\ \overline{B} & \overline{C} \\ \end{pmatrix}</math> is positive semi-definite is to observe that, by Wick's probability theorem, <math>\operatorname{haf}\begin{pmatrix} B & C \\ \overline{C} & \overline{B} \\ \end{pmatrix}=\mathbb E\left[\left|X_1\dots X_n\right|^2\right]</math> when <math>\left(X_1,\dots,X_n\right)</math> is a complex normal random vector with mean <math>0</math>, covariance matrix <math>C</math> and relation matrix <math>B</math>.
This result is a generalization of the fact that the permanent of a Hermitian positive semi-definite matrix is non-negative. This corresponds to the special case <math>B=0</math> using the relation <math>\operatorname{per} (C) = \operatorname{haf} \begin{pmatrix} 0 & C \\ C^T & 0 \end{pmatrix}</math>.
Loop hafnian
The loop hafnian of an <math>m\times m</math> symmetric matrix is defined as
- <math>
\operatorname{lhaf}(A) = \sum_{\rho \in \mathcal{M}} \prod_{\scriptscriptstyle (i, j) \in \rho} A_{i, j} </math> where <math>\mathcal{M}</math> is the set of all perfect matchings of the complete graph on <math>m</math> vertices with loops, i.e., the set of all ways to partition the set <math>\{1, 2, \dots, m\}</math> into pairs or singletons (treating a singleton <math>(i)</math> as the pair <math>(i, i)</math>).[7] Thus the loop hafnian depends on the diagonal entries of the matrix, unlike the hafnian.[7] Furthermore, the loop hafnian can be non-zero when <math>m</math> is odd.
The loop hafnian can be used to count the total number of matchings in a graph (perfect or non-perfect), also known as its Hosoya index. Specifically, if one takes the adjacency matrix of a graph and sets the diagonal elements to 1, then the loop hafnian of the resulting matrix is equal to the total number of matchings in the graph.[7]
The loop hafnian can also be thought of as incorporating a mean into the interpretation of the hafnian as a multivariate Gaussian moment. Specifically, by Wick's probability theorem again, the loop hafnian of a real <math>m\times m</math> symmetric matrix can be expressed as
- <math>
\operatorname{lhaf}(A) = \mathbb E_{\left(X_1,\dots,X_m\right)\sim\mathcal N\left(\operatorname{diag}\left(A\right),A+\lambda I\right)}\left[X_1\dots X_m\right], </math> where <math>\lambda</math> is any number large enough to make <math>A+\lambda I</math> positive semi-definite.
Computation
Computing the hafnian of a (0,1)-matrix is #P-complete, because computing the permanent of a (0,1)-matrix is #P-complete.[4][7]
The hafnian of a <math>2n\times 2n</math> matrix can be computed in <math>O(n^3 2^n)</math> time.[7]
If the entries of a matrix are non-negative, then its hafnian can be approximated to within an exponential factor in polynomial time.[8]
See also
References
- ↑ F. Guerra, in Imagination and Rigor: Essays on Eduardo R. Caianiello's Scientific Heritage, edited by Settimo Termini, Springer Science & Business Media, 2006, page 98
- ↑ 2,0 2,1 Шаблон:Cite book
- ↑ Шаблон:Cite journal
- ↑ 4,0 4,1 4,2 4,3 Шаблон:Cite journal
- ↑ Шаблон:Cite journal
- ↑ Шаблон:Cite journal
- ↑ 7,0 7,1 7,2 7,3 7,4 Шаблон:Cite arXiv
- ↑ Шаблон:Cite journal
