Change search
Refine search result
1 - 5 of 5
Cite
Citation style
• apa
• ieee
• modern-language-association-8th-edition
• vancouver
• Other style
More styles
Language
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Other locale
More languages
Output format
• html
• text
• asciidoc
• rtf
Rows per page
• 5
• 10
• 20
• 50
• 100
• 250
Sort
• Standard (Relevance)
• Author A-Ö
• Author Ö-A
• Title A-Ö
• Title Ö-A
• Publication type A-Ö
• Publication type Ö-A
• Issued (Oldest first)
• Created (Oldest first)
• Last updated (Oldest first)
• Disputation date (earliest first)
• Disputation date (latest first)
• Standard (Relevance)
• Author A-Ö
• Author Ö-A
• Title A-Ö
• Title Ö-A
• Publication type A-Ö
• Publication type Ö-A
• Issued (Oldest first)
• Created (Oldest first)
• Last updated (Oldest first)
• Disputation date (earliest first)
• Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
• 1.
Stockholm University, Faculty of Science, Department of Mathematics.
Stockholm University, Faculty of Science, Department of Mathematics.
Bipartite Stable Poisson Graphs on R2012In: Markov processes and related fields, ISSN 1024-2953, Vol. 18, no 4, p. 583-594Article in journal (Refereed)

Let red and blue points be distributed on R according to two independent Poisson processes R and B and let each red (blue) point independently be equipped with a random number of half-edges according to a probability distribution nu (mu). We consider translation-invariant bipartite random graphs with vertex classes defined by the point sets of R, and B, respectively, generated by a scheme based on the Gale - Shapley stable marriage for perfectly matching the half-edges. Our main result is that, when all vertices have degree 2, then the resulting graph almost surely does not contain an infinite component. The two-color model is hence qualitatively different from the one-color model, where Deijfen, Holroyd and Peres have given strong evidence that there is an infinite component. We also present simulation results for other degree distributions.

• 2.
Stockholm University, Faculty of Science, Department of Mathematics.
A note on the coexistence times for two competing SIS epidemicsManuscript (preprint) (Other academic)

The stochastic SIS logistic epidemic process is a well-known continuous-time Markov chain with finite state space, describing the spread of an epidemic in a homogeneously mixing  population of size N. This process  eventually reaches an absorbing state (extinction'') and its extinction time is well-understood.  Namely, we can identify a phase transition depending on the infectious rate of the epidemic. There is a \textit{subcritical} phase where the process goes extinct in  time $O_{P}(\log N)$, and a \textit{supercritical} phase where the extinction time grows exponentially in the population size. In this work we consider two SIS epidemics with distinct supercritical infectious rates competing under cross-immunity, i.e. during its infectious period an infective individual is immune to the other infection. We show that with high probability the process with the lower infectious rate dies out first and the two epidemics coexist for a time that is $O_{P}(\log N)$. Furthermore, we conjecture the limiting distribution of the coexistence time.

• 3.
Stockholm University, Faculty of Science, Department of Mathematics.
Invariant Bipartite Random Graphs on Rd2014In: Journal of Applied Probability, ISSN 0021-9002, E-ISSN 1475-6072, Vol. 51, no 3, p. 769-779Article in journal (Refereed)

Suppose that red and blue points occur in R d according to two simple point processes with finite intensities λ R and λ B , respectively. Furthermore, let ν and μ be two probability distributions on the strictly positive integers with means ν̅ and μ̅, respectively. Assign independently a random number of stubs (half-edges) to each red (blue) point with law ν (μ). We are interested in translation-invariant schemes for matching stubs between points of different colors in order to obtain random bipartite graphs in which each point has a prescribed degree distribution with law ν or μ depending on its color. For a large class of point processes, we show that such translation-invariant schemes matching almost surely all stubs are possible if and only if λ R ν̅ = λ B μ̅, including the case when ν̅ = μ̅ = ∞ so that both sides are infinite. Furthermore, we study a particular scheme based on the Gale-Shapley stable marriage problem. For this scheme, we give sufficient conditions on ν and μ for the presence and absence of infinite components. These results are two-color versions of those obtained by Deijfen, Holroyd and Häggström.

• 4.
Stockholm University, Faculty of Science, Department of Mathematics.
Spatial Marriage Problems and Epidemics2014Doctoral thesis, comprehensive summary (Other academic)

This thesis consists of four papers covering three different topics on the modeling of large real networks and phenomena thereon. In Papers I and II, we propose and study the properties of a bipartite version of the model introduced by Deijfen, Holroyd and Häggström for generating translation-invariant spatial random graphs with prescribed degree distribution. In particular, we focus our attention on spatial random graphs generated by a matching scheme based on the Gale-Shapley stable marriage problem. In paper III, we propose a random graph model for generating edge-weighted graphs with prescribed degree and weight distributions, and tunable degree-degree correlation. We then study a simple inhomogeneous epidemic model on such graphs, where the infection probabilities are functions of the edge-weights, and investigate how the epidemic threshold is affected by the degree-degree correlation. In paper IV, we study a simple stochastic model aimed at representing a competition between two virus strains in a population. A longstanding principle in ecology known as the competitive exclusion principle predicts that when one of the strains has even the slightest advantage over the other, the one with the advantage will either drive the competitor to extinction or lead to a transformation in the ecological niche. We investigate how long it will take for the strain to drive its competitor to extinction.

• 5.
Stockholm University, Faculty of Science, Department of Mathematics.
Epidemics on a weighted network with tunable degree-degree correlation2014In: Mathematical Biosciences, ISSN 0025-5564, E-ISSN 1879-3134, Vol. 253, p. 40-49Article in journal (Refereed)

We propose a weighted version of the standard configuration model which allows for a tunable degree-degree correlation. A social network is modeled by a weighted graph generated by this model, where the edge weights indicate the intensity or type of contact between the individuals. An inhomogeneous Reed-Frost epidemic model is then defined on the network, where the inhomogeneity refers to different disease transmission probabilities related to the edge weights. By tuning the model we study the impact of different correlation patterns on the network and epidemics therein. Our results suggest that the basic reproduction number R-0 of the epidemic increases (decreases) when the degree-degree correlation coefficient rho increases (decreases). Furthermore, we show that such effect can be amplified or mitigated depending on the relation between degree and weight distributions as well as the choice of the disease transmission probabilities. In addition, for a more general model allowing additional heterogeneity in the disease transmission probabilities we show that rho can have the opposite effect on R-0.

1 - 5 of 5
Cite
Citation style
• apa
• ieee
• modern-language-association-8th-edition
• vancouver
• Other style
More styles
Language
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Other locale
More languages
Output format
• html
• text
• asciidoc
• rtf