Metraipolis › archive › dc_cf1327ec58eb
On the Probability of Network States with Gaussian Connectivity Functions — arXiv:2608.17622
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.17622
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T15:05:04.128Z
- SHA-256 of the archived text
293f4961b5a8a310929494e853b274d6ef48673af0c2ee37f167962166e9e4b8- Stable URL of this page
https://metraipolis.com/documento/dc_cf1327ec58eb
How to cite
On the Probability of Network States with Gaussian Connectivity Functions — arXiv:2608.17622 — arXiv (en), https://arxiv.org/abs/2608.17622 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cf1327ec58eb (Metraipolis archive dc_cf1327ec58eb, sha256 293f4961b5a8a310929494e853b274d6ef48673af0c2ee37f167962166e9e4b8)
BibTeX
@misc{dccf1327ec58eb,
title = {On the Probability of Network States with Gaussian Connectivity Functions — arXiv:2608.17622},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.17622},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cf1327ec58eb; sha256 293f4961b5a8a310929494e853b274d6ef48673af0c2ee37f167962166e9e4b8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.17622. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this paper, we consider the connectivity of a random network of N mobile devices in three dimensions (3D), where the location of each device or node has a Gaussian distribution in each dimension. For each pair of nodes, the probability of connectivity is related to the nodes' separation by a Gaussian connectivity function. The fundamental analytical tool for studying such systems is the probability of a given network state, derived and expressed in terms of its graph Laplacian. Leveraging this result, we obtain results for the connectivity of small networks, the probability of a complete network (where all nodes are connected to all other nodes), and the probability of an isolated node, which gives an approximation to the connectivity probability of larger networks. The general results are then simplified for special cases and limiting scenarios. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-19 in math.PR). Categorie arXiv: Signal Processing (eess.SP) ; Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2608.17622 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T14:59:27.069Z dalla pagina https://arxiv.org/catchup/math.PR/2026-08-19?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).