Results 31 to 40 of about 35,950 (265)
Ollivier-Ricci curvature convergence in random geometric graphs
Physical Review Research, 2021 Connections between continuous and discrete worlds tend to be elusive. One example is curvature. Even though there exist numerous nonequivalent definitions of graph curvature, none is known to converge in any limit to any traditional definition of ...
Pim van der Hoorn +4 more
doaj +1 more source
Edge-Removal and Non-Crossing Configurations in Geometric Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Graphs and ...
Oswin Aichholzer +7 more
doaj +1 more source
Generalised resilience models for power systems and dependent infrastructure during extreme events
IET Smart Grid, 2019 This study presents a generalised critical infrastructures resilience model for extreme events with a focus on power grids. Infrastructures are modelled as three domains – physical, cyber, and human.
Vaidyanathan Krishnamurthy +5 more
doaj +1 more source
Geometric Random Graphs on Circles [PDF]
, 2021 14 pages, 1 figure.
Angel, Omer, Spinka, Yinon
openaire +2 more sources
Dynamic FastMap: An Efficient Algorithm for Spatiotemporal Embedding of Dynamic Graphs
Proceedings of the International Florida Artificial Intelligence Research Society Conference, 2023 Efficiently embedding graphs in a Euclidean space has many benefits: It allows us to interpret and solve graph-theoretic problems using geometric and analytical methods.
Omkar Thakoor, T. K. Satish Kumar
doaj +1 more source
Minimal Graphs with Respect to Geometric Distance Realizability
Discussiones Mathematicae Graph Theory, 2021 A graph G is minimal non-unit-distance graph if there is no drawing of G in Euclidean plane having all edges of unit length, but, for each edge e of G, G − e has such a drawing.
Madaras Tomáš, Široczki Pavol
doaj +1 more source
The Geometric Index of the Wheel, Wn
Davao Research Journal, 1998 The geometric index of a graph G is defined as the smallest non-negative integer n such that a graph G is a unit graph in r. Graphs considered are finite, undirected, without loops nor multiple edges.
Rowena Baylon
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 +1 more
doaj +1 more source
Generalized Permutants and Graph GENEOs
Machine Learning and Knowledge Extraction, 2023 This paper is part of a line of research devoted to developing a compositional and geometric theory of Group Equivariant Non-Expansive Operators (GENEOs) for Geometric Deep Learning. It has two objectives. The first objective is to generalize the notions
Faraz Ahmad +2 more
doaj +1 more source
On Statistical Properties of a New Family of Geometric Random Graphs
Engineering ProceedingsWe define a new family of random geometric graphs which we call random covering graphs and study its statistical properties. To the best of our knowledge, this family of graphs has not been explored in the past.
Kedar Joglekar +2 more
doaj +1 more source