Results 31 to 40 of about 1,182,412 (332)
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
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
Tilings in randomly perturbed dense graphs [PDF]
, 2018 A perfect $H$-tiling in a graph $G$ is a collection of vertex-disjoint copies of a graph $H$ in $G$ that together cover all the vertices in $G$. In this paper we investigate perfect $H$-tilings in a random graph model introduced by Bohman, Frieze and ...
Balogh, József +2 more
core +2 more sources
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
Bayesian Exponential Random Graph Models with Nodal Random Effects [PDF]
, 2015 We extend the well-known and widely used Exponential Random Graph Model (ERGM) by including nodal random effects to compensate for heterogeneity in the nodes of a network.
A. Caimo +43 more
core +3 more sources
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
On the structure of random graphs with constant $r$-balls [PDF]
, 2019 We continue the study of the properties of graphs in which the ball of radius $r$ around each vertex induces a graph isomorphic to the ball of radius $r$ in some fixed vertex-transitive graph $F$, for various choices of $F$ and $r$.
Benjamini, Itai, Ellis, David
core +3 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