Results 41 to 50 of about 2,603,262 (299)
Random Graphs with Clustering [PDF]
Physical Review Letters, 2009 We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be neighbors of one another.
openaire +3 more sources
Random Trees in Random Graphs [PDF]
Proceedings of the American Mathematical Society, 1988 We show that a random labeled n n -vertex graph almost surely contains isomorphic copies of almost all labeled
Bender, E. A., Wormald, N. C.
openaire +2 more sources
Random walks on the random graph [PDF]
The Annals of Probability, 2018 We study random walks on the giant component of the Erdős–Rényi random graph G(n,p) where p=λ/n for λ>1 fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently by Benjamini, Kozma and Wormald, to have order log2n.
Berestycki, Nathanaël +3 more
openaire +5 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
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 +3 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
International Journal of Distributed Sensor Networks, 2012 Suppose that n nodes with n 0 acquaintances per node are randomly deployed in a two-dimensional Euclidean space with the geographic restriction that each pair of nodes can exchange information between them directly only if the distance between them is at
Zhihong Liu +4 more
doaj +1 more source
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2010 Edges generation by random graph erdos-royi methods was needed high computation, it’s caused low performance. In fact, edge generation was used frequently with many nodes.
Zainal Abidin, Agus Zainal Arifin
doaj +1 more source
Super Connectivity of Erdős-Rényi Graphs
Mathematics, 2019 The super connectivity κ ′ ( G ) of a graph G is the minimum cardinality of vertices, if any, whose deletion results in a disconnected graph that contains no isolated vertex.
Yilun Shang
doaj +1 more source
International Journal of Distributed Sensor Networks, 2012 We theoretically and experimentally analyze the process of adding sparse random links to random wireless networks modeled as a random geometric graph. While this process has been previously proposed, we are the first to prove theoretical bounds on the ...
Gunes Ercal
doaj +1 more source