Random Geometric Graphs
From MaRDI portal
Publication:4427412
DOI10.1093/acprof:oso/9780198506263.001.0001zbMath1029.60007OpenAlexW630423399MaRDI QIDQ4427412
Publication date: 21 September 2003
Full work available at URL: https://semanticscholar.org/paper/ea21791255647a9c758b9ec2ba8bf1f2269f8864
Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Research exposition (monographs, survey articles) pertaining to probability theory (60-02)
Related Items (only showing first 100 items - show all)
Concentration for Poisson functionals: component counts in random geometric graphs ⋮ Concentration for Poisson \(U\)-statistics: subgraph counts in random geometric graphs ⋮ Topology of random geometric complexes: a survey ⋮ Consistency of modularity clustering on random geometric graphs ⋮ Limit theorems for persistence diagrams ⋮ Limit theorems for Betti numbers of extreme sample clouds with application to persistence barcodes ⋮ Complex systems: features, similarity and connectivity ⋮ Networks beyond pairwise interactions: structure and dynamics ⋮ A BKR operation for events occurring for disjoint reasons with high probability ⋮ A random geometric graph built on a time-varying Riemannian manifold ⋮ The coverage holes of the largest component of random geometric graph ⋮ Functional strong laws of large numbers for Euler characteristic processes of extreme sample clouds ⋮ Phase transitions in discrete structures ⋮ Connectivity of soft random geometric graphs over annuli ⋮ Distributed finite-time calculation of node eccentricities, graph radius and graph diameter ⋮ Leader nodes in communities for information spreading ⋮ Maximum likelihood analysis of the Ford-Fulkerson method on special graphs ⋮ Connectivity of soft random geometric graphs ⋮ Generalized network measures based on modulus of families of walks ⋮ Epidemics on plants: modeling long-range dispersal on spatially embedded networks ⋮ Note on the structure of Kruskal's algorithm ⋮ Spatial ``artistic networks: from deconstructing integer-functions to visual arts ⋮ Sharpness of the phase transition and lower bounds for the critical intensity in continuum percolation on \(\mathbb{R}^{d}\) ⋮ Localization from incomplete noisy distance measurements ⋮ Size of the giant component in a random geometric graph ⋮ Perturbing the hexagonal circle packing: a percolation perspective ⋮ Diameter and broadcast time of random geometric graphs in arbitrary dimensions ⋮ On the distribution of typical shortest-path lengths in connected random geometric graphs ⋮ Log-concavity, ultra-log-concavity, and a maximum entropy property of discrete compound Poisson measures ⋮ On computing the diameter of real-world undirected graphs ⋮ Limit theory for point processes in manifolds ⋮ Intrinsic dimension identification via graph-theoretic methods ⋮ Limit behaviors of random connected graphs driven by a Poisson process ⋮ A strong law of large numbers for random biased connected graphs ⋮ A geometric Achlioptas process ⋮ On the topology of random complexes built over stationary point processes ⋮ On the mixing time of geographical threshold graphs ⋮ When local and global clustering of networks diverge ⋮ Strict inequalities of critical values in continuum percolation ⋮ Random geometric complexes ⋮ Connected spatial networks over random points and a route-length statistic ⋮ Stretch and diameter in random geometric graphs ⋮ A remark on the convergence of Betti numbers in the thermodynamic regime ⋮ Combinatorial quantum gravity: geometry from random bits ⋮ Full connectivity: corners, edges and faces ⋮ Discontinuities and hysteresis in quantized average consensus ⋮ Geometric inhomogeneous random graphs ⋮ A phase transition in a quenched amorphous ferromagnet ⋮ Quantitative CLTs for symmetric \(U\)-statistics using contractions ⋮ Growth and roughness of the interface for ballistic deposition ⋮ Computational models for networks of tiny artifacts: a survey ⋮ Infinite random geometric graphs ⋮ Extreme values for characteristic radii of a Poisson-Voronoi tessellation ⋮ Clique colourings of geometric graphs ⋮ A new method of normal approximation ⋮ Edge density of new graph types based on a random digraph family ⋮ Distributed sampled-data control of nonholonomic multi-robot systems with proximity networks ⋮ Random geometric complexes in the thermodynamic regime ⋮ Large independent sets in general random intersection graphs ⋮ Hyperbolic graph generator ⋮ Scaling limits and generic bounds for exploration processes ⋮ Scaling laws for maximum coloring of random geometric graphs ⋮ Nonuniform random geometric graphs with location-dependent radii ⋮ Detecting the fuzzy clusters of complex networks ⋮ In-network estimation of frequency moments ⋮ The distant-2 chromatic number of random proximity and random geometric graphs ⋮ Point Patterns Occurring on Complex Structures in Space and Space-Time: An Alternative Network Approach ⋮ Normal approximation for coverage models over binomial point processes ⋮ Confidence sets for persistence diagrams ⋮ Hamilton cycles in random geometric graphs ⋮ On the number of higher order Delaunay triangulations ⋮ Synchronization of multi-agent systems without connectivity assumptions ⋮ The scaling limit of Poisson-driven order statistics with applications in geometric probability ⋮ Cell-specific and post-hoc spatial clustering tests based on nearest neighbor contingency tables ⋮ Vulnerability of complex networks ⋮ Connectivity in a random interval graph with access points ⋮ Poisson process Fock space representation, chaos expansion and covariance inequalities ⋮ Thresholding random geometric graph properties motivated by ad hoc sensor networks ⋮ A variational approach to the consistency of spectral clustering ⋮ Cliques in hyperbolic random graphs ⋮ Connection times in large ad-hoc mobile networks ⋮ Functional Poisson approximation in Kantorovich-Rubinstein distance with applications to \(U\)-statistics and stochastic geometry ⋮ Correlation between graphs with an application to brain network analysis ⋮ Moderate deviations for some point measures in geometric probability ⋮ Vertex degree of random geometric graph on exponentially distributed points ⋮ Asymptotic behaviors for percolation clusters with uncorrelated weights ⋮ Limit theorems for diameter of a random sample in the unit ball ⋮ A general study of extremes of stationary tessellations with examples ⋮ Chasing robbers on random geometric graphs-an alternative approach ⋮ Gaussian limits for generalized spacings ⋮ Fréchet means for distributions of persistence diagrams ⋮ Space-time percolation and detection by mobile nodes ⋮ Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters ⋮ Asymptotic theory for the multidimensional random on-line nearest-neighbour graph ⋮ Balanced cut approximation in random geometric graphs ⋮ Expander properties and the cover time of random intersection graphs ⋮ A tutorial survey of topics in wireless networking. II ⋮ Diameter and stationary distribution of random \(r\)-out digraphs ⋮ Some properties for the largest component of random geometric graphs with applications in sensor networks ⋮ The chromatic and clique numbers of random scaled sector graphs
This page was built for publication: Random Geometric Graphs