相关论文: Exploring hypergraphs with martingales

We describe a probabilistic methodology, based on random walk estimates, to obtain exponential upper bounds for the probability of observing unusually small maximal components in two classical (near-)critical random graph models. More…

If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…

Many important theorems in combinatorics, such as Szemer\'edi's theorem on arithmetic progressions and the Erd\H{o}s-Stone Theorem in extremal graph theory, can be phrased as statements about independent sets in uniform hypergraphs. In…

We study the asymptotics for sparse exponential random graph models where the parameters may depend on the number of vertices of the graph. We obtain exact estimates for the mean and variance of the limiting probability distribution and the…

Let A be a minor-closed class of labelled graphs, and let G_n be a random graph sampled uniformly from the set of n-vertex graphs of A. When n is large, what is the probability that G_n is connected? How many components does it have? How…

Reliability evaluation and fault tolerance of an interconnection network of some parallel and distributed systems are discussed separately under various link-faulty hypotheses in terms of different $\mathcal{P}$-conditional…

We study star-based symmetries in uniform hypergraphs and their consequences for matrices whose entries depend only on vertex stars. Such matrices admit a deterministic decomposition into a global component and a local component supported…

We prove two conjectures in spectral extremal graph theory involving the linear combinations of graph eigenvalues. Let $\lambda_1(G)$ be the largest eigenvalue of the adjacency matrix of a graph $G$, and $\bar{G}$ be the complement of $G$.…

This paper is concerned with asymptotic behavior of a variety of functionals of increments of continuous semimartingales. Sampling times are assumed to follow a rather general discretization scheme. If an underlying semimartingale is…

An asymptotic theory is developed for computing volumes of regions in the parameter space of a directed Gaussian graphical model that are obtained by bounding partial correlations. We study these volumes using the method of real log…

The upper tail problem in the Erd\H{o}s--R\'enyi random graph $G\sim\mathcal{G}_{n,p}$ asks to estimate the probability that the number of copies of a graph $H$ in $G$ exceeds its expectation by a factor $1+\delta$. Chatterjee and Dembo…

In their seminal paper introducing the theory of random graphs, Erd\H{o}s and R\'{e}nyi considered the evolution of the structure of a random subgraph of $K_n$ as the density increases from $0$ to $1$, identifying two key points in this…

In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs…

A variety of estimators for the parameters of the Generalized Pareto distribution, the approximating distribution for excesses over a high threshold, have been proposed, always assuming the underlying data to be independent. We recently…

We prove that every connected strongly regular graph on sufficiently many vertices is Hamiltonian. We prove this by showing that, apart from three families, connected strongly regular graphs are (highly) pseudo-random. Our results suggest a…

The purpose of this paper is to investigate the asymptotic behavior of random walks on three-dimensional crystal structures. We focus our attention on the 1h structure of the ice and the 2h structure of graphite. We establish the strong law…

We study a discrete Laplace operator $\Delta$ on percolation subgraphs of an infinite graph. The ball volume is assumed to grow at most polynomially. We are interested in the behavior of the integrated density of states near the lower…

We study the size of the largest component of two models of random graphs with prescribed degree sequence, the configuration model (CM) and the uniform model (UM), in the (barely) subcritical regime. For the CM, we give upper bounds that…

Most statistical models for networks focus on pairwise interactions between nodes. However, many real-world networks involve higher-order interactions among multiple nodes, such as co-authors collaborating on a paper. Hypergraphs provide a…

Let $U_n$ be an $n \times n$ Haar unitary matrix. In this paper, the asymptotic normality and independence of $\Tr U_n, \Tr U_n^2, ..., \Tr U_n^k$ are shown by using elementary methods. More generally, it is shown that the renormalized…