Mixing time bounds for edge flipping on regular graphs.
Yunus Emre DemirciÜmit IslakAlperen ÖzdemirPublished in: J. Appl. Probab. (2023)
Keyphrases
- weighted graph
- undirected graph
- upper bound
- edge detection
- lower bound
- edge weights
- edge information
- graph matching
- minimum spanning trees
- graph model
- directed graph
- series parallel
- tight bounds
- upper and lower bounds
- edge detector
- graph structure
- graph mining
- worst case
- adjacency graph
- graph representation
- confidence bounds
- graph theoretic
- error bounds
- pairwise
- average case
- lower and upper bounds
- vc dimension
- graph partitioning