Results 31 to 40 of about 172,035 (261)
Stochastic Processes and their Applications, 2005 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.
Blasiak, Jonah, Durrett, Rick
openaire +2 more sources
Zero-One Law for Connectivity in Superposition of Random Key Graphs on Random Geometric Graphs
Discrete Dynamics in Nature and Society, 2015 We study connectivity property in the superposition of random key graph on random geometric graph. For this class of random graphs, we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly
Y. Tang, Q. L. Li
doaj +1 more source
Random Structures & Algorithms, 2018 We investigate the asymptotic structure of a random perfect graph Pn sampled uniformly from the set of perfect graphs on vertex set . Our approach is based on the result of Prömel and Steger that almost all perfect graphs are generalised split graphs, together with a method to generate such graphs almost uniformly.
McDiarmid, C, Yolov, N
openaire +2 more sources
The effects of random geometric graph structure and clustering on localizability of sensor networks
International Journal of Distributed Sensor Networks, 2017 Graph rigidity provides the conditions of unique localizability for cooperative localization of wireless ad hoc and sensor networks. Specifically, redundant rigidity and 3-connectivity are necessary and sufficient conditions for unique localizability of ...
Tolga Eren
doaj +1 more source
PREFERENTIAL ATTACHMENT WITH FITNESS DEPENDENT CHOICE
Физико-химические аспекты изучения кластеров, наноструктур и наноматериалов, 2021 We study the asymptotic behavior of the maximum degree in the preferential attachment tree model with a choice based on both the degree and fitness of a vertex.
Y.A. Malyshkin
doaj +1 more source
Navigability of Random Geometric Graphs in the Universe and Other Spacetimes
Scientific Reports, 2017 Random geometric graphs in hyperbolic spaces explain many common structural and dynamical properties of real networks, yet they fail to predict the correct values of the exponents of power-law degree distributions observed in real networks.
William Cunningham +2 more
doaj +1 more source
The number of planar graphs and properties of random planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.
Omer Gimenez, Marc Noy
doaj +1 more source
The Annals of Mathematical Statistics, 1959 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Fast Generation of Sparse Random Kernel Graphs. [PDF]
PLoS ONE, 2015 The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable.
Aric Hagberg, Nathan Lemons
doaj +1 more source
Bounding Extremal Degrees of Edge-Independent Random Graphs Using Relative Entropy
Entropy, 2016 Edge-independent random graphs are a model of random graphs in which each potential edge appears independently with an individual probability. Based on the relative entropy method, we determine the upper and lower bounds for the extremal vertex degrees ...
Yilun Shang
doaj +1 more source