My Stud­i­en­arbeit is entitled Rank­ing and Import­ance in Com­plex Net­works.

Here you find files and links that are related to my “Stud­i­en­arbeit”. I wrote it in Irland at the Hamilton Insti­tute, NUI Maynooth, super­vised by Dr. Mason and Prof. Shorten.

You can down­load the Stud­i­en­arbeit in 3 dif­fer­ent versions:

Slides from the defense talk can be down­loaded here, as well as a video record­ing of the talk: 22.3 MB Quick­Time .mp4 or 43.6 MB XviD .avi

The data­sets that have been used in Chapter 5 can be found on the pages by Yu et al..

I also presen­ted a poster Pro­tein Inter­ac­tion Net­works — Essen­ti­al­ity and Sens­it­ivty at the CMSB06 — Inter­na­tional Con­fer­ence on Com­pu­ta­tional Meth­ods in Sys­tems Bio­logy 2006 which gives a short over­view of the work done in the thesis.

Finally, the Mat­lab func­tions writ­ten in con­junc­tion with the thesis. The files can be either down­loaded as a bundle, or seen below: ^^ col­lapse ^^ 

a2p.m
 
A2P  exports an adjacency matrix into Pajek file
 
adde.m
 
ADDE randomly add egdes to graph
 
adj2dist.m
 
ADJ2DIST  converts adjacency matrix to distance matrix
 
adj2inc.m
 
ADJ2INC  converts adjacency matrix to incidence matrix
 
adj2lap.m
 
ADJ2LAP  converts adjacency matrix to Laplacian matrix
 
attack.m
 
ATTACK  removes the n most connected nodes
 
avk.m
 
AVK  Calculates the average node degree k of a graph
 
avl.m
 
AVL  calculates the average path length
 
avld.m
 
AVLD  calculates the average path length
 
binomial.m
 
BINOMIAL  returns binomial coefficient
 
cc.m
 
CC  Calculates clustering coefficient
 
centroid.m
 
CENTROID  returns the centroid value of nodes or a graph
 
changed.m
 
CHANGED  returns the all the nodes that changed in some way
 
charg.m
 
CHARG  calculates characteristic values of a graph
 
damage.m
 
DAMAGE  returns the damage value of nodes
 
dd.m
 
DD  determines and displays the degree distribution of a network
 
diam.m
 
DIAM  calculates the network diameter and average path length
 
diamd.m
 
DIAMD  calculates the network diameter
 
er_reg_model.m
 
This function is run by  dd
 
excen.m
 
EXCEN  returns the excentricity of a node or radius of a graph
 
fastpr.m
 
FASTPR   Calculates simple Google PageRank using the adj. matrix
 
findnans.m
 
FINDNANS  find all NaN rows & cols
 
gen_er.m
 
GEN_ER  Generates a random graph of the Erdös-Renyi type
 
gen_er2.m
 
GEN_ER2  Generates a random graph of the Erdös-Renyi type
 
gen_sf.m
 
GEN_SF  Generates a scale-free network
 
gen_sw.m
 
GEN_SW  Generates a small world network
 
gen_sw2.m
 
GEN_SW2  Generates a small world network
 
golfrank.m
 
GOLFRANK  takes scores and returns a golf-style ranking
 
hits.m
 
HITS   Calculates auth.- and hub-scores with HITS
 
progress.m
 
PROGRESS  displays a very fancy work-in-progress indicator
 
radius.m
 
RADIUS  returns the radius of a graph
 
rggui.fig
 
Needed for rggui.m
 
rggui.m
 
RGGUI  GUI for random graph generation
 
rme.m
 
RME  randomly remove egdes from graph
 
rmn.m
 
RMN  randomly remove nodes from graph
 
rwe.m
 
RWE  randomly rewires egdes from graph
 
sf_reg_model.m
 
This function is run by  dd
 
slcc.m
 
SLCC  returns the size of the largest component
 
splitintocc.m
 
SPLITINTOCC  returns the adj. matrices of the connected components
 
status.m
 
STATUS  returns the status of a node or a graph
 
sw_reg_model.m
 
This function is run by  dd
 
topn.m
 
TOPN  determines the n most connected nodes
 
unpenalize.m
 
UNPENALIZE  undoes the penalizing done by adj2dist