EUDML

The search session has expired. Please query the service again.

Currently displaying 1 – 4 of 4

Order by Relevance | Title | Year of publication

Stationary random graphs with prescribed iid degrees on a spatial Poisson process.

Deijfen, Maria — 2009

Electronic Communications in Probability [electronic only]

Scale-free percolation

Maria Deijfen; Remco van der Hofstad; Gerard Hooghiemstra — 2013

Annales de l'I.H.P. Probabilités et statistiques

We formulate and study a model for inhomogeneous long-range percolation on $ℤ^{d}$ . Each vertex $x \in ℤ^{d}$ is assigned a non-negative weight $W_{x}$ , where ${(W_{x})}_{x \in ℤ}^{d}$ are i.i.d. random variables. Conditionally on the weights, and given two parameters $α, λ g t; 0$ , the edges are independent and the probability that there is an edge between $x$ and $y$ is given by $p_{x y} = 1 - exp {- λ W_{x} W_{y} {/ | x - y |}^{α}}$ . The parameter $λ$ is the percolation parameter, while $α$ describes the long-range nature of the model. We focus on the degree distribution in the resulting graph, on whether there...

Nonmonotonic coexistence regions for the two-type Richardson model on graphs.

Deijfen, Maria; Häggström, Olle — 2006

Electronic Journal of Probability [electronic only]

Stationary random graphs on $ℤ$ with prescribed iid degrees and finite mean connections.

Deijfen, Maria; Jonasson, Johan — 2006

Electronic Communications in Probability [electronic only]

Page 1

Download Results (CSV)

Advanced Search

Formula preview

Currently displaying 1 – 4 of 4

Stationary random graphs with prescribed iid degrees on a spatial Poisson process.

Scale-free percolation

Nonmonotonic coexistence regions for the two-type Richardson model on graphs.

Stationary random graphs on $ℤ$ with prescribed iid degrees and finite mean connections.

Advanced Search

Formula preview

Currently displaying 1 – 4 of 4

Stationary random graphs with prescribed iid degrees on a spatial Poisson process.

Scale-free percolation

Nonmonotonic coexistence regions for the two-type Richardson model on graphs.

Stationary random graphs on ℤ with prescribed iid degrees and finite mean connections.

Stationary random graphs on $ℤ$ with prescribed iid degrees and finite mean connections.