6:45 – 4:45 ASRC
- Continuing Opinion Dynamics With Decaying Confidence: Application to Community Detection in Graphs. Details here.
- Bubbles at scales? “Stability measures the quality of a partition by giving a positive contribution to communities from which a random walker is unlikely to escape within the given time scale. For small values of t, this gives more weights to small communities whereas for larger values of t , larger communities are favored. Thus, by searching the partitions maximizing the stability for several values of , one can detect communities at several scales.“
- The algebraic connectivity of a graph G is the second-smallest eigenvalue of the Laplacian matrix of G
- Data sources for the paper:
- More NMF
P = [[ 0.67503659 0.89795272] [ 0.36939303 0.47816356] [ 0.51019257 0.27772317] [ 0.1130504 0.84860109] [ 0.23238542 0.88222005]] Q = [[ 0.36692407 0.6844149 ] [ 0.84469693 0.06331073] [ 0.07366106 0.06603799] [ 0.65677669 0.16947152]] nP = [[ 0.16286496 2.42456084] [ 0.21647521 1.83981127] [ 1.9047257 0.39049035] [ 1.52103295 0.33509559] [ 1.41350212 1.51711067]] nQ = [[ 0.15875994 2.09665688] [ 0.08334172 1.04818927] [ 1.16320811 2.09280482] [ 2.56431807 0.24424636]] nQt = [[ 0.15875994 0.08334172 1.16320811 2.56431807] [ 2.09665688 1.04818927 2.09280482 0.24424636]] R = [[5 3 0 1] [4 0 0 1] [1 1 0 5] [1 0 0 4] [0 1 5 4]] nR = [[ 5.10932861 2.55497211 5.26357846 1.00982771] [ 3.89182055 1.94651185 4.10217161 1.00447849] [ 1.12111842 0.56805092 3.03281247 4.97969837] [ 0.94405957 0.4780091 2.47056752 3.98225815] [ 3.40526805 1.70802283 4.81921366 3.99521777]]
- Hard coded the random values for gradient descent to compare python and java
- Stepping h
- Sprint stuff?
- Scrum
- Sent Jeremy the svn file names for my Vistronix code
- Fika
- Meeting with Wayne? Basic catching up. started the spreadsheet of conferences and grants
viztales 