Maria Deijfen

Research fellow

Department of Mathematics
Stockholm University
106 91 Stockholm

Phone: +46(0)8 16 4591
E-mail: mia

math.su.se

Spring 2010

Microsoft research, Feb 1-12, Seattle.
Probability, random trees and algorithms, March 8-12, Eurandom.
10th Vilnius conference on probability and mathematical statistics, June 28 - July 2, Vilnius.
Networks: applications and modeling, July 4-8, Öregrund.

Background

I received my PhD from Stockholm University in December 2003 and 2004--2006 I was a postdoc at Institute Mittag-Leffler, Vrije Universiteit Amsterdam, Chalmers and Eurandom. Since August 2006 I have held a research position funded by the Swedish Research Council based at Stockholm University.

Research interests

Discrete probability theory with particular emphasis on interacting particle systems and random graphs.

Publications and preprints

Percolation in invariant Poisson graphs with iid degrees,, with O.Häggström and A.Holroyd, submitted.
Random networks with preferential growth and vertex death in continuous time, submitted.
On the speed of biased random walk in translation invariant percolation, with O.Häggström, submitted.
Growing networks with preferential deletion and addition of edges, with M.Lindholm, Phys. A 388, 4297-4303.
Stationary random graphs with prescribed iid degrees on a spatial Poisson process, Electr. Comm. Probab. 14, 81-89.
Epidemics on random graphs with tunable clustering, with T.Britton, A.Lagerås and M.Lindholm, J. Appl. Probab. 45:1, 743-756.
The pleasures and pains of studying the two-type Richardson model, with O.Häggström, in Analysis and Stochastics of Growth Processes and Interface Models (eds. P.Mörters, R.Moser, M.Penrose, H.Schwetlick and J.Zimmer), Oxford University Press, pp 39-54.
Random intersection graphs with tunable degree distribution and clustering, with W.Kets, Probab. Eng. Inform. Sci. 23, 661-674.
A preferential attachment model with random initial degrees, with H.van den Esker, R.van der Hofstad and G.Hooghiemstra, Ark. Mat. 47:1, 41-72.
The two-type Richardson model with unbounded initial configurations, with O.Häggström, Ann. Appl. Probab. 17:5, 1639-1656.
Stationary random graphs on Z with prescribed iid degrees and finite mean connections, with J.Jonasson, Electr. Comm. Probab. 11, 336-346.
Generating simple random graphs with prescribed degree distribution, with T.Britton and A.Martin-Löf, J. Stat. Phys. 124:6, 1377-1397.
Generating stationary random graphs on Z with prescribed iid degrees, with R. Meester, Adv. Appl. Probab. 38:2, 287-298.
Nonmonotonic coexistence regions for the two-type Richardson model on graphs, with O.Häggström, Electr. J. Probab. 11, 331--344.
Epidemispridning på sociala grafer (in Swedish), Normat 52:3, 122-136. See also my masters thesis Epidemics on social network graphs.
Coexistence in a two-type continuum growth model, with O.Häggström, Adv. Appl. Probab. 36:4, 973-980.
The initial configuration is irrelevant for the possibility of mutual unbounded growth in the two-type Richardson model, with O.Häggström, Comb. Probab. Comp. 15:3, 345-353.
A stochastic model for competing growth on R^d, with O.Häggström and J.Bagley, Markov Proc. Rel. Fields 10:2, 217-248.
Asymptotic shape in a continuum growth model, Adv. Appl. Probab. 35:2, 303-318.