Determinantal random subgraphs - Université Paris Cité Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

Determinantal random subgraphs

Résumé

We define two natural families of determinantal random subgraphs of a finite connected graph, one supported by acyclic spanning subgraphs (spanning forests) with fixed number of components, the other by connected spanning subgraphs with fixed number of independent cycles. Each family generalizes the uniform spanning tree and the generating functions of these probability measures generalize the classical Kirchhoff and Symanzik polynomials. We emphasize the matroidal nature of this construction, as well as possible generalisations.
Fichier principal
Vignette du fichier
determinantal-random-subgraphs.pdf (788.17 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03899489 , version 1 (14-12-2022)

Identifiants

Citer

Adrien Kassel, Thierry Lévy. Determinantal random subgraphs. 2022. ⟨hal-03899489⟩
92 Consultations
34 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More