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

Mathematics > Probability

arXiv:2207.08527 (math)
[Submitted on 18 Jul 2022]

Title:Sequential construction of spatial networks with arbitrary degree sequence and edge length distribution

Authors:Ivan Kryven, Rik Versendaal
View PDF
Abstract:Complex systems, ranging from soft materials to wireless communication, are often organised as random geometric networks in which nodes and edges evenly fill up the volume of some space. Studying such networks is difficult because they inherit their properties from the embedding space as well as from the constraints imposed on the network's structure by design, for example, the degree sequence. Here we consider geometric graphs with a given distribution for vertex degrees and edge lengths and propose a numerical method for unbiased sampling of such graphs. We show that the method reproduces the desired target distributions up to a small error asymptotically, and that is some boundary cases only a positive fraction of the network is guaranteed to possible to construct.
Subjects: Probability (math.PR)
MSC classes: 05C80, 68W20, 60D05, 65D18
Cite as: arXiv:2207.08527 [math.PR]
  (or arXiv:2207.08527v1 [math.PR] for this version)
  https://doi.org/10.48550/arXiv.2207.08527

Submission history

From: Rik Versendaal [view email]
[v1] Mon, 18 Jul 2022 11:44:55 UTC (710 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
math.PR
< prev   |   next >
new | recent | 2022-07
Change to browse by:
math

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?)

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?)