相关论文: Erdos-Renyi random graphs + forest fires = self-or…

Lightning is a natural phenomenon that takes place all around the world. The enormous amount of energy released by lightning is extremely ruinous, so some suitable protection schemes are required for power systems to minimize its…

We consider random dynamics on a uniform random recursive tree with $n$ vertices. Successively, in a uniform random order, each edge is either set on fire with some probability $p_n$ or fireproof with probability $1-p_n$. Fires propagate in…

We report the sudden and spontaneous evolution of an initially correlated gas of repulsively interacting Rydberg atoms to an ultracold plasma. Under continuous laser coupling we create a Rydberg ensemble in the strong blockade regime, which…

Erdos-Renyi limit laws give the length scale of a time-window over which time-averages in Birkhoff sums have a non-trivial almost-sure limit. We establish Erdos-Renyi type limit laws for Holder observables on dynamical systems modeled by…

We introduce a process where a connected rooted multigraph evolves by splitting events on its vertices, occurring randomly in continuous time. When a vertex splits, its incoming edges are randomly assigned between its offspring and a…

Nodes in a complex networked system often engage in more than one type of interactions among them; they form a multiplex network with multiple types of links. In real-world complex systems, a node's degree for one type of links and that for…

We describe the construction of a conserved reaction-diffusion system that exhibits self-organized critical (avalanche-like) behavior under the action of a slow addition of particles. The model provides an illustration of the general…

Infectious disease remains, despite centuries of work to control and mitigate its effects, a major problem facing humanity. This paper reviews the mathematical modelling of infectious disease epidemics on networks, starting from the…

We study reaction-diffusion processes on graphs through an extension of the standard reaction-diffusion equation starting from first principles. We focus on reaction spreading, i.e. on the time evolution of the reaction product, M(t). At…

Consider a uniformly sampled random $d$-regular graph on $n$ vertices. If $d$ is fixed and $n$ goes to $\infty$ then we can relate typical (large probability) properties of such random graph to a family of invariant random processes (called…

We consider random graphs on the set of $N^2$ vertices placed on the discrete $2$-dimensional torus. The edges between pairs of vertices are independent, and their probabilities decay with the distance $\rho$ between these vertices as…

The generalised random graph contains $n$ vertices with positive i.i.d. weights. The probability of adding an edge between two vertices is increasing in their weights. We require the weight distribution to have finite second moments and…

A collection of graphs is called bridge-alterable if, for each graph G with a bridge e, G is in the class if and only if G-e is. For example the class of forests is bridge-alterable. For a random forest $F_n$ sampled uniformly from the set…

We show that the unsteadiness of turbulence has a drastic effect on turbulence parameters and in particle cluster formation. To this end we use direct numerical simulations of particle laden flows with a steady forcing that generates an…

In [18] we analysed a simple undirected random graph subject to constraints on the total number of edges and the total number of triangles. We considered the dense regime in which the number of edges per vertex is proportional to the number…

We show that large deviation properties of Erd\"os-R\'enyi random graphs can be derived from the free energy of the $q$-state Potts model of statistical mechanics. More precisely the Legendre transform of the Potts free energy with respect…

Complex evolving systems such as the biosphere, ecosystems and societies exhibit sudden collapses, for reasons that are only partially understood. Here we study this phenomenon using a mathematical model of a system that evolves under…

Scale-free networks are a recently developed approach to model the interactions found in complex natural and man-made systems. Such networks exhibit a power-law distribution of node link (degree) frequencies n(k) in which a small number of…

Random key graphs were introduced to study various properties of the Eschenauer-Gligor key predistribution scheme for wireless sensor networks (WSNs). Recently this class of random graphs has received much attention in contexts as diverse…

We study the structure of the load-based spanning tree (LST) that carries the maximum weight of the Erdos-Renyi (ER) random network. The weight of an edge is given by the edge-betweenness centrality, the effective number of shortest paths…