Saturday, July 23, 2022

Chainlinks, CyberGAN, Graph link prediction in computer networks

Hey guys,

Some of my readers have missed me. I have been superbusy. Here is a short blog -

1. I like Chainlink as a blockchain infrastructure. Eric Schmidt has invested in it heavily. Optimization of verification system in a very cost effective way is something Chainlink is really good at. 

A good network science algorithm with strong non zero sum game algo, rock solid cybersecurity system and lot of B2B applications.

2. For basics, one paper which chainlink fellows might like is by Sanna Passino, Turcotte Mellissa et.
Graph link prediction in computer networks using Poisson matrix factorisation ( https://spiral.imperial.ac.uk/handle/10044/1/89018 ) for its algorithm for cybersecurity. Off course, CyberGANs are much better suited for such projects :) 

Something, the ChainLinks fellows program should think about. 

3. Ideally, There can be ensemble of ColombGAN & CyberGAN to achieve good convergence in the model. 

Lot to come later. 





Saturday, July 9, 2022

busy in emergencies but ignored topic - NS & Information geometry

 Since lack of time & busy in emergencies…. This is one of my unpublished articles I wrote in 2013. Some datahulk fans might like it. Should be read along with the new paper The Computational Challenge of Amartya Sen’s Social Choice Theory in Formal Philosophy https://www.researchgate.net/publication/339022300_The_Computational_Challenge_of_Amartya_Sen's_Social_Choice_Theory_in_Formal_Philosophy

(Blockchain missing from the paper which could have been a huge help)


Coming back to 2013 -

Predicting virality social media messages through NavierStokes (node2vec & confusion2Vec we’re not algorithms yet)… Also I am not setting up a game & Nash entropy between stubborn & non-stubborn players…before Facebook’s work on mechanism design for social good….. not any GANs.. No CurvGAN, No TopologyGAN also not using Ricci flow ( https://youtu.be/z_pjsJisdHQ  )but Gibb’s energy & Navier Stokes in information geometry in a very very simple English…. 

Assume that information flows through the social networks. Information flow through social networks can be measured in terms of Gibbs entropy. When it comes to complex networks, information flow can be measured in terms of nash entropy or Perelman entropy. Now, is there connection between Shannon entropy and navier stokes equation?

About Navier Stokes 

Waves follow our boat as we meander across the lake, and turbulent air currents follow our flight in a modern jet. Mathematicians and physicists believe that an explanation for and the prediction of both the breeze and the turbulence can be found through an understanding of solutions to the Navier-Stokes equations. Although these equations were written down in the 19th Century, our understanding of them remains minimal. The challenge is to make substantial progress toward a mathematical theory which will unlock the secrets hidden in the Navier-Stokes equations.

Turbulence in social networks – Whenever a social media campaign is run, the turbulence and push of the information is created in specific nodes of social networks and information flows through the pipes connecting different nodes. Can we identify which nodes the information will flow through and calculate the turbulence which we call as social buzz created by the campaign? It is highly possible. 

1. The way fluid changes its properties get changed when pressure and temperature is changed in the fluid system. Fluid can be lost to some extend during the curvature of the flow etc. 
2. Similar way, when information flow is pushed through different nodes of the social media or social network, information fluid changes its properties. The information message can miss few bits of information while getting forwarded. 





 

Combining all three formulas, depending on your initial node, we can calculate through which nodes information will flow at what viscosity and velocity and identify whether your post/message on facebook or twitter will go viral or not.

We can also calculate which nodes (nano influencers) are supposed to be tapped in order to make your post viral and identify natural pockets where information can be fed from where there will be free fluid flow and your message can reach millions.

This exercise is very specific to the node from which you are sending the information in social network, what is your message about and the surrounding nodes/social media profiles to your node or social media profile. Also how distant are the natural pockets/nodes which can distribute your information effectively and the pressure required from social media campaign to push your message or information flow to these nodes.


References:

1. Entropy density of spacetime and the Navier-Stokes fluid dynamics of null surfaces - http://arxiv.org/abs/1012.0119
2. Stability Result for Navier–Stokes Equations with Entropy Transport - http://link.springer.com/article/10.1007%2Fs00021-015-0205-x
3. Entropy measures for complex networks: Toward an information theory of complex topologies - http://arxiv.org/abs/0907.1514
4. On Maximizing the Entropy of Complex Networks - http://www.sciencedirect.com/science/article/pii/S1877050911003875

 





Thursday, July 7, 2022

Next Post- Thank you & DeepWalk

 Hey guys,

Thank you for showering congratulations on me predicting field prize do accurately. And my Ricci Flow video. 



You can see my ensemble here including Swarm Intelligence & Ant colony optimization - https://researchcircle.blogspot.com/2021/12/graph-mining-network-science-topology.html?m=1 

I am going to write new blog on Deepwalk, Quantum walk in social networks, Yang mills, TopologyGAN, ColombGAN, Ricci Flow, very soon. And also on blockchain analytics, GANs in hybrid clinical trials and lot of other things  

I have been superbusy with lot of work, emergencies, and tons of other things. 

For now please feel free to read this primer on DeepWalk from IIT Roorkeehttps://dsgiitr.com/blogs/deepwalk/ 

But, afterall DataHulk in me never takes rest 😉