U
    +þjg£
  ã                   @   s<   d Z ddlZddlmZ dgZedƒedƒddd„ƒƒZdS )	z5Bethe Hessian or deformed Laplacian matrix of graphs.é    N)Únot_implemented_forÚbethe_hessian_matrixZdirectedZ
multigraphc           
   	   C   sÒ   ddl }ddl}|dkr t| ƒ}|dkr\tdd„ t | ¡D ƒƒtdd„ t | ¡D ƒƒ d }tj| |dd}|j\}}|j 	|jj
|jdd	d||dd
¡}|j 	|jj||dd
¡}	|d d |	 ||  | S )uì  Returns the Bethe Hessian matrix of G.

    The Bethe Hessian is a family of matrices parametrized by r, defined as
    H(r) = (r^2 - 1) I - r A + D where A is the adjacency matrix, D is the
    diagonal matrix of node degrees, and I is the identify matrix. It is equal
    to the graph laplacian when the regularizer r = 1.

    The default choice of regularizer should be the ratio [2]_

    .. math::
      r_m = \left(\sum k_i \right)^{-1}\left(\sum k_i^2 \right) - 1

    Parameters
    ----------
    G : Graph
       A NetworkX graph
    r : float
       Regularizer parameter
    nodelist : list, optional
       The rows and columns are ordered according to the nodes in nodelist.
       If nodelist is None, then the ordering is produced by ``G.nodes()``.

    Returns
    -------
    H : scipy.sparse.csr_array
      The Bethe Hessian matrix of `G`, with parameter `r`.

    Examples
    --------
    >>> k = [3, 2, 2, 1, 0]
    >>> G = nx.havel_hakimi_graph(k)
    >>> H = nx.bethe_hessian_matrix(G)
    >>> H.toarray()
    array([[ 3.5625, -1.25  , -1.25  , -1.25  ,  0.    ],
           [-1.25  ,  2.5625, -1.25  ,  0.    ,  0.    ],
           [-1.25  , -1.25  ,  2.5625,  0.    ,  0.    ],
           [-1.25  ,  0.    ,  0.    ,  1.5625,  0.    ],
           [ 0.    ,  0.    ,  0.    ,  0.    ,  0.5625]])

    See Also
    --------
    bethe_hessian_spectrum
    adjacency_matrix
    laplacian_matrix

    References
    ----------
    .. [1] A. Saade, F. Krzakala and L. ZdeborovÃ¡
       "Spectral Clustering of Graphs with the Bethe Hessian",
       Advances in Neural Information Processing Systems, 2014.
    .. [2] C. M. Le, E. Levina
       "Estimating the number of communities in networks by spectral methods"
       arXiv:1507.00827, 2015.
    r   Nc                 s   s   | ]\}}|d  V  qdS )é   N© ©Ú.0ÚvÚdr   r   úF/tmp/pip-unpacked-wheel-9meu_2xh/networkx/linalg/bethehessianmatrix.pyÚ	<genexpr>G   s     z'bethe_hessian_matrix.<locals>.<genexpr>c                 s   s   | ]\}}|V  qd S )Nr   r   r   r   r
   r   G   s     é   Zcsr)ÚnodelistÚformat)Zaxis)r   r   )ÚscipyZscipy.sparseÚlistÚsumÚnxZdegreeZto_scipy_sparse_arrayÚshapeÚsparseZ	csr_arrayZspdiagsZeye)
ÚGÚrr   Úspr   ÚAÚnÚmÚDÚIr   r   r
   r      s    94
&)NN)Ú__doc__Znetworkxr   Znetworkx.utilsr   Ú__all__r   r   r   r   r
   Ú<module>   s   