相关论文: Two-Source Dispersers for Polylogarithmic Entropy …

The size Ramsey number of a graph $H$ is defined as the minimum number of edges in a graph $G$ such that there is a monochromatic copy of $H$ in every two-coloring of $E(G)$. The size Ramsey number was introduced by Erd\H{o}s, Faudree,…

In this paper, we propose several graph-based extensions of the Douglas-Rachford splitting (DRS) method to solve monotone inclusion problems involving the sum of $N$ maximal monotone operators. Our construction is based on a two-layer…

A central problem in extremal graph theory is to estimate, for a given graph $H$, the number of $H$-free graphs on a given set of $n$ vertices. In the case when $H$ is not bipartite, fairly precise estimates on this number are known. In…

We consider two variants of the induced subgraph isomorphism problem for two independent binomial random graphs with constant edge-probabilities p_1,p_2. In particular, (i) we prove a sharp threshold result for the appearance of G_{n,p_1}…

In 1847, Kirkman proved that there exists a Steiner triple system on $n$ vertices (equivalently a triangle decomposition of the edges of $K_n$) whenever $n$ satisfies the necessary divisibility conditions (namely $n\equiv 1,3 \mod 6$). In…

We explore the properties of two-point cosmic propagators when Perturbation Theory (PT) loop corrections are consistently taken into account. We show in particular how the interpolation scheme proposed in arXiv:1112.3895 can be explicitly…

The main contribution of this work is a new type of graph product, which we call the {\it zig-zag product}. Taking a product of a large graph with a small graph, the resulting graph inherits (roughly) its size from the large one, its degree…

Commonly observed patterns typically follow a few distinct families of probability distributions. Over one hundred years ago, Karl Pearson provided a systematic derivation and classification of the common continuous distributions. His…

Abstract. The purpose of this paper is twofold. We introduce the theory of random tensors, which naturally extends the method of random averaging operators in our earlier work arXiv:1910.08492, to study the propagation of randomness under…

Let H(k) be the smallest N such that every finite coloring of [N] contains a monochromatic or rainbow k-term arithmetic progression. Erd\H{o}s and Graham asked whether $H(k)^{1/k}/k \to \infty$ (Problem #190 of the Erd\H{o}s Problems…

Let $\eta_i, i=1,..., n$ be iid Bernoulli random variables, taking values $\pm 1$ with probability 1/2. Given a multiset $V$ of $n$ elements $v_1, ..., v_n$ of an additive group $G$, we define the \emph{concentration probability} of $V$ as…

William Thurston (1946-2012) gave a combinatorial characterization for generic branched self-coverings of the two-sphere by associating a planar graph to them 10.48550/arXiv.1502.04760. By generalizing the notion of local balancing, the…

Building upon the theory of graph limits and the Aldous-Hoover representation and inspired by Panchenko's work on asymptotic Gibbs measures (Annals of Probability 2013), we construct continuous embeddings of discrete probability…

Identifying the diffusion source in complex networks is critical for understanding and controlling epidemic spread. In realistic settings, full observation of node states is rarely available, making sensor-based source detection a practical…

The main purpose of this article is to introduce a comprehensive, unified theory of the geometry of all connections. We show that one can study a connection via a certain, closely associated second-order differential equation. One of the…

Let H be a k-uniform hypergraph whose vertices are the integers 1,...,N. We say that H contains a monotone path of length n if there are x_1 < x_2 < ... < x_{n+k-1} so that H contains all n edges of the form {x_i,x_{i+1},...,x_{i+k-1}}. Let…

Exponential families comprise a broad class of statistical models and parametric families like normal distributions, binomial distributions, gamma distributions or exponential distributions. Thereby the formal representation of its…

The higher-order corrections become increasingly important with experiments reaching sub-percent level of uncertainty as they look for physics beyond the Standard Model. Our goal is to address the full set of two-loop electroweak…

We study a generalisation of the bipartite Ramsey numbers to blowups of graphs. For a graph $G$, denote the $t$-blowup of $G$ by $G[t]$. We say that $G$ is $r$-Ramsey for $H$, and write $G \stackrel{r}{\rightarrow} H$, if every…

Fix integers $d,r\ge 2$ and suppose that the edge set of the $d$-fold Cartesian product of the $N$-clique $K_N^d$ is $r$-colored. We show that there is a copy of $K_n^d$ whose edges in each direction are monochromatic provided $N > 2^{2^{c…