Random Oxford Graphs
نویسندگان
چکیده
Inspired by a concept in comparative genomics, we investigate properties of randomly chosen members of G1(m,n, t), the set of bipartite graphs with m left vertices, n right vertices, t edges, and each vertex of degree at least one. We give asymptotic results for the number of such graphs and the number of (i, j) trees they contain. We compute the thresholds for the emergence of a giant component and for the graph to be connected.
منابع مشابه
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
Recent results establish for the hard-core model (and more generally for 2-spin antifer-romagnetic systems) that the computational complexity of approximating the partition func-tion on graphs of maximum degree ∆ undergoes a phase transition that coincides with theuniqueness/non-uniqueness phase transition on the infinite ∆-regular tree. For the ferromag-netic Potts model we...
متن کاملThe shortest distance in random multi-type intersection graphs
Using an associated branching process as the basis of our approximation, we show that typical inter-point distances in a multi-type random intersection graph have a defective distribution, which is well described by a mixture of translated and scaled Gumbel distributions, the missing mass corresponding to the event that the vertices are not in the same component of the graph. © 2010 Wiley Perio...
متن کاملRandom Graphs with Few Disjoint Cycles
The classical Erdős-Pósa theorem states that for each positive integer k there is an f(k) such that, in each graph G which does not have k + 1 disjoint cycles, there is a blocker of size at most f(k); that is, a set B of at most f(k) vertices such that G − B has no cycles. We show that, amongst all such graphs on vertex set {1, . . . , n}, all but an exponentially small proportion have a blocke...
متن کاملOptimizing DSP flow graphs via schedule-based multidimensional retiming
[5] J. P. Hoyt, “A simple approximation to the standard normal probability density function,” Amer. Statist., pp. 25-26, Apr. 1968. (See also H. Jeffreys, Theory of Probability, 2nd ed. Oxford Oxford Univ. Press, 1948, p. 86). [6] M. D. Springer and W. E. Thompson, “The distribution of products of independent random variables,” TR64-46, Gen. Motors Defense Research Lab., Aug. 1964. [7] S. A. Ka...
متن کاملLaws of Large Numbers of Subgraphs in Directed Random Geometric Networks
Given independent random points Xn = {X1, · · · , Xn} in R, drawn according to some probability density function f on R, and a cutoff rn > 0 we construct a random geometric digraph G(Xn,Yn, rn) with vertex set Xn. Each vertex Xi is assigned uniformly at random a sector Si, of central angle α with inclination Yi, in a circle of radius rn (with vertex Xi as the origin). An arc is present from Xi ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004