Spectral Plot Properties: Qualitative Classification of Networks
author: Anirban Banerjee,
Max Planck Institute for Mathematics in the Sciences, Max Planck Institute
published: Dec. 14, 2007, recorded: October 2007, views: 2942
published: Dec. 14, 2007, recorded: October 2007, views: 2942
Slides
Related content
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
We introduce a tentative classification scheme for empirical networks based on global qualitative properties detected through the spectrum of the Laplacian of the graph underlying the network. Our method identifies several distinct types of networks across different domains of applications, indicates hidden regularity properties and provides evidence for processes like node duplication behind the evolution or construction of a given class of networks.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Write your own review or comment: