Results 41 to 50 of about 276,499 (268)

A Probabilistic Counting Lemma for Complete Graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2005
We prove the existence of many complete graphs in almost all sufficiently dense partitions obtained by an application of Szemerédi's Regularity Lemma.
Stefanie Gerke, Martin Marciniszyn, Angelika Steger   +2 more
doaj   +1 more source

More Benefits of Adding Sparse Random Links to Wireless Networks: Yet Another Case for Hybrid Networks

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

Directed random geometric graphs: structural and spectral properties

Journal of Physics: Complexity, 2022
In this work we analyze structural and spectral properties of a model of directed random geometric graphs: given n vertices uniformly and independently distributed on the unit square, a directed edge is set between two vertices if their distance is ...
Kevin Peralta-Martinez, J A Méndez-Bermúdez   +1 more
doaj   +1 more source

HyGen: generating random graphs with hyperbolic communities

Applied Network Science, 2019
Random graph generators are necessary tools for many network science applications. For example, the evaluation of graph analysis algorithms requires methods for generating realistic synthetic graphs.
Saskia Metzler, Pauli Miettinen
doaj   +1 more source

A Random Graph Model for Massive Graphs [PDF]

Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize and log-log growth rate. These parameters capture some universal characteristics of massive graphs.
William Aiello, Fan R. K. Chung, Linyuan Lu   +2 more
openaire   +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

Random Graphs

The Annals of Mathematical Statistics, 1959
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Investigating the trade-off between infections and social interactions using a compact model of endemic infections on networks

Mathematics in Medical and Life Sciences
This paper is part of a special issue on Behavioural Epidemiology.In many epidemiological and ecological contexts, there is a trade-off between infections and interactions. This arises because the links between individuals capable of spreading infections
Bunlang Thatchai, Christopher E. Overton, Thomas House   +2 more
doaj   +1 more source

Membatasi k-Ketenggaan Simpul dalam Pembangkitan Random Graph Metode Erdos Royi untuk Meningkatkan Kinerja Komputasi

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

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, Maksim Ryzhov, Marijus Vaičiulis   +2 more
doaj   +1 more source