Stable Poisson Graphs in One Dimension
نویسندگان
چکیده
منابع مشابه
Stable Poisson Graphs in One Dimension
Let each point of a homogeneous Poisson process on R independently be equipped with a random number of stubs (half-edges) according to a given probability distribution μ on the positive integers. We consider two natural schemes for perfectly matching the stubs to obtain a simple graph with degree distribution μ, both derived from Gale-Shapley stable marriage. We prove results on the existence o...
متن کاملOn percolation in one-dimensional stable Poisson graphs
Equip each point x of a homogeneous Poisson point process P onR withDx edge stubs, where theDx are i.i.d. positive integer-valued random variables with distribution given by μ. Following the stable multi-matching scheme introduced by Deijfen, Häggström and Holroyd [1], we pair off edge stubs in a series of rounds to form the edge set of a graph G on the vertex set P. In this note, we answer que...
متن کاملBipartite Stable Poisson graphs on R
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 ν (μ). 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...
متن کاملSimulations of transport in one dimension
Advection-dispersion equation is solved in numerically by using combinations of differential quadrature method (DQM) and various time integration techniques covering some explicit or implicit single and multi step methods. Two different initial boundary value problems modeling conservative and nonconservative transports of some substance represented by initial data are chosen as test problems. ...
متن کاملSzeged Dimension and $PI_v$ Dimension of Composite Graphs
Let $G$ be a simple connected graph. In this paper, Szeged dimension and PI$_v$ dimension of graph $G$ are introduced. It is proved that if $G$ is a graph of Szeged dimension $1$ then line graph of $G$ is 2-connected. The dimensions of five composite graphs: sum, corona, composition, disjunction and symmetric difference with strongly regular components is computed. Also explicit formulas of Sze...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2011
ISSN: 1083-6489
DOI: 10.1214/ejp.v16-897