Imagen de Portada

From flip processes to dynamical systems on graphons

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Garbe, Frederik, Hladký, Jan, Šileikis, Matas, Skerman, Fiona
Formato:	Preprint
Publicado:	2022
Materias:	Combinatorics Probability 05C80 F.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Prominent examples of flip processes
por: Araújo, Pedro, et al.
Publicado: (2022)

On the upper tail of star counts in random graphs
por: Akhmejanova, Margarita, et al.
Publicado: (2025)

Note on edge expansion and modularity in preferential attachment graphs
por: McDiarmid, Colin, et al.
Publicado: (2026)

On the strength of connectedness of unions of random graphs
por: Bloznelis, Mindaugas
Publicado: (2026)

Extreme local statistics in random graphs: maximum tree extension counts
por: Araújo, Pedro, et al.
Publicado: (2023)

Modularity and random graphs
por: McDiarmid, Colin, et al.
Publicado: (2025)

Characterization of flip process rules with the same trajectories
por: Hng, Eng Keat
Publicado: (2023)

A new density limit for unanimity in majority dynamics on random graphs
por: Kim, Jeong Han, et al.
Publicado: (2025)

The bunkbed conjecture is false
por: Gladkov, Nikita, et al.
Publicado: (2024)

The asymptotic $χ$-boundedness of hereditary families
por: Reed, Bruce, et al.
Publicado: (2025)

A short proof of a central limit theorem for the order of the giant component and $k$-core
por: Anastos, Michael, et al.
Publicado: (2025)

Are giants in random digraphs `almost' local?
por: van der Hofstad, Remco, et al.
Publicado: (2024)

New bounds on the modularity of $G(n,p)$
por: Rybarczyk, Katarzyna, et al.
Publicado: (2025)

Is it easier to count communities than find them?
por: Rush, Cynthia, et al.
Publicado: (2022)

The law of the circumference of sparse binomial random graphs
por: Anastos, Michael, et al.
Publicado: (2025)

A tail bound for cumulant series for complex functions of independent random variables
por: Isaev, Mikhail
Publicado: (2025)

Normal approximation for number of edges in random intersection graphs
por: Rybarczyk, Katarzyna, et al.
Publicado: (2025)

Normal approximation for subgraph count in random hypergraphs
por: Michalczuk, Wojciech, et al.
Publicado: (2024)

Sparse random graphs with many triangles
por: Chakraborty, Suman, et al.
Publicado: (2021)

Tangled Paths: A Random Graph Model from Mallows Permutations
por: Enright, Jessica, et al.
Publicado: (2021)

Spatiotemporal Hawkes processes with a graphon-induced connectivity structure
por: Baars, Justin, et al.
Publicado: (2024)

Counting subgraphs in bounded-size Achlioptas processes
por: Kang, Mihyun, et al.
Publicado: (2026)

Behavior of the Minimum Degree Throughout the $d$-process
por: Hofstad, Jakob
Publicado: (2023)

The process of fluctuations of the giant component of an Erdős-Rényi graph
por: Enriquez, Nathanaël, et al.
Publicado: (2023)

Almost regular subgraphs under spectral radius constrains
por: Xu, Weilun, et al.
Publicado: (2024)

Majority dynamics on random graphs: the multiple states case
por: Chellig, Jordan, et al.
Publicado: (2023)

A note on locating-dominating sets in twin-free graphs
por: Bousquet, Nicolas, et al.
Publicado: (2024)

A large deviation principle for block models
por: Borgs, Christian, et al.
Publicado: (2020)

Upper tail bounds for irregular graphs
por: Basak, Anirban, et al.
Publicado: (2025)

Separating Matchings in Cubic Graphs
por: Gutiérrez, Juan, et al.
Publicado: (2026)

On treewidth and maximum cliques
por: Chudnovsky, Maria, et al.
Publicado: (2024)

Models of random spanning trees
por: Babson, Eric, et al.
Publicado: (2024)

Majority dynamics on sparse random graphs
por: Chakraborti, Debsoumya, et al.
Publicado: (2021)

Hamiltonian laceability with a set of faulty edges in hypercubes
por: Ali, Abid, et al.
Publicado: (2025)

The minimum degree of minimal $k$-factor-critical claw-free graphs*
por: Guo, Jing, et al.
Publicado: (2023)

Hamiltonian paths extending a set of matchings in hypercubes
por: Ali, Abid, et al.
Publicado: (2025)

Non-exchangeable mean-field theory for adaptive weights: propagation of dissociatedness and graphon sampling lemma
por: Zhou, Datong
Publicado: (2025)

Quantitative Edge Eigenvector Universality for Random Regular Graphs: Berry-Esseen Bounds with Explicit Constants
por: Nagel, Leonhard
Publicado: (2025)

On Strict Brambles
por: Lardas, Emmanouil, et al.
Publicado: (2022)

Local limit theorem for joint subgraph counts
por: Sah, Ashwin, et al.
Publicado: (2024)