Prominent examples of flip processes
Fuente:
arXiv
Saved in:
| Main Authors: | Araújo, Pedro, Hladký, Jan, Hng, Eng Keat, Šileikis, Matas |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
From flip processes to dynamical systems on graphons
by: Garbe, Frederik, et al.
Published: (2022)
by: Garbe, Frederik, et al.
Published: (2022)
Characterization of flip process rules with the same trajectories
by: Hng, Eng Keat
Published: (2023)
by: Hng, Eng Keat
Published: (2023)
Extreme local statistics in random graphs: maximum tree extension counts
by: Araújo, Pedro, et al.
Published: (2023)
by: Araújo, Pedro, et al.
Published: (2023)
On the strength of connectedness of unions of random graphs
by: Bloznelis, Mindaugas
Published: (2026)
by: Bloznelis, Mindaugas
Published: (2026)
On the upper tail of star counts in random graphs
by: Akhmejanova, Margarita, et al.
Published: (2025)
by: Akhmejanova, Margarita, et al.
Published: (2025)
New bounds on the modularity of $G(n,p)$
by: Rybarczyk, Katarzyna, et al.
Published: (2025)
by: Rybarczyk, Katarzyna, et al.
Published: (2025)
Note on edge expansion and modularity in preferential attachment graphs
by: McDiarmid, Colin, et al.
Published: (2026)
by: McDiarmid, Colin, et al.
Published: (2026)
Are giants in random digraphs `almost' local?
by: van der Hofstad, Remco, et al.
Published: (2024)
by: van der Hofstad, Remco, et al.
Published: (2024)
The asymptotic $χ$-boundedness of hereditary families
by: Reed, Bruce, et al.
Published: (2025)
by: Reed, Bruce, et al.
Published: (2025)
The bunkbed conjecture is false
by: Gladkov, Nikita, et al.
Published: (2024)
by: Gladkov, Nikita, et al.
Published: (2024)
Tangled Paths: A Random Graph Model from Mallows Permutations
by: Enright, Jessica, et al.
Published: (2021)
by: Enright, Jessica, et al.
Published: (2021)
Graphon branching processes and fractional isomorphism
by: Hladký, Jan, et al.
Published: (2024)
by: Hladký, Jan, et al.
Published: (2024)
Models of random spanning trees
by: Babson, Eric, et al.
Published: (2024)
by: Babson, Eric, et al.
Published: (2024)
New results on graph matching from degree preserving growth
by: Erdős, Péter L., et al.
Published: (2022)
by: Erdős, Péter L., et al.
Published: (2022)
Modularity of preferential attachment graphs
by: Rybarczyk, Katarzyna, et al.
Published: (2025)
by: Rybarczyk, Katarzyna, et al.
Published: (2025)
Label propagation on binomial random graphs
by: Kiwi, Marcos, et al.
Published: (2023)
by: Kiwi, Marcos, et al.
Published: (2023)
A new density limit for unanimity in majority dynamics on random graphs
by: Kim, Jeong Han, et al.
Published: (2025)
by: Kim, Jeong Han, et al.
Published: (2025)
Constrained graph generation: Preserving diameter and clustering coefficient simultaneously
by: Ferenczi, Dávid, et al.
Published: (2026)
by: Ferenczi, Dávid, et al.
Published: (2026)
Wasserstein distances between ERGMs and Erdős-Rényi models
by: Winstein, Vilas
Published: (2026)
by: Winstein, Vilas
Published: (2026)
Census Dual Graphs: Properties and Random Graph Models
by: Anderson, Sara, et al.
Published: (2026)
by: Anderson, Sara, et al.
Published: (2026)
Action convergence of general hypergraphs and tensors
by: Zucal, Giulio
Published: (2023)
by: Zucal, Giulio
Published: (2023)
On the number of Hamiltonian cycles in the generalized Petersen graph
by: Haugland, Jan Kristian
Published: (2025)
by: Haugland, Jan Kristian
Published: (2025)
Graph covers and semi-covers: Who is stronger?
by: Kratochvil, Jan, et al.
Published: (2025)
by: Kratochvil, Jan, et al.
Published: (2025)
Modularity of random intersection graphs
by: Rybarczyk, Katarzyna
Published: (2025)
by: Rybarczyk, Katarzyna
Published: (2025)
Counting subgraphs in bounded-size Achlioptas processes
by: Kang, Mihyun, et al.
Published: (2026)
by: Kang, Mihyun, et al.
Published: (2026)
Behavior of the Minimum Degree Throughout the $d$-process
by: Hofstad, Jakob
Published: (2023)
by: Hofstad, Jakob
Published: (2023)
Almost regular subgraphs under spectral radius constrains
by: Xu, Weilun, et al.
Published: (2024)
by: Xu, Weilun, et al.
Published: (2024)
Sharp Square Root Bounds for Edge Eigenvector Universality in Sparse Random Regular Graphs
by: Nagel, Leonhard
Published: (2025)
by: Nagel, Leonhard
Published: (2025)
A note on locating-dominating sets in twin-free graphs
by: Bousquet, Nicolas, et al.
Published: (2024)
by: Bousquet, Nicolas, et al.
Published: (2024)
Limits of Weighted Graphs via Random Quotients
by: Levin, Eitan, et al.
Published: (2025)
by: Levin, Eitan, et al.
Published: (2025)
Ordering and Convergence of Large Degrees in Random Hyperbolic Graphs
by: Gassmann, Loïc
Published: (2024)
by: Gassmann, Loïc
Published: (2024)
Quantitative Edge Eigenvector Universality for Random Regular Graphs: Berry-Esseen Bounds with Explicit Constants
by: Nagel, Leonhard
Published: (2025)
by: Nagel, Leonhard
Published: (2025)
Distant 2-Colored Components on Embeddings Part III: The General Case
by: Nevin, Joshua
Published: (2022)
by: Nevin, Joshua
Published: (2022)
Distant 2-Colored Components on Embeddings Part I: Connecting Faces
by: Nevin, Joshua
Published: (2022)
by: Nevin, Joshua
Published: (2022)
Some Extensions of Thomassen's Theorem to Longer Paths
by: Nevin, Joshua
Published: (2022)
by: Nevin, Joshua
Published: (2022)
Distant 2-Colored Components on Embeddings Part II: The Short-Inseparable Case
by: Nevin, Joshua
Published: (2022)
by: Nevin, Joshua
Published: (2022)
Graph Configurations and Independent Bondage Numbers of Planar Graphs
by: Gamlath, E. G. K. M., et al.
Published: (2024)
by: Gamlath, E. G. K. M., et al.
Published: (2024)
Burling graphs revisited, part II: Structure
by: Pournajafi, Pegah, et al.
Published: (2021)
by: Pournajafi, Pegah, et al.
Published: (2021)
On Total Bondage Number of Graphs
by: Gamlath, E. G. K. M., et al.
Published: (2024)
by: Gamlath, E. G. K. M., et al.
Published: (2024)
Palette Sparsification via FKNP
by: Ashvinkumar, Vikrant, et al.
Published: (2024)
by: Ashvinkumar, Vikrant, et al.
Published: (2024)
Similar Items
-
From flip processes to dynamical systems on graphons
by: Garbe, Frederik, et al.
Published: (2022) -
Characterization of flip process rules with the same trajectories
by: Hng, Eng Keat
Published: (2023) -
Extreme local statistics in random graphs: maximum tree extension counts
by: Araújo, Pedro, et al.
Published: (2023) -
On the strength of connectedness of unions of random graphs
by: Bloznelis, Mindaugas
Published: (2026) -
On the upper tail of star counts in random graphs
by: Akhmejanova, Margarita, et al.
Published: (2025)