Image de couverture de livre

Monochromatic Subgraphs in Randomly Colored Dense Multiplex Networks

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Andrade, Mauricio Daros, Bhattacharya, Bhaswar B.
Format:	Preprint
Publié:	2025
Sujets:	Probability Combinatorics 05C15, 60C05, 60F05, 60H05, 05C80
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Higher-Order Graphon Theory: Fluctuations, Degeneracies, and Inference
par: Chatterjee, Anirban, et autres
Publié: (2024)

Two-Point Concentration of the Domination Number of Random Graphs
par: Bohman, Tom, et autres
Publié: (2024)

Self-Reinforced Preferential Attachment
par: Dahiya, Yogesh, et autres
Publié: (2025)

The largest common subtree of two random trees
par: Angel, Omer, et autres
Publié: (2025)

Upper tail bounds for irregular graphs
par: Basak, Anirban, et autres
Publié: (2025)

On the upper tail of star counts in random graphs
par: Akhmejanova, Margarita, et autres
Publié: (2025)

A large deviation principle for block models
par: Borgs, Christian, et autres
Publié: (2020)

Upper tails of subgraph counts in directed random graphs
par: Park, Jiyun
Publié: (2024)

Local limit theorem for joint subgraph counts
par: Sah, Ashwin, et autres
Publié: (2024)

A Galton-Watson tree approach to local limits of permutations avoiding a pattern of length three
par: Park, Jungeun, et autres
Publié: (2024)

Tight universal bounds on the height times the width of random trees
par: Donderwinkel, Serte, et autres
Publié: (2024)

Critical trees are neither too short nor too fat
par: Addario-Berry, Louigi, et autres
Publié: (2023)

Fluctuations of the Horton-Strahler number of stable Galton-Watson trees
par: Khanfir, Robin
Publié: (2024)

Approximation of Subgraph Counts in the Uniform Attachment Model
par: Björklund, Johan, et autres
Publié: (2023)

Large Components and Trees of Random Mappings
par: Mutafchiev, Ljuben, et autres
Publié: (2025)

On the Deepest Cycle of a Random Mapping
par: Mutafchiev, Ljuben, et autres
Publié: (2023)

A short proof of a central limit theorem for the order of the giant component and $k$-core
par: Anastos, Michael, et autres
Publié: (2025)

Asymptotics for the harmonic descent chain and applications to critical beta-splitting trees
par: Brandenberger, Anna, et autres
Publié: (2025)

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

The law of the circumference of sparse binomial random graphs
par: Anastos, Michael, et autres
Publié: (2025)

A tail bound for cumulant series for complex functions of independent random variables
par: Isaev, Mikhail
Publié: (2025)

Normal approximation for number of edges in random intersection graphs
par: Rybarczyk, Katarzyna, et autres
Publié: (2025)

Normal approximation for subgraph count in random hypergraphs
par: Michalczuk, Wojciech, et autres
Publié: (2024)

Graph connectivity with fixed endpoints in the random-connection model
par: Liu, Qingwei, et autres
Publié: (2023)

What is The Probability That A Random Graph With A Given Degree Sequence is Connected?
par: Addario-Berry, Louigi, et autres
Publié: (2026)

The multi-level friendship paradox for sparse random graphs
par: Hazra, Rajat Subhra, et autres
Publié: (2025)

Geometry of Random Cayley Graphs of Abelian Groups
par: Hermon, Jonathan, et autres
Publié: (2021)

The Horton-Strahler Number of Conditioned Galton-Watson Trees
par: Brandenberger, Anna M., et autres
Publié: (2020)

Asymptotic normality for general subtree counts in conditioned Galton--Watson trees
par: Rakotoniaina, Fameno, et autres
Publié: (2026)

Lecture Notes on Edge Universality for Random Regular Graphs
par: Huang, Jiaoyang, et autres
Publié: (2026)

Isomorphisms between dense random graphs
par: Surya, Erlang, et autres
Publié: (2023)

Random friend trees
par: Berry, Louigi Addario, et autres
Publié: (2024)

Random intersection graphs with communities
par: van der Hofstad, Remco, et autres
Publié: (2018)

A novel approach to the giant component fluctuations
par: Corujo, Josué, et autres
Publié: (2024)

The spread of fire on a random multigraph
par: Goldschmidt, Christina, et autres
Publié: (2017)

The clique chromatic number of sparse random graphs
par: Fernandez V, Manuel, et autres
Publié: (2024)

On the concentration of the chromatic number of random graphs
par: Surya, Erlang, et autres
Publié: (2022)

Universal diameter bounds for random graphs with given degrees
par: Addario-Berry, Louigi, et autres
Publié: (2025)

Scaling limits of random graphs
par: Addario-Berry, Louigi, et autres
Publié: (2024)

A note on Two-Point Concentration of the Independence Number of $G_{n,m}$
par: Bohman, Tom, et autres
Publié: (2024)