Results 41 to 50 of about 5,903,622 (201)
Journal of Combinatorial Theory, Series B, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
McDiarmid, C, Steger, A, Welsh, D
openaire +4 more sources
Optimal Wireless Resource Allocation With Random Edge Graph Neural Networks [PDF]
IEEE Transactions on Signal Processing, 2019 We consider the problem of optimally allocating resources across a set of transmitters and receivers in a wireless network. The resulting optimization problem takes the form of constrained statistical learning, in which solutions can be found in a model ...
Mark Eisen, Alejandro Ribeiro
semanticscholar +1 more source
Dynamic Random Graph Protection Scheme Based on Chaos and Cryptographic Random Mapping
Information, 2022 Advances in network technology have enhanced the concern for network security issues. In order to address the problem that hopping graph are vulnerable to external attacks (e.g., the changing rules of fixed graphs are more easily grasped by attackers ...
Zhu Fang, Zhengquan Xu
doaj +1 more source
Tail Index Estimation of PageRanks in Evolving Random Graphs
Mathematics, 2022 Random graphs are subject to the heterogeneities of the distributions of node indices and their dependence structures. Superstar nodes to which a large proportion of nodes attach in the evolving graphs are considered.
Natalia Markovich +2 more
doaj +1 more source
On hamiltonicity of uniform random intersection graphs
Lietuvos Matematikos Rinkinys, 2010 We give a sufficient condition for the hamiltonicity of the uniform random intersection graph G{n,m,d}. It is a graph on n vertices, where each vertex is assigned d keys drawn independently at random from a given set of m keys, and where any two vertices
Mindaugas Bloznelis +1 more
doaj +1 more source
Connectivity of Random Geometric Hypergraphs
Entropy, 2023 We consider a random geometric hypergraph model based on an underlying bipartite graph. Nodes and hyperedges are sampled uniformly in a domain, and a node is assigned to those hyperedges that lie within a certain radius.
Henry-Louis de Kergorlay +1 more
doaj +1 more source
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
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
Temporal Exponential Random Graph Models with btergm: Estimation and Bootstrap Confidence Intervals
, 2018 The xergm package is an implementation of extensions to the exponential random graph model (ERGM). It acts as a meta-package for multiple constituent packages.
Philip Leifeld +2 more
semanticscholar +1 more source
Random graph approach to multifunctional molecular networks [PDF]
, 2016 Formation of a molecular network from multifunctional precursors is modelled with a random graph process. The random graph model favours reactivity for monomers that are positioned close in the network topology, and disfavours reactivity for those that ...
I. Kryven +3 more
semanticscholar +1 more source