301 | Tina Eliassi-Rad on Al, Networks, and Epistemic Instability

1361.234 - 1388.284 Tina Eliassi-Rad

And how many new edges do I have to add or remove to make it look like the other graph? And then try to solve the computationally hard problem of isomorphism. In fact, alignment, right? And in many cases, you don't need alignment, right? So, for example, you can think about two networks and you have started a process of information diffusion on it, like you started a rumor, let's say, right?