Full connectivity: corners, edges and faces

DOI10.1007/S10955-012-0493-YzbMATH Open1246.82046arXiv1201.3123OpenAlexW3105947056WikidataQ61311462 ScholiaQ61311462MaRDI QIDQ438752FDOQ438752

Justin P. Coon, Orestis Georgiou, Carl P. Dettmann

Publication date: 31 July 2012

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Abstract: We develop a cluster expansion for the probability of full connectivity of high density random networks in confined geometries. In contrast to percolation phenomena at lower densities, boundary effects, which have previously been largely neglected, are not only relevant but dominant. We derive general analytical formulas that show a persistence of universality in a different form to percolation theory, and provide numerical confirmation. We also demonstrate the simplicity of our approach in three simple but instructive examples and discuss the practical benefits of its application to different models.

Full work available at URL: https://arxiv.org/abs/1201.3123

zbMATH Keywords

boundary effectsfull connectivityrandom geometric networks

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40) Percolation (82B43)

Cites Work

• Random Geometric Graphs
• Random graphs.
• Title not available (Why is that?)
• Fundamentals of Wireless Communication
• Can One Hear the Shape of a Drum?
• Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Information percolation in segmented markets
• Continuum percolation of wireless ad hoc communication networks
• Title not available (Why is that?)
• PERCOLATION AND TUNNELING IN COMPOSITE MATERIALS

Cited In (7)

• The direct-connectedness function in the random connection model
• Connectivity of soft random geometric graphs over annuli
• Connectivity of soft random geometric graphs
• Critically spanning epidemic outbreak cluster in random geometric networks
• Distance distribution between two random points in arbitrary polygons
• Isolation and connectivity in random geometric graphs with self-similar intensity measures
• Isotropic random geometric networks in two dimensions with a penetrable cavity

This page was built for publication: Full connectivity: corners, edges and faces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438752)