4   Artículos

 
en línea
Caterina Fenu, Lothar Reichel and Giuseppe Rodriguez    
Identifying the most important nodes according to specific centrality indices is an important issue in network analysis. Node metrics based on the computation of functions of the adjacency matrix of a network were defined by Estrada and his collaborators... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Diego Granziol, Binxin Ru, Xiaowen Dong, Stefan Zohren, Michael Osborne and Stephen Roberts    
We propose an alternative maximum entropy approach to learning the spectra of massive graphs. In contrast to state-of-the-art Lanczos algorithm for spectral density estimation and applications thereof, our approach does not require kernel smoothing. As t... ver más
Revista: Algorithms    Formato: Electrónico

« Anterior     Página: 1 de 1     Siguiente »