MCMC sampling of directed flag complexes with fixed undirected graphs

DOI10.1007/S41468-024-00178-5MaRDI QIDQ6650246zbMATH OpenFDO

Authors Florian Unger, Jonathan Krebs

Publication date 6 December 2024

Published in Journal of Applied and Computational Topology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S41468-024-00178-5

zbMATH Keywords

TDAMarkov chainconnectomenull modelflipping problem

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Directed graphs (digraphs), tournaments (05C20) Neural networks for/in biological studies, artificial life and related topics (92B20)

Recommendations

• Constructing and sampling directed graphs with given degree sequences
• Simplex closing probabilities in directed graphs
• Uniform sampling of directed and undirected graphs conditional on vertex connectivity
• Tailored graph ensembles as proxies or null models for real networks II: Results on directed graphs
• A uniform random graph model for directed acyclic networks and its effect on motif-finding

Cites work

• A random persistence diagram generator
• Clique topology reveals intrinsic geometric structure in neural correlations
• Configuring random graph models with fixed degree sequences
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Simplex closing probabilities in directed graphs

Cited in

(1)

• Simplex closing probabilities in directed graphs

This page was built for publication: MCMC sampling of directed flag complexes with fixed undirected graphs

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