Connecting probability for random bounded-range one-dimensional network

DOI10.1007/S11565-024-00508-6MaRDI QIDQ6630759zbMATH OpenFDO

Authors Lorenzo Federico

Publication date 31 October 2024

Published in Annali dell'Università di Ferrara. Sezione VII. Scienze Matematiche (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11565-024-00508-6

zbMATH Keywords

connectivityone-dimensional networkrandom graphsspread-out percolation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Recommendations

• Connection probabilities in Poisson random graphs with uniformly bounded edges
• On connectivity in random graph models with limited dependencies
• The emergence of a giant component in one-dimensional inhomogeneous networks with long-range effects
• One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity
• When are random graphs connected

Cites work

• Beitrag zur Theorie des Ferromagnetismus
• Connectivity of Poissonian inhomogeneous random multigraphs
• Discontinuity of the magnetization in one-dimensional \(1/| x-y| ^ 2\) Ising and Potts models.
• Discontinuity of the percolation density in one dimensional \(1/| x- y| ^ 2\) percolation models
• scientific article; zbMATH DE number 1254188 (Why is no real title available?)
• On the spread-out limit for bond and continuum percolation
• Structural Complexity of One-Dimensional Random Geometric Graphs
• The critical probability of bond percolation on the square lattice equals 1/2

This page was built for publication: Connecting probability for random bounded-range one-dimensional network

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