Logo del repository
  1. Home
 
Opzioni

Social Networks Comparison by Using Laplacian Matrix and Euclidean Commute Time Distance

DE STEFANO, DOMENICO
2008
  • conference object

Abstract
The presented paper deals with the comparison between two social networks with the same set V of actors. The main purpose is to develop an exploratory strategy to investigate the relational differences (or similarities) between networks. Markov Chain on graph is used in order to introduce a special euclidean node-distance function. This distance is computed by means of the laplacian matrix L. The procedure generates for each of the two networks a distance matrix Δk (k = 1,2). differences are detected by projecting these matrices in a common and more parsimonious Euclidean space obtained by a multidimensional scaling and a procrustes analysis.
Archivio
http://hdl.handle.net/11368/2335238
Diritti
metadata only access
Soggetti
  • Laplacian Matrix

  • Markov Chain on Graph...

  • Social Network Compar...

  • Graph Theory

Visualizzazioni
1
Data di acquisizione
Apr 19, 2024
Vedi dettagli
google-scholar
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your nstitution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Realizzato con Software DSpace-CRIS - Estensione mantenuta e ottimizzata da 4Science

  • Impostazioni dei cookie
  • Informativa sulla privacy
  • Accordo con l'utente finale
  • Invia il tuo Feedback