Random graph orders
نویسندگان
چکیده
Let Pn be the order determined by taking a random graph G on {l,2,...,n}, directing the edges from the lesser vertex to the greater (as integers), and then taking the transitive closure of this relation. We call such an ordered set a random graph order. We show that there exist constants c, and a, such that the expected height and set up number of Pn are sharply concentrated around en and cm respectively. We obtain the estimates: .565<c<.610, and .034<a<.289. We also discuss the width, dimension, and first-order properties of Pn. AMS (MOS) subject classifications (1985). Primary: 06A10 Secondary: 05C80, 60C05.
منابع مشابه
Searching in Random Partially Ordered Sets
We consider the problem of searching for a given element in a partially ordered set. More precisely, we address the problem of computing efficiently near-optimal search strategies for typical partial orders. We consider two classical models for random partial orders, the random graph model and the uniform model. We shall show that certain simple, fast algorithms are able to produce nearly-optim...
متن کاملCharacterization of projective special linear groups in dimension three by their orders and degree patterns
The prime graph $Gamma(G)$ of a group $G$ is a graph with vertex set $pi(G)$, the set of primes dividing the order of $G$, and two distinct vertices $p$ and $q$ are adjacent by an edge written $psim q$ if there is an element in $G$ of order $pq$. Let $pi(G)={p_{1},p_{2},...,p_{k}}$. For $pinpi(G)$, set $deg(p):=|{q inpi(G)| psim q}|$, which is called the degree of $p$. We also set $D(G):...
متن کاملA Local Limit Theorem for the Critical Random Graph
We consider the limit distribution of the orders of the k largest components in the Erdős-Rényi random graph inside the “critical window” for arbitrary k. We prove a local limit theorem for this joint distribution and derive an exact expression for the joint probability density function.
متن کاملEntropies of tailored random graph ensembles: bipartite graphs, generalized degrees, and node neighbourhoods
We calculate explicit formulae for the Shannon entropies of several families of tailored random graph ensembles for which no such formulae were as yet available, in leading orders in the system size. These include bipartite graph ensembles with imposed (and possibly distinct) degree distributions for the two node sets, graph ensembles constrained by specified node neighbourhood distributions, a...
متن کاملEntropies of tailored random graph ensembles: bipartite graphs, generalised degrees, and node neighbourhoods
We calculate explicit formulae for the Shannon entropies of several families of tailored random graph ensembles for which no such formulae were as yet available, in leading orders in the system size. These include bipartite graph ensembles with imposed (and possibly distinct) degree distributions for the two node sets, graph ensembles constrained by specified node neighbourhood distributions, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015