Cover Image

Normal approximation of the numbers of isolated edges and isolated 2-stars in uniform simple graphs with given vertex degrees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Imai, Ryo
Format:	Preprint
Published:	2026
Subjects:	Probability Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Large fringe trees for random trees with given vertex degrees
by: Ojeda, Gabriel Berzunza, et al.
Published: (2026)

Diameters and mixing times for giant components of random graphs with given degrees
by: Addario-Berry, Louigi, et al.
Published: (2026)

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

Randomized algorithms to generate hypergraphs with given degree sequences
by: Ascolese, Michela, et al.
Published: (2024)

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

Triangle processes on graphs with given degree sequence
by: Cooper, Colin, et al.
Published: (2023)

On the isolation number of graphs with minimum degree four
by: Goddard, Wayne, et al.
Published: (2025)

Random walks on edge colored random graphs
by: Cooper, Colin, et al.
Published: (2024)

Speeding up random walk mixing by starting from a uniform vertex
by: Díaz, Alberto Espuny, et al.
Published: (2022)

Anticoncentration of random spanning trees in graphs with large minimum degree
by: Bitonti, Veronica, et al.
Published: (2026)

The Lovász number of random circulant graphs
by: Bandeira, Afonso S., et al.
Published: (2025)

Do random initial degrees suppress concentration in preferential attachment graphs?
by: Makai, T., et al.
Published: (2024)

On the number of spanning trees in random regular graphs
by: Greenhill, Catherine, et al.
Published: (2013)

Universality of the matching number in percolated regular graphs
by: Diskin, Sahar, et al.
Published: (2025)

The chromatic number of very dense random graphs
by: Yan, Zhifei
Published: (2024)

On the chromatic number of random triangle-free graphs
by: Mizgerd, Clayton, et al.
Published: (2025)

The number of descendants in a preferential attachment graph
by: Janson, Svante, et al.
Published: (2024)

Components, large and small, are as they should be II: supercritical percolation on regular graphs of constant degree
by: Diskin, Sahar, et al.
Published: (2024)

Components, large and small, are as they should be I: supercritical percolation on regular graphs of growing degree
by: Diskin, Sahar, et al.
Published: (2024)

Lower bounds for the isoperimetric numbers of random regular graphs
by: Kolesnik, Brett, et al.
Published: (2013)

A local limit theorem for the edge counts of random induced subgraphs of a random graph
by: Balister, Paul, et al.
Published: (2025)

Optimal graphons in the edge-2star model
by: Radin, Charles, et al.
Published: (2023)

Sharp relations between volume growth, isoperimetry and escape probability in vertex-transitive graphs
by: Tessera, Romain, et al.
Published: (2020)

Spanning trees of bounded degree in random geometric graphs
by: Anastos, Michael, et al.
Published: (2025)

Triangle-free $d$-degenerate graphs have small fractional chromatic number
by: Martinsson, Anders
Published: (2025)

A central limit theorem for the matching number of a sparse random graph
by: Glasgow, Margalit, et al.
Published: (2024)

Dynamic random graphs with vertex removal
by: Díaz, Josep, et al.
Published: (2022)

The circumference of a graph with given minimum degree and clique number
by: Chen, Na, et al.
Published: (2025)

Discrete Poincaré inequalities and universal approximators for random graphs
by: Altschuler, Dylan J., et al.
Published: (2025)

Large random matrices with given margins
by: Lyu, Hanbaek, et al.
Published: (2024)

The maximum number of cliques in graphs with given fractional matching number and minimum degree
by: Li, Chengli, et al.
Published: (2024)

The distance spectral radius of $k$-uniform hypertrees with given number of vertices of maximum degree
by: Liu, Xiaoqi, et al.
Published: (2024)

Non-uniform Kahn-Kalai, spread, variants, and applications
by: De Silva, Thinula, et al.
Published: (2026)

Persistence probabilities for MA(1) sequences with uniform innovations
by: Aurzada, Frank, et al.
Published: (2025)

On cubic vertex-transitive graphs of given girth
by: Dobson, Ted, et al.
Published: (2025)

Realizability of hypergraphs and high-dimensional contingency tables with random degrees and marginals
by: Christo, Nicholas, et al.
Published: (2024)

Colored stochastic vertex models with U-turn boundary
by: Zhong, Chenyang
Published: (2024)

Poisson approximation for large permutation groups
by: Diaconis, Persi, et al.
Published: (2024)

Evolution of discordant edges in the voter model on random sparse digraphs
by: Capannoli, Federico
Published: (2024)

Asymptotics of returns to the coordinate hyperplanes for conditioned simple random walks
by: Garbit, Rodolphe, et al.
Published: (2025)