English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We study the cascading traffic jamming on a two-dimensional random geometricgraph using the Motter and Lai model. The traffic jam is caused by a localizedattack incapacitating circular region or a line of a certain size, as well as adispersed attack on an equal number of randomly selected nodes. We investigateif there is a critical size of the attack above which the network becomescompletely jammed due to cascading jamming, and how this critical size dependson the average degree $\langle k\rangle$ of the graph, on the number of nodes$N$ in the system, and the tolerance parameter $\alpha$ of the Motter and Laimodel.

Cascading traffic jamming in a two-dimensional Motter and Lai model