Random Oxford graphs
Copyright policy )Random Oxford graphs
Inspired by a concept in comparative genomics, we investigate properties of randomly chosen members of G_1(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.
- Princeton University United States
- Cornell University United States
- College of New Jersey United States
Statistics and Probability, giant component, Modelling and Simulation, Applied Mathematics, Probability (math.PR), 60, Random graphs (graph-theoretic aspects), FOS: Mathematics, Enumeration in graph theory, Mathematics - Probability
Statistics and Probability, giant component, Modelling and Simulation, Applied Mathematics, Probability (math.PR), 60, Random graphs (graph-theoretic aspects), FOS: Mathematics, Enumeration in graph theory, Mathematics - Probability
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).3 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!