4 papers
Cascade Surviving Cores via Local Limits
Souvik Dhara, Manish Pandey, Leonard J. Schulman
We consider a general class of cascading processes on marked networks, in which vertices are iteratively deleted according to a local vertex property. Under marked local-weak conve…
Bringing order to network centrality measures
G. Exarchakos, R. van der Hofstad, O. Nagy +1
We introduce a quantitative method to compare arbitrary pairs of graph centrality measures, based on the ordering of vertices induced by them. The proposed method is conceptually s…
Are giants in random digraphs `almost' local?
Remco van der Hofstad, Manish Pandey
Recently, the first author showed that the giant in random undirected graphs is `almost' local. This means that, under a necessary and sufficient condition, the limiting proportion…
Communication protocol for a satellite-swarm interferometer
Oliver Nagy, Manish Pandey, Georgios Exarchakos +2
Orbiting low frequency antennas for radio astronomy (OLFAR) that capture cosmic signals in the frequency range below 30MHz could provide valuable insights on our Universe. These wi…