two local connections convolutions but that means that you have to go very deep in order to make long range connections you can't just make them in one step the same problem right here now this paper big bird argued that if you have random connections instead of neighborhood connections just the property of random graphs mean that um you you are pretty fast in sending information around so because in a random graph of size n you on average all two nodes are connected by path lengths of log n this is much faster