Stationary random graphs on with prescribed iid degrees and finite mean connections.
Deijfen, Maria, Jonasson, Johan (2006)
Electronic Communications in Probability [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Stationary random graphs with prescribed iid degrees on a spatial Poisson process.”
Stationary random graphs on with prescribed iid degrees and finite mean connections.
The largest component in an inhomogeneous random intersection graph with clustering.
Bloznelis, Mindaugas (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on the component structure in random intersection graphs with tunable clustering.
Lagerås, Andreas N., Lindholm, Mathias (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Encores on cores.
Cain, Julie, Wormald, Nicholas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Poisson matching
Alexander E. Holroyd, Robin Pemantle, Yuval Peres, Oded Schramm (2009)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
Suppose that red and blue points occur as independent homogeneous Poisson processes in ℝ. We investigate translation-invariant schemes for perfectly matching the red points to the blue points. For any such scheme in dimensions =1, 2, the matching distance from a typical point to its partner must have infinite /2th moment, while in dimensions ≥3 there exist schemes where has finite exponential moments. The Gale–Shapley stable marriage is one natural matching scheme, obtained by iteratively...
Component evolution in random intersection graphs.
Behrisch, Michael (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On percolation in random graphs with given vertex degrees.
Janson, Svante (2009)
Electronic Journal of Probability [electronic only]
Similarity:
Poisson trees, succession lines and coalescing random walks
P. A. Ferrari, C. Landim, H. Thorisson (2004)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
Poisson convergence of numbers of vertices of a given degree in random graphs
Wojciech Kordecki (1996)
Discussiones Mathematicae Graph Theory
Similarity:
The asymptotic distributions of the number of vertices of a given degree in random graphs, where the probabilities of edges may not be the same, are given. Using the method of Poisson convergence, distributions in a general and particular cases (complete, almost regular and bipartite graphs) are obtained.
Degree distributions in general random intersection graphs.
Shang, Yilun (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Random matching problems on the complete graph.
Wästlund, Johan (2008)
Electronic Communications in Probability [electronic only]
Similarity: