The distributed graph data structure employs a combination of vertex delegation partitioning and rejection sampling, enabling it to sample massive amounts of random paths on large scale-free graphs.

Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is ...

Gao, Pu , and Nicholas Wormald. 2009. “Short Cycle Distribution In Random Regular Graphs Recursively Generated By Pegging”. Random Structures & Algorithms 34: 54–86.

Trinity is a general purpose distributed graph system over a memory cloud. Memory cloud is a globally addressable, in-memory key-value store over a cluster of machines. Through the distributed ...

Much work has been devoted to supporting RDF data. But state-of-the-art systems and methods still cannot handle web scale RDF data effectively. Furthermore, many useful and general purpose graph-based ...

A quantum random number generator developed in Spain is at the heart of a service being offered for free over the Internet.

Bahmani A, Li G, Willett TL, Montesano J. Three-dimensional microscopic assessment of randomly distributed representative volume elements for high fiber volume fraction unidirectional composites.

GAT-RWOS is a graph-based oversampling method that combines Graph Attention Networks (GATs) with random walk-based oversampling to address the class imbalance problem. By utilizing GAT's attention ...