activity
20072026
most citedGenerating simple random graphs with prescribed degree distribution

321 citations · 452 across the 34 of their papers we have counts for

collaborators
Showing 2015Show all

13 papers · 1 filter

math.PR2015

Random networks with preferential growth and vertex death

Maria Deijfen

A dynamic model for a random network evolving in continuous time is defined where new vertices are born and existing vertices may die. The fitness of a vertex is defined as the acc…

physics.soc-ph2015★ 23 cited

Growing networks with preferential addition and deletion of edges

Maria Deijfen, Mathias Lindholm

A preferential attachment model for a growing network incorporating deletion of edges is studied and the expected asymptotic degree distribution is analyzed. At each time step $t=1…

math.PR2015

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

Maria Deijfen

Let be the points of a Poisson process on and a probability distribution with support on the non-negative integers. Models are formulated for gen…

math.PR2015

Random intersection graphs with tunable degree distribution and clustering

Maria Deijfen, Willemien Kets

A random intersection graph is constructed by assigning independently to each vertex a subset of a given set and drawing an edge between two vertices if and only if their respectiv…

math.PR2015

The pleasures and pains of studying the two-type Richardson model

Maria Deijfen, Olle Häggström

This paper provides a survey of known results and open problems for the two-type Richardson model, which is a stochastic model for competition on . In its simplest fo…

math.PR2015

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

Maria Deijfen, Johan Jonasson

Let be a probability distribution with support on the non-negative integers. A model is proposed for generating stationary simple graphs on with degree distributio…

math.PR2015

Generating stationary random graphs on with prescribed i.i.d.\ degrees

Maria Deijfen, Ronald Meester

Let be a probability distribution with support on the non-negative integers. Two algorithms are described for generating a stationary random graph, with vertex set …

math.PR2015★ 321 cited

Generating simple random graphs with prescribed degree distribution

Tom Britton, Maria Deijfen, Anders Martin-Löf

Let be a probability distribution with support on the non-negative integers. Four methods for generating a simple undirected graph with (approximate) degree distribution ar…

math.PR2015

Nonmonotonic coexistence regions for the two-type Richardson model

Maria Deijfen, Olle Häggström

In the two-type Richardson model on a graph , each vertex is at a given time in state , or . A flips to a (resp.\ ) at r…

math.PR2015

Coexistence in a two-type continuum growth model

Maria Deijfen, Olle Häggström

We consider a stochastic model, describing the growth of two competing infections on . The growth takes place by way of spherical outbursts in the infected region, an…

math.PR2015

The initial configuration is irrelevant for the possibility of mutual unbounded growth in the two-type Richardson model

Maria Deijfen, Olle Häggström

The two-type Richardson model describes the growth of two competing infections on . At time 0 two disjoint finite sets are infected with…

math.PR2015

A stochastic model for competing growth on

Maria Deijfen, Olle Häggström, Jonathan Bagley

A stochastic model, describing the growth of two competing infections on , is introduced. The growth is driven by outbursts in the infected region, an outburst in the…

math.PR2015

Asymptotic shape in a continuum growth model

Maria Deijfen

A continuum growth model is introduced. The state at time , , is a subset of and consists of a connected union of randomly sized Euclidean balls, which emerg…