Cover Image

A tail bound for cumulant series for complex functions of independent random variables

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Isaev, Mikhail
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Probability 05C30, 60F05, 05C80
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Asymptotic enumeration of graph factors by cumulant expansion
by: Isaev, Mikhail, et al.
Published: (2025)

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

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

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

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

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

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

The number and structure of connected graphs with a fixed degree sequence
by: Bell, Sasha, et al.
Published: (2026)

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

Limits of chordal graphs with bounded tree-width
by: Castellví, Jordi, et al.
Published: (2023)

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

Monochromatic Subgraphs in Randomly Colored Dense Multiplex Networks
by: Andrade, Mauricio Daros, et al.
Published: (2025)

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

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

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

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

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

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

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

Isomorphisms between random $d$-hypergraphs
by: Lenoir, Théo
Published: (2024)

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

Isomorphisms between dense random graphs
by: Surya, Erlang, et al.
Published: (2023)

Typical structure of sparse exponential random graph models
by: Cook, Nicholas A., et al.
Published: (2022)

Normal approximation for exponential random graphs
by: Fang, Xiao, et al.
Published: (2024)

Limit distributions for cycles of random parking functions
by: Paguyo, J. E., et al.
Published: (2025)

Asymptotics for cliques in scale-free random graphs
by: Daly, Fraser, et al.
Published: (2020)

Conditional central limit theorems for exponential random graphs
by: Fang, Xiao, et al.
Published: (2025)

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

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

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

On the jump of the cover time in random geometric graphs
by: Martinez, Carlos, et al.
Published: (2025)

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

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

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

A new bound in Majority Dynamics on Random Graphs
by: Jaffe, Sean
Published: (2025)

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

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