English
Related papers

Related papers: Universality in prelimiting tail behavior for regu…

200 papers

Dirac's classical theorem asserts that, for $n \ge 3$, any $n$-vertex graph with minimum degree at least $n/2$ is Hamiltonian. Furthermore, if we additionally assume that such graphs are regular, then, by the breakthrough work of Csaba,…

In a previous paper, we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the…

Probability · Mathematics 2007-05-23 Christian Borgs , Jennifer T. Chayes , Remco van der Hofstad , Gordon Slade , Joel Spencer

Despite the successes of probabilistic models based on passing noise through neural networks, recent work has identified that such methods often fail to capture tail behavior accurately, unless the tails of the base distribution are…

Machine Learning · Statistics 2023-06-16 Feynman Liang , Liam Hodgkinson , Michael W. Mahoney

Random graphs with latent geometric structure are popular models of social and biological networks, with applications ranging from network user profiling to circuit design. These graphs are also of purely theoretical interest within…

Probability · Mathematics 2020-08-04 Matthew Brennan , Guy Bresler , Dheeraj Nagaraj

For positive integers $r > \ell \geq 1$, an $\ell$-cycle in an $r$-uniform hypergraph is a cycle where each edge consists of $r$ vertices and each pair of consecutive edges intersect in $\ell$ vertices. For $\ell \geq 2$, we determine the…

Combinatorics · Mathematics 2025-01-08 Byron Chin

We consider the tail behavior of random variables $R$ which are solutions of the distributional equation $R\stackrel{d}{=}Q+MR$, where $(Q,M)$ is independent of $R$ and $|M|\le 1$. Goldie and Gr\"{u}bel showed that the tails of $R$ are no…

Probability · Mathematics 2010-02-08 Paweł Hitczenko , Jacek Wesołowski

When a quantum phase transition is crossed in finite time, critical slowing down leads to the breakdown of adiabatic dynamics and the formation of topological defects. The average density of defects scales with the quench rate following a…

Quantum Physics · Physics 2018-11-26 Adolfo del Campo

What is the chance that among a group of $n$ friends, there are $s$ friends all of whom have the same birthday? This is the celebrated birthday problem which can be formulated as the existence of a monochromatic $s$-clique $K_s$…

Probability · Mathematics 2020-04-17 Bhaswar B. Bhattacharya , Somabha Mukherjee , Sumit Mukherjee

We prove that the distributional limit of the normalised number of returns to small neighbourhoods of periodic points of non-uniformly hyperbolic dynamical systems is compound Poisson. The returns to small balls around a fixed point in the…

Dynamical Systems · Mathematics 2013-11-13 Ana Cristina Moreira Freitas , Jorge Milhazes Freitas , Mike Todd

For r \ge 2, let X be the number of r-armed stars K_{1,r} in the binomial random graph G_{n,p}. We study the upper tail \Pr(X \ge (1+\epsilon)\E X), and establish exponential bounds which are best possible up to constant factors in the…

Probability · Mathematics 2021-04-06 Matas Šileikis , Lutz Warnke

We show that a quasirandom $k$-uniform hypergraph $G$ has a tight Euler tour subject to the necessary condition that $k$ divides all vertex degrees. The case when $G$ is complete confirms a conjecture of Chung, Diaconis and Graham from 1989…

Combinatorics · Mathematics 2020-03-11 Stefan Glock , Felix Joos , Daniela Kühn , Deryk Osthus

The internal microscopic phase transition in atom H described with a Hund-type Mexican hat potential is analytically congruent with the macroscopic phase transitions between states of aggregation, described with classical Van der…

General Physics · Physics 2007-05-23 G. Van Hooydonk

For two fixed graphs $T$ and $H$ let $ex(G(n,p),T,H)$ be the random variable counting the maximum number of copies of $T$ in an $H$-free subgraph of the random graph $G(n,p)$. We show that for the case $T=K_m$ and $\chi(H)> m$ the behavior…

Combinatorics · Mathematics 2017-11-21 Noga Alon , Alexandr Kostochka , Clara Shikhelman

Symmetric heavily tailed random walks on $Z^d, d\geq 1,$ are considered. Under appropriate regularity conditions on the tails of the jump distributions, global (i.e., uniform in $x,t, |x|+t\to\infty,$) asymptotic behavior of the transition…

Probability · Mathematics 2016-03-02 A. Agbor , S. Molchanov , B. Vainberg

We analyze how the transient dynamics of large dynamical systems in the vicinity of a stationary point, modeled by a set of randomly coupled linear differential equations, depends on the network topology. We characterize the transient…

Adaptation and Self-Organizing Systems · Physics 2024-01-17 Wojciech Tarnowski , Izaak Neri , Pierpaolo Vivo

We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…

Probability · Mathematics 2012-10-26 Shankar Bhamidi , Remco van der Hofstad , Gerard Hooghiemstra

Certain frustrated systems, including spin ice and dimer models, exhibit a Coulomb phase at low temperatures, with power-law correlations and fractionalized monopole excitations. Transitions out of this phase, at which the effective gauge…

Statistical Mechanics · Physics 2012-08-09 Stephen Powell

The classical Poisson theorem says that if $\xi_1,\xi_2,...$ are i.i.d. 0--1 Bernoulli random variables taking on 1 with probability $p_n\equiv \la/n$ then the sum $S_n=\sum_{i=1}^n\xi_i$ is asymptotically in $n$ Poisson distributed with…

Probability · Mathematics 2011-10-11 Yuri Kifer

A sequence $(x_n)_{n=1}^{\infty}$ on the torus $\mathbb{T} \cong [0,1]$ is said to exhibit Poissonian pair correlation if the local gaps behave like the gaps of a Poisson random variable, i.e. $$ \lim_{N \rightarrow \infty}{ \frac{1}{N} \#…

Number Theory · Mathematics 2017-11-08 Stefan Steinerberger

This paper examines bounds on upper tails for cycle counts in $G_{n,p}$. For a fixed graph $H$ define $\xi_H= \xi_H^{n,p}$ to be the number of copies of $H$ in $G_{n,p}$. It is a much studied and surprisingly difficult problem to understand…

Combinatorics · Mathematics 2019-04-03 Abigail Raz