Random Geometric Graphs

From MaRDI portal
Revision as of 03:16, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4427412

DOI10.1093/acprof:oso/9780198506263.001.0001zbMath1029.60007OpenAlexW630423399MaRDI QIDQ4427412

Mathew D. Penrose

Publication date: 21 September 2003

Full work available at URL: https://semanticscholar.org/paper/ea21791255647a9c758b9ec2ba8bf1f2269f8864




Related Items (only showing first 100 items - show all)

Concentration for Poisson functionals: component counts in random geometric graphsConcentration for Poisson \(U\)-statistics: subgraph counts in random geometric graphsTopology of random geometric complexes: a surveyConsistency of modularity clustering on random geometric graphsLimit theorems for persistence diagramsLimit theorems for Betti numbers of extreme sample clouds with application to persistence barcodesComplex systems: features, similarity and connectivityNetworks beyond pairwise interactions: structure and dynamicsA BKR operation for events occurring for disjoint reasons with high probabilityA random geometric graph built on a time-varying Riemannian manifoldThe coverage holes of the largest component of random geometric graphFunctional strong laws of large numbers for Euler characteristic processes of extreme sample cloudsPhase transitions in discrete structuresConnectivity of soft random geometric graphs over annuliDistributed finite-time calculation of node eccentricities, graph radius and graph diameterLeader nodes in communities for information spreadingMaximum likelihood analysis of the Ford-Fulkerson method on special graphsConnectivity of soft random geometric graphsGeneralized network measures based on modulus of families of walksEpidemics on plants: modeling long-range dispersal on spatially embedded networksNote on the structure of Kruskal's algorithmSpatial ``artistic networks: from deconstructing integer-functions to visual artsSharpness of the phase transition and lower bounds for the critical intensity in continuum percolation on \(\mathbb{R}^{d}\)Localization from incomplete noisy distance measurementsSize of the giant component in a random geometric graphPerturbing the hexagonal circle packing: a percolation perspectiveDiameter and broadcast time of random geometric graphs in arbitrary dimensionsOn the distribution of typical shortest-path lengths in connected random geometric graphsLog-concavity, ultra-log-concavity, and a maximum entropy property of discrete compound Poisson measuresOn computing the diameter of real-world undirected graphsLimit theory for point processes in manifoldsIntrinsic dimension identification via graph-theoretic methodsLimit behaviors of random connected graphs driven by a Poisson processA strong law of large numbers for random biased connected graphsA geometric Achlioptas processOn the topology of random complexes built over stationary point processesOn the mixing time of geographical threshold graphsWhen local and global clustering of networks divergeStrict inequalities of critical values in continuum percolationRandom geometric complexesConnected spatial networks over random points and a route-length statisticStretch and diameter in random geometric graphsA remark on the convergence of Betti numbers in the thermodynamic regimeCombinatorial quantum gravity: geometry from random bitsFull connectivity: corners, edges and facesDiscontinuities and hysteresis in quantized average consensusGeometric inhomogeneous random graphsA phase transition in a quenched amorphous ferromagnetQuantitative CLTs for symmetric \(U\)-statistics using contractionsGrowth and roughness of the interface for ballistic depositionComputational models for networks of tiny artifacts: a surveyInfinite random geometric graphsExtreme values for characteristic radii of a Poisson-Voronoi tessellationClique colourings of geometric graphsA new method of normal approximationEdge density of new graph types based on a random digraph familyDistributed sampled-data control of nonholonomic multi-robot systems with proximity networksRandom geometric complexes in the thermodynamic regimeLarge independent sets in general random intersection graphsHyperbolic graph generatorScaling limits and generic bounds for exploration processesScaling laws for maximum coloring of random geometric graphsNonuniform random geometric graphs with location-dependent radiiDetecting the fuzzy clusters of complex networksIn-network estimation of frequency momentsThe distant-2 chromatic number of random proximity and random geometric graphsPoint Patterns Occurring on Complex Structures in Space and Space-Time: An Alternative Network ApproachNormal approximation for coverage models over binomial point processesConfidence sets for persistence diagramsHamilton cycles in random geometric graphsOn the number of higher order Delaunay triangulationsSynchronization of multi-agent systems without connectivity assumptionsThe scaling limit of Poisson-driven order statistics with applications in geometric probabilityCell-specific and post-hoc spatial clustering tests based on nearest neighbor contingency tablesVulnerability of complex networksConnectivity in a random interval graph with access pointsPoisson process Fock space representation, chaos expansion and covariance inequalitiesThresholding random geometric graph properties motivated by ad hoc sensor networksA variational approach to the consistency of spectral clusteringCliques in hyperbolic random graphsConnection times in large ad-hoc mobile networksFunctional Poisson approximation in Kantorovich-Rubinstein distance with applications to \(U\)-statistics and stochastic geometryCorrelation between graphs with an application to brain network analysisModerate deviations for some point measures in geometric probabilityVertex degree of random geometric graph on exponentially distributed pointsAsymptotic behaviors for percolation clusters with uncorrelated weightsLimit theorems for diameter of a random sample in the unit ballA general study of extremes of stationary tessellations with examplesChasing robbers on random geometric graphs-an alternative approachGaussian limits for generalized spacingsFréchet means for distributions of persistence diagramsSpace-time percolation and detection by mobile nodesOptimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clustersAsymptotic theory for the multidimensional random on-line nearest-neighbour graphBalanced cut approximation in random geometric graphsExpander properties and the cover time of random intersection graphsA tutorial survey of topics in wireless networking. IIDiameter and stationary distribution of random \(r\)-out digraphsSome properties for the largest component of random geometric graphs with applications in sensor networksThe chromatic and clique numbers of random scaled sector graphs




This page was built for publication: Random Geometric Graphs