Sampling random graph homomorphisms and applications to network data analysis

Cites Work

Monte Carlo strategies in scientific computing.
Limits of dense graph sequences
Recurrence of distributional limits of finite planar graphs
Topology and data
Computational topology. An introduction
Barcodes: The persistent topology of data
Stability of persistence diagrams
Emergence of Scaling in Random Networks
Title not available (Why is that?)
Statistical Analysis of Network Data with R
Computing persistent homology
Collective dynamics of ‘small-world’ networks
A Theorem on Boolean Matrices
Structure of triadic relations in multiplex networks
Improved bounds for sampling colorings
A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
Title not available (Why is that?)
Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
Characterization, stability and convergence of hierarchical clustering methods
Concentration inequalities for Markov chains by Marton couplings and spectral methods
Collisions Among Random Walks on a Graph
Some dimension-free features of vector-valued martingales
Title not available (Why is that?)
Authorship Attribution Through Function Word Adjacency Networks
Networks
Classifying clustering schemes
Rips filtrations for quasimetric spaces and asymmetric functions with stability results
A functorial Dowker theorem and persistent homology of asymmetric networks
Persistent Path Homology of Directed Networks
Very rapid mixing of the Glauber dynamics for proper colorings on bounded‐degree graphs
Graphon Signal Processing
Title not available (Why is that?)

This page was built for publication: Sampling random graph homomorphisms and applications to network data analysis

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