scholarly journals High-Dimensional Random Geometric Graphs and their Clique Number

2011 ◽  
Vol 16 (0) ◽  
pp. 2481-2508 ◽  
Author(s):  
Luc Devroye ◽  
András György ◽  
Gábor Lugosi ◽  
Frederic Udina
Keyword(s):  
Clique Number ◽  
High Dimensional ◽  
Geometric Graphs ◽  
Random Geometric Graphs

scholarly journals Colouring random geometric graphs

2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Colin J. H. McDiarmid ◽  
Tobias Müller
Keyword(s):  
Chromatic Number ◽  
Analogous Result ◽  
Clique Number ◽  
Geometric Graph ◽  
Geometric Graphs ◽  
Random Geometric Graph ◽  
Random Geometric Graphs ◽  
Different Types ◽  
International Audience ◽  
Uniform Case

International audience A random geometric graph $G_n$ is obtained as follows. We take $X_1, X_2, \ldots, X_n ∈\mathbb{R}^d$ at random (i.i.d. according to some probability distribution ν on $\mathbb{R}^d$). For $i ≠j$ we join $X_i$ and $X_j$ by an edge if $║X_i - X_j ║< r(n)$. We study the properties of the chromatic number $χ _n$ and clique number $ω _n$ of this graph as n becomes large, where we assume that $r(n) →0$. We allow any choice $ν$ that has a bounded density function and $║. ║$ may be any norm on $ℝ^d$. Depending on the choice of $r(n)$, qualitatively different types of behaviour can be observed. We distinguish three main cases, in terms of the key quantity $n r^d$ (which is a measure of the average degree). If $r(n)$ is such that $\frac{nr^d}{ln n} →0$ as $n →∞$ then $\frac{χ _n}{ ω _n} →1$ almost surely. If n $\frac{r^d }{\ln n} →∞$ then $\frac{χ _n }{ ω _n} →1 / δ$ almost surely, where $δ$ is the (translational) packing density of the unit ball $B := \{ x ∈ℝ^d: ║x║< 1 \}$ (i.e. $δ$ is the proportion of $d$-space that can be filled with disjoint translates of $B$). If $\frac{n r^d }{\ln n} →t ∈(0,∞)$ then $\frac{χ _n }{ ω _n}$ tends almost surely to a constant that can be bounded in terms of $δ$ and $t$. These results extend earlier work of McDiarmid and Penrose. The proofs in fact yield separate expressions for $χ _n$ and $ω _n$. We are also able to prove a conjecture by Penrose. This states that when $\frac{n r^d }{ln n} →0$ then the clique number becomes focussed on two adjacent integers, meaning that there exists a sequence $k(n)$ such that $\mathbb{P}( ω _n ∈\{k(n), k(n)+1\}) →1$ as $n →∞$. The analogous result holds for the chromatic number (and for the maximum degree, as was already shown by Penrose in the uniform case).

scholarly journals Coloring Geographical Threshold Graphs

2010 ◽  
Vol Vol. 12 no. 3 (Graph and Algorithms) ◽  
Author(s):  
Milan Bradonjic ◽  
Tobias Mueller ◽  
Allon G. Percus
Keyword(s):  
Asymptotic Behavior ◽  
Euclidean Space ◽  
Chromatic Number ◽  
Clique Number ◽  
Threshold Function ◽  
The Internet ◽  
Geometric Graphs ◽  
Random Geometric Graphs ◽  
International Audience ◽  
Threshold Graph

Graphs and Algorithms International audience We propose a coloring algorithm for sparse random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e. g., wireless networks, the Internet, etc.) need to be studied by using a ''richer'' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Here, we analyze the GTG coloring algorithm together with the graph's clique number, showing formally that in spite of the differences in structure between GTG and RGG, the asymptotic behavior of the chromatic number is identical: chi = ln n/ln ln n(1 +o(1)). Finally, we consider the leading corrections to this expression, again using the coloring algorithm and clique number to provide bounds on the chromatic number. We show that the gap between the lower and upper bound is within C ln n/(ln ln n)(2), and specify the constant C.

scholarly journals Normalized Sombor Indices as Complexity Measures of Random Networks

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 976
Author(s):  
R. Aguilar-Sánchez ◽  
J. Méndez-Bermúdez ◽  
José Rodríguez ◽  
José Sigarreta
Keyword(s):  
Random Matrix ◽  
Adjacency Matrix ◽  
Matrix Theory ◽  
Computational Study ◽  
Random Networks ◽  
Geometric Graphs ◽  
Theory Approach ◽  
Complexity Measures ◽  
Random Geometric Graphs ◽  
Highly Correlated

We perform a detailed computational study of the recently introduced Sombor indices on random networks. Specifically, we apply Sombor indices on three models of random networks: Erdös-Rényi networks, random geometric graphs, and bipartite random networks. Within a statistical random matrix theory approach, we show that the average values of Sombor indices, normalized to the order of the network, scale with the average degree. Moreover, we discuss the application of average Sombor indices as complexity measures of random networks and, as a consequence, we show that selected normalized Sombor indices are highly correlated with the Shannon entropy of the eigenvectors of the adjacency matrix.

scholarly journals Connectivity in one-dimensional soft random geometric graphs

2020 ◽  
Vol 102 (6) ◽  
Author(s):  
Michael Wilsher ◽  
Carl P. Dettmann ◽  
Ayalvadi Ganesh
Keyword(s):  
Geometric Graphs ◽  
Random Geometric Graphs ◽  
One Dimensional

scholarly journals Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs

2000 ◽  
Vol 9 (6) ◽  
pp. 489-511 ◽  
Author(s):  
JOSEP DÍAZ ◽  
MATHEW D. PENROSE ◽  
JORDI PETIT ◽  
MARÍA SERNA
Keyword(s):  
Constant Factor ◽  
Geometric Graphs ◽  
Convergence Theorems ◽  
Linear Arrangement ◽  
Random Lattice ◽  
Random Geometric Graphs ◽  
Unit Square ◽  
Subcritical Regime ◽  
Probabilistic Setting ◽  
Lattice Graphs

This work deals with convergence theorems and bounds on the cost of several layout measures for lattice graphs, random lattice graphs and sparse random geometric graphs. Specifically, we consider the following problems: Minimum Linear Arrangement, Cutwidth, Sum Cut, Vertex Separation, Edge Bisection and Vertex Bisection. For full square lattices, we give optimal layouts for the problems still open. For arbitrary lattice graphs, we present best possible bounds disregarding a constant factor. We apply percolation theory to the study of lattice graphs in a probabilistic setting. In particular, we deal with the subcritical regime that this class of graphs exhibits and characterize the behaviour of several layout measures in this space of probability. We extend the results on random lattice graphs to random geometric graphs, which are graphs whose nodes are spread at random in the unit square and whose edges connect pairs of points which are within a given distance. We also characterize the behaviour of several layout measures on random geometric graphs in their subcritical regime. Our main results are convergence theorems that can be viewed as an analogue of the Beardwood, Halton and Hammersley theorem for the Euclidean TSP on random points in the unit square.

scholarly journals Symmetric motifs in random geometric graphs

2017 ◽  
Vol 6 (1) ◽  
pp. 95-105 ◽  
Author(s):  
Carl P Dettmann ◽  
Georgie Knight
Keyword(s):  
Geometric Graphs ◽  
Random Geometric Graphs
Sign in / Sign up

Export Citation Format

Share Document