NDLI: Centrality and mode detection in dynamic contact graphs; a joint diagonalisation approach

Content Provider	IEEE Xplore Digital Library
Author	Fay, D. Kunegis, J. Yoneki, E.
Copyright Year	2013
Description	Author affiliation: Sch. of Design Eng. & Comput., Bournemouth Univ., Bournemouth, UK (Fay, D.) \|\| Centre for Web studies, Univ. of Koblenz-Landau, Landau, Germany (Kunegis, J.) \|\| Comput. Lab., Univ. of Cambridge, Cambridge, UK (Yoneki, E.)
Abstract	This paper presents a technique for analysis of dynamic contact networks aimed at extracting periods of time during which the network changes behaviour. The technique is based on tracking the eigenvectors of the contact network in time (efficiently) using a technique called Joint Diagonalisation (JD). Repeated application of JD then shows that real-world networks naturally break into several modes of operation which are time dependent and in one real-world case, even periodic. This shows that a view of real-world contact networks as realisations from a single underlying static graph is mistaken. However, the analysis also shows that a small finite set of underlying static graphs can approximate the dynamic contact graphs studied.We also provide the means by which these underlying approximate graphs can be constructed. Core to the approach is the analysis of spanning trees constructed on the contact network. These trees are the routes a broadcast would take given a random starting location and we find that these propagation paths (in terms of their eigenvector decompositions) cluster into a small subset of modes which surprisingly correspond to clusters in time. The net result is that a dynamic network may be approximated as a (small finite) set of static graphs. Most interestingly the MIT dataset shows a periodic behaviour which allows us to know in advance which mode the network will be in. This has obvious consequences as individuals in the network take differing roles in differing modes. Finally, we demonstrate the technique by constructing a synthetic network with an 4 underlying modes of operation; creating synthetics contacts and then used JD to extract the original underlying modes.
Sponsorship	IEEE Comput. Soc.
Starting Page	41
Ending Page	48
File Size	14124757
Page Count	8
File Format	PDF
ISBN	9781450322409
DOI	10.1145/2492517.2492540
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-08-25
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	ACM and IEEE
Subject Keyword	Tensile stress Social network services Conferences Communities Generators Eigenvalues and eigenfunctions Joints
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Centrality and mode detection in dynamic contact graphs; a.

Centrality and mode detection in dynamic contact graphs; a joint diagonalisation approach

Fusion of disparate information through joint embeddings

RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs

Centrality Analysis, Role-Based Clustering, and Egocentric Abstraction for Heterogeneous Social Networks

Eigenvector centrality and its application in research professionals' relationship network

Dynamic communities in evolving network graphs

Eigenspace analysis for threat detection in social networks

Toward matched filter optimization for subgraph detection in dynamic networks

Centrality and mode detection in dynamic contact graphs; a joint diagonalisation approach

Similar Documents

Centrality and mode detection in dynamic contact graphs; a.

Centrality and mode detection in dynamic contact graphs; a joint diagonalisation approach

Fusion of disparate information through joint embeddings

RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs

Centrality Analysis, Role-Based Clustering, and Egocentric Abstraction for Heterogeneous Social Networks

Eigenvector centrality and its application in research professionals' relationship network

Dynamic communities in evolving network graphs

Eigenspace analysis for threat detection in social networks

Toward matched filter optimization for subgraph detection in dynamic networks

Centrality and mode detection in dynamic contact graphs; a joint diagonalisation approach