On a conditionally Poissonian graph process

By Ilkka Norros, Hannu Reittu. Advances in Applied Probability, 2006

240 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Large Cliques in a Power-Law Random Graph (2009, methodology): “The model and the results The model we study is a modification of the conditionally Poissonian random graph studied in [14] (the significance of this modification will be studied in Subsection 6.”
Novel scaling limits for critical inhomogeneous random graphs (2009, methodology): “The model in [31] is a random multigraph, that is, a random graph potentially having self-loops and multiple edges.”
Distances in Random Graphs with Finite Mean and Infinite Variance Degrees (2005, result): “In the latter case, the graph distance scales like log N log log N . A related model to the one studied here can also be found in [ 31 ], where a graph process is defined by adding and removing edges.”
Random Graphs and Complex Networks (2016, methodology): “A further adaptation is the so-called Poissonian random graph or Norros-Reittu model (introduced by Norros and Reittu (2006)), for which pij = p (NR) ij = 1− exp (−wiwj/`n) .”
Scale-free percolation (2011, unknown): “One example is the Poissonian random graph [29], where each vertex i in a set of n vertices is assigned a random weight Wi and two vertices i and j are then connected by an edge if a Poisson variable with mean WiWj/ ∑n k=1Wk takes on a positive value.”
First passage percolation on random graphs with finite mean degrees (2009, unknown): “Similar results have appeared for related models in [11, 16, 28].”