相关论文: Universality in prelimiting tail behavior for regu…

Is detecting a $k$-clique in $k$-partite regular (hyper-)graphs as hard as in the general case? Intuition suggests yes, but proving this -- especially for hypergraphs -- poses notable challenges. Concretely, we consider a strong notion of…

Quantitative understanding of human behaviors provides elementary comprehension of the complexity of many human-initiated systems. A basic assumption embedded in the previous analyses on human dynamics is that its temporal statistics are…

We consider weighted graphs satisfying sub-Gaussian estimate for the natural random walk. On such graphs, we study symmetric Markov chains with heavy tailed jumps. We establish a threshold behavior of such Markov chains when the index…

Nambu-determinant brackets on $R^d\ni x=(x^1,...,x^d)$, $\{f,g\}_d(x)=\rho(x) \det(\partial(f,g,a_1,...,a_{d-2})/\partial(x^1,...,x^d))$, with $a_i\in C^\infty(R^d)$ and $\rho\partial_x\in\mathfrak{X}^d(R^d)$, are a class of Poisson…

The total number of fatalities of an epidemic outbreak is a dramatic but extremely informative quantity. Knowledge of the statistics of this quantity allows the calculation of the mean total number of fatalities conditioned to the fact that…

We study probability inequalities leading to tail estimates in a general semigroup $\mathscr{G}$ with a translation-invariant metric $d_{\mathscr{G}}$. (An important and central example of this in the functional analysis literature is that…

Suppose that $X$ is a bounded-degree polynomial with nonnegative coefficients on the $p$-biased discrete hypercube. Our main result gives sharp estimates on the logarithmic upper tail probability of $X$ whenever an associated extremal…

The notion of k-clique percolation in random graphs is introduced, where k is the size of the complete subgraphs whose large scale organizations are analytically and numerically investigated. For the Erdos-Renyi graph of N vertices we…

We estimate up to universal constants tails of symmetric and totally asymmetric 1-dimensional $\alpha$-stable distributions in terms of functions of the parameters of these distributions. In particular, for values of $\alpha$ close to $2$…

We study the normal approximation of functionals of Poisson measures having the form of a finite sum of multiple integrals. When the integrands are nonnegative, our results yield necessary and sufficient conditions for central limit…

Pick $N$ random points $U_1,\cdots,U_{N}$ independently and uniformly in a triangle ABC with area 1, and take the convex hull of the set $\{A,B,U_1,\cdots,U_{N}\}$. The boundary of this convex hull is a convex chain $V_0=B,V_1,\cdots,$…

Given a family of hypergraphs $\mathcal{H}$, we say that a hypergraph $\Gamma$ is $\mathcal{H}$-universal if it contains every $H \in \mathcal{H}$ as a subgraph. For $D, r \in \mathbb{N}$, we construct an $r$-uniform hypergraph with…

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

Graphical data arises naturally in several modern applications, including but not limited to internet graphs, social networks, genomics and proteomics. The typically large size of graphical data argues for the importance of designing…

We establish universality of cutoff for simple random walk on a class of random graphs defined as follows. Given a finite graph $G=(V,E)$ with $|V|$ even we define a random graph $ G^*=(V,E \cup E')$ obtained by picking $E'$ to be the…

In this paper we consider coalescing random walks on a general connected graph $G=(V,E)$. We set up a unified framework to study the leading order of the decay rate of $P_t$, the expectation of the fraction of occupied sites at time $t$,…

Emergence of dominating cliques in Erd\"os-R\'enyi random graph model ${\bbbg(n,p)}$ is investigated in this paper. It is shown this phenomenon possesses a phase transition. Namely, we have argued that, given a constant probability $p$, an…

Place one active particle at the root of a graph and a Poisson-distributed number of dormant particles at the other vertices. Active particles perform simple random walk. Once the number of visits to a site reaches a random threshold, any…

We show that for every $k \in \mathbb{N}$ there exists $C > 0$ such that if $p^k \ge C \log^8 n / n$ then asymptotically almost surely the random graph $G_{n,p}$ contains the $k$\textsuperscript{th} power of a Hamilton cycle. This…

We consider self-loops and multiple edges in the configuration model as the size of the graph tends to infinity. The interest in these random variables is due to the fact that the configuration model, conditioned on being simple, is a…