• Aucun résultat trouvé

Percolation by cumulative merging and phase transition for the contact process on random graphs

N/A
N/A
Protected

Academic year: 2021

Partager "Percolation by cumulative merging and phase transition for the contact process on random graphs"

Copied!
51
0
0

Texte intégral

Loading

Figure

Figure 1: Illustration of the heuristic. In dotted lines are the maximal distances attained by infections started from each of the vertices a, b, c and d
Figure 3: Some examples of oriented graph structures on the set of clusters. In each example the underlying graph is Z and α = 1
Figure 4: Examples of stable sets. Here G = Z and α = 1. The initial weights are displayed in grey above the line (black vertices are given weight 0)
Figure 5: Examples of stabilisers. The weighted graph is the same as in Figure 4. On the left, the stabilisers of each clusters inside the region are materialized by brackets
+7

Références

Documents relatifs

2014 A model based on second rank tensor orientational properties of smectic phases is developed.. The model predicts a second order smectic A-smectic C phase transition

A fragmentation occurs in the random permutation when a transposition occurs between two integers in the same σ-cycle, so tree components in the random graph correspond to cycles in

and [12] in a wave-front tracking scheme and prove that the obtained approximate solution u n converges (up to a subsequence) to a globally defined solution of the constrained

In this note, we prove a law of large numbers for an infinite chemical reaction network for phase transition problems called the stochastic Becker-Döring process.. Under a

We consider the contact process on the model of hyperbolic random graph, in the regime when the degree distribution obeys a power law with exponent χ ∈ (1, 2) (so that the

The dielectric strength and the critical frequency of the relaxation mechanisms connected with these two modes were obtained throughout the measurement temperature

We also say that the beta distribution with parameter β = −1 is the uniform distribution on the Euclidean sphere S d−1 ; this is justified by the fact that the beta distributions

Though, one remarks conditions of Theorem 2.6 are milder: one can actually show the existence of s 1 in a neater way, assume λ 2 > λ c : without transition ”2 → 3” in