Cargando…
Long paths and connectivity in 1‐independent random graphs
A probability measure [Formula: see text] on the subsets of the edge set of a graph G is a 1‐independent probability measure (1‐ipm) on G if events determined by edge sets that are at graph distance at least 1 apart in G are independent. Given a 1‐ipm [Formula: see text] , denote by [Formula: see te...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
John Wiley & Sons, Inc.
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7702180/ https://www.ncbi.nlm.nih.gov/pubmed/33328712 http://dx.doi.org/10.1002/rsa.20972 |