Imagen de Portada

Monochromatic Subgraphs in Randomly Colored Dense Multiplex Networks

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Andrade, Mauricio Daros, Bhattacharya, Bhaswar B.
Formato:	Preprint
Publicado:	2025
Materias:	Probability Combinatorics 05C15, 60C05, 60F05, 60H05, 05C80
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Higher-Order Graphon Theory: Fluctuations, Degeneracies, and Inference
por: Chatterjee, Anirban, et al.
Publicado: (2024)

Two-Point Concentration of the Domination Number of Random Graphs
por: Bohman, Tom, et al.
Publicado: (2024)

Self-Reinforced Preferential Attachment
por: Dahiya, Yogesh, et al.
Publicado: (2025)

The largest common subtree of two random trees
por: Angel, Omer, et al.
Publicado: (2025)

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

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

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

Upper tails of subgraph counts in directed random graphs
por: Park, Jiyun
Publicado: (2024)

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

A Galton-Watson tree approach to local limits of permutations avoiding a pattern of length three
por: Park, Jungeun, et al.
Publicado: (2024)

Tight universal bounds on the height times the width of random trees
por: Donderwinkel, Serte, et al.
Publicado: (2024)

Critical trees are neither too short nor too fat
por: Addario-Berry, Louigi, et al.
Publicado: (2023)

Fluctuations of the Horton-Strahler number of stable Galton-Watson trees
por: Khanfir, Robin
Publicado: (2024)

Approximation of Subgraph Counts in the Uniform Attachment Model
por: Björklund, Johan, et al.
Publicado: (2023)

Large Components and Trees of Random Mappings
por: Mutafchiev, Ljuben, et al.
Publicado: (2025)

On the Deepest Cycle of a Random Mapping
por: Mutafchiev, Ljuben, et al.
Publicado: (2023)

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)

Asymptotics for the harmonic descent chain and applications to critical beta-splitting trees
por: Brandenberger, Anna, et al.
Publicado: (2025)

Fringe trees of Patricia tries, compressed binary search trees, and three other random full binary trees
por: Janson, Svante
Publicado: (2024)

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)

Graph connectivity with fixed endpoints in the random-connection model
por: Liu, Qingwei, et al.
Publicado: (2023)

What is The Probability That A Random Graph With A Given Degree Sequence is Connected?
por: Addario-Berry, Louigi, et al.
Publicado: (2026)

The multi-level friendship paradox for sparse random graphs
por: Hazra, Rajat Subhra, et al.
Publicado: (2025)

Geometry of Random Cayley Graphs of Abelian Groups
por: Hermon, Jonathan, et al.
Publicado: (2021)

The Horton-Strahler Number of Conditioned Galton-Watson Trees
por: Brandenberger, Anna M., et al.
Publicado: (2020)

Asymptotic normality for general subtree counts in conditioned Galton--Watson trees
por: Rakotoniaina, Fameno, et al.
Publicado: (2026)

Lecture Notes on Edge Universality for Random Regular Graphs
por: Huang, Jiaoyang, et al.
Publicado: (2026)

Isomorphisms between dense random graphs
por: Surya, Erlang, et al.
Publicado: (2023)

Random friend trees
por: Berry, Louigi Addario, et al.
Publicado: (2024)

Random intersection graphs with communities
por: van der Hofstad, Remco, et al.
Publicado: (2018)

A novel approach to the giant component fluctuations
por: Corujo, Josué, et al.
Publicado: (2024)

The spread of fire on a random multigraph
por: Goldschmidt, Christina, et al.
Publicado: (2017)

The clique chromatic number of sparse random graphs
por: Fernandez V, Manuel, et al.
Publicado: (2024)

On the concentration of the chromatic number of random graphs
por: Surya, Erlang, et al.
Publicado: (2022)

Universal diameter bounds for random graphs with given degrees
por: Addario-Berry, Louigi, et al.
Publicado: (2025)

Scaling limits of random graphs
por: Addario-Berry, Louigi, et al.
Publicado: (2024)

A note on Two-Point Concentration of the Independence Number of $G_{n,m}$
por: Bohman, Tom, et al.
Publicado: (2024)