Image de couverture de livre

Characterizing the fourth-moment phenomenon of monochromatic subgraph counts via influences

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Mani, Nitya, Mikulincer, Dan
Format:	Preprint
Publié:	2024
Sujets:	Probability Combinatorics 60C05
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

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

Large expander subgraphs in high genus triangulations
par: Lions, Tanguy, et autres
Publié: (2026)

Multidisperse Random Sequential Adsorption and Generalizations
par: Fan, Roger, et autres
Publié: (2024)

Central limit theorem for components in meandric systems through high moments
par: Janson, Svante, et autres
Publié: (2023)

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

Extreme local statistics in random graphs: maximum tree extension counts
par: Araújo, Pedro, et autres
Publié: (2023)

When will (game) wars end?
par: Bhatia, Manan, et autres
Publié: (2023)

Maximising homomorphism counts between digraphs
par: Lüchtrath, Lukas, et autres
Publié: (2026)

Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs
par: Bloznelis, Mindaugas, et autres
Publié: (2021)

Upper tails for homomorphism counts in sparse random hypergraphs
par: Cook, Nicholas A., et autres
Publié: (2025)

Determinantal random subgraphs
par: Kassel, Adrien, et autres
Publié: (2022)

A very short proof of Sidorenko's inequality for counts of homomorphism between graphs
par: Lüchtrath, Lukas, et autres
Publié: (2024)

Central limit theorem for crossings in randomly embedded graphs
par: Arenas-Velilla, Santiago, et autres
Publié: (2023)

Limit distributions for cycles of random parking functions
par: Paguyo, J. E., et autres
Publié: (2025)

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

Normal approximation of subgraph counts in the random-connection model
par: Liu, Qingwei, et autres
Publié: (2023)

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

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

The Critical Beta-splitting Random Tree III: The exchangeable partition representation and the fringe tree
par: Aldous, David J., et autres
Publié: (2024)

Bootstrap percolation on the high-dimensional Hamming graph
par: Kang, Mihyun, et autres
Publié: (2024)

A concentration inequality for random combinatorial optimisation problems
par: Danielsson, Joel Larsson
Publié: (2024)

Card guessing and the birthday problem for sampling without replacement
par: He, Jimmy, et autres
Publié: (2021)

On the statistics of random-to-top shuffles
par: Clay, Alexander
Publié: (2026)

On the longest common subsequence of independent random permutations invariant under conjugation
par: Kammoun, Mohamed Slim
Publié: (2019)

A note on mixed Poisson distributions
par: Kuba, Markus
Publié: (2025)

Thresholds and expectation thresholds for larger p
par: Przybyłowski, Tomasz, et autres
Publié: (2023)

A Greedy Chip-firing Game
par: Li, Rupert, et autres
Publié: (2021)

Statistics on monotonically ordered non-crossing partitions
par: Blitvic, Natasha, et autres
Publié: (2025)

Lonely passengers: a short proof
par: Haslegrave, John
Publié: (2025)

An asymptotically optimal bound for the concentration function of a sum of independent integer random variables
par: Kurauskas, Valentas
Publié: (2026)

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

On asymptotic properties of high moments of compound Poisson distribution
par: Khorunzhiy, O.
Publié: (2020)

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)

Normal to Poisson phase transition for subgraph counting in the random-connection model
par: Liu, Qingwei, et autres
Publié: (2024)

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

Asymptotics for the number of bipartite graphs with fixed surplus
par: Clancy Jr, David
Publié: (2024)

Lipschitz functions on weak expanders
par: Krueger, Robert A., et autres
Publié: (2024)