Download All

No BSD License  

Highlights from
getOdC

Be the first to rate this file! 0 Downloads (last 30 days) File Size: 775 Bytes File ID: #22761
image thumbnail

getOdC

by Santiago Balestrini

 

22 Jan 2009 (Updated 22 Jan 2009)

Computes the Off-Diagonal Complexity as defined by J.C. Claussen.

| Watch this File

File Information
Description

Based on Physica A 375 (2007) 365–373.

'g' must be the adjacency matrix of the graph of interest.

It has not been verified because the Helicobacter pylori protein interaction graph used as the example in the article could not be obtained.
MATLAB release MATLAB 7.6 (R2008a)
Tags for This File  
Everyone's Tags
Tags I've Applied
Add New Tags Please login to tag files.
Please login to add a comment or rating.
Updates
22 Jan 2009

Now any non-zero value in 'g' is made one. Preallocated 'a' for speed. Corrected the citation of the original article by Claussen in the commented header.
Tag Activity for this File
Tag Applied By Date/Time
claussen Cristina McIntire 22 Jan 2009 16:00:29
offdiagonal complexity Cristina McIntire 22 Jan 2009 16:00:29
mathematics Santiago Balestrini 22 Jan 2009 16:15:49
graph theory Santiago Balestrini 22 Jan 2009 16:15:49
complexity Santiago Balestrini 22 Jan 2009 16:15:49
claussen Santiago Balestrini 22 Jan 2009 17:18:29
offdiagonal complexity Santiago Balestrini 22 Jan 2009 17:18:30

Contact us at files@mathworks.com