Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Condensed Matter > Disordered Systems and Neural Networks

arXiv:1304.1329 (cond-mat)
[Submitted on 4 Apr 2013 (v1), last revised 6 Aug 2013 (this version, v2)]

Title:k-connectivity for confined random networks

Authors:Orestis Georgiou, Carl P. Dettmann, Justin Coon
View PDF
Abstract:k-connectivity is an important measure of network robustness and resilience to random faults and disruptions. We undertake both local and global approaches to k-connectivity and calculate closed form analytic formulas for the probability that a confined random network remains fully connected after the removal of k-1 nodes. Our analysis reveals that k-connectivity is governed by microscopic details of the network domain such as sharp corners rather than the macroscopic total volume. Hence, our results can aid in the design of reliable networks, an important problem in e.g. wireless ad hoc and sensor networks.
Comments: 6 pages, 4 figures
Subjects: Disordered Systems and Neural Networks (cond-mat.dis-nn); Discrete Mathematics (cs.DM); Mathematical Physics (math-ph); Probability (math.PR)
Cite as: arXiv:1304.1329 [cond-mat.dis-nn]
  (or arXiv:1304.1329v2 [cond-mat.dis-nn] for this version)
  https://doi.org/10.48550/arXiv.1304.1329
Journal reference: Europhys. Lett., 103, 28006, (2013)
Related DOI: https://doi.org/10.1209/0295-5075/103/28006

Submission history

From: Orestis Georgiou [view email]
[v1] Thu, 4 Apr 2013 11:24:28 UTC (410 KB)
[v2] Tue, 6 Aug 2013 14:54:48 UTC (469 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cond-mat.dis-nn
< prev   |   next >
new | recent | 2013-04
Change to browse by:
cond-mat
cs
cs.DM
math
math-ph
math.MP
math.PR

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)