====== To do ======

[[tq:time:proj|project]]

  * elaborate the basic procedures for general temporal quantities with general time intervals
  * apply these indexes to real-life data (Franzosi, SN5)
  * betweenness centrality based on semiring from [[http://vlado.fmf.uni-lj.si/vlado/papers/SemiRingSNA.pdf|About semirings]]; closeness centrality; can the Brandes approach be used? [[http://www.tandfonline.com/doi/abs/10.1080/0022250x.2001.9990249#.U3CRcPmSw5M|2001]],[[http://www.sciencedirect.com/science/article/pii/S0378873307000731|2008]]
  * triad census - see [[http://www.sciencedirect.com/science/article/pii/S0378873398000069|Moody]]
  * temporal largest eigen-value / eigen-vector !? [[http://en.wikipedia.org/wiki/Power_iteration|power method]];[[http://en.wikipedia.org/wiki/Lanczos_algorithm|Lanczos]]; [[http://people.inf.ethz.ch/arbenz/ewp/|Arbenz]]
  * measures from [[http://www.stats.ox.ac.uk/~snijders/siena/|Siena]] ([[http://www.stats.ox.ac.uk/~snijders/siena/RSiena_Manual.pdf|manual from page 37-]] and [[http://statnet.csde.washington.edu/|Statnet/ERGM]] ; [[http://projecteuclid.org/download/pdfview_1/euclid.ejs/1276694116|TERGM]], [[http://www.sciencedirect.com/science/article/pii/S0378873310000183|Tore]]; [[http://simsoc.free.fr/|1]], [[http://simsoc.free.fr/ressources/articles/2011/SNAMAS2011.pdf|2]], [[http://simsoc.free.fr/ressources/articles/2011/ACFQS_Cason.pdf|3]]
  * temporal weak/strong components (reachability semiring) [[http://www-npa.lip6.fr/~whitbeck/publications/reachability_mobicom12_full.pdf|paper]]; W = (A+A<sup>T</sup>)<sup>*</sup>; S = A<sup>*</sup> ⋂ (A<sup>*</sup>)<sup>T</sup>
    * transforming temporal equivalence into a partition
      * multiply matrix with 1:n or random diagonal - equivalent nodes get the same value; if necessary repeat; intersections. Analysis of evolution.
      * can Union-find algorithm be used?   
  * temporal cores; [[http://www.springerlink.com/content/c6472216637p57w4/|paper]]
  * temporal patterns [[http://www.pnas.org/content/110/45/18070.full.pdf+html|PNAS]]
  * accumulative values / differential values
  * add symmetric attribute and representation of symmetric matrices with triangular matrices [ [a11], [a21,a22], [a31,a32,a33], ...] and adapt the corresponding procedures.
  * which procedures can be efficiently implemented for large networks?
  * can the approach be extended to temporal networks with non-zero latency?
  * clustering/blockmodeling of temporal networks

===== Details =====
==== Usklajevanje razbitij ====

21.4.2014:
Ustvari za vozlišča pare (št. v razbitju 1, št. v razbitju 2) in jih uredi v padajočem vrstnem redu glede na pogostost. Najpogostejši pari prenesejo številko (če je še prosta) iz razbitja 1 na razbitje 2.

  * Vozlišča iz istega razreda imajo enake vrstične vsote v A.v . Za v je najbrž smiselno izbrati slučajno permutacijo 1:n , tako da se izognemo odvisnostim zaradi številčenja po sosedih.
  * Za preverjanje pravilnosti razbitja zadostuje, da za vsako skupino izberemo eno vozlišče in preverimo ali je povezano z ostalimi iz razreda.