scholarly journals Concentration of Lipschitz Functionals of Determinantal and Other Strong Rayleigh Measures

2013 ◽  
Vol 23 (1) ◽  
pp. 140-160 ◽  
Author(s):  
ROBIN PEMANTLE ◽  
YUVAL PERES
Keyword(s):  
Spanning Tree ◽  
Concentration Inequality ◽  
Determinantal Point Process ◽  
Continuous Version ◽  
Negative Binomials ◽  
Uniform Spanning Tree ◽  
Formula Group ◽  
Vertex Set ◽  
Number Of Leaves ◽  
Image Position

Let {X1 , . . , Xn} be a collection of binary-valued random variables and let f : {0, 1}n → $\mathbb{R}$ be a Lipschitz function. Under a negative dependence hypothesis known as the strong Rayleigh condition, we show that f − ${\mathbb E}$f satisfies a concentration inequality. The class of strong Rayleigh measures includes determinantal measures, weighted uniform matroids and exclusion measures; some familiar examples from these classes are generalized negative binomials and spanning tree measures. For instance, any Lipschitz-1 function of the edges of a uniform spanning tree on vertex set V (e.g., the number of leaves) satisfies the Gaussian concentration inequality \begin{linenomath}$${{\mathbb P} (f - {\mathbb E} f \geq a) \leq \exp \biggl( - \frac{a^2}{8 \, |V|} \biggr) }.$$\end{linenomath} We also prove a continuous version for concentration of Lipschitz functionals of a determinantal point process.

scholarly journals On the Length of a Random Minimum Spanning Tree

2015 ◽  
Vol 25 (1) ◽  
pp. 89-107 ◽  
Author(s):  
COLIN COOPER ◽  
ALAN FRIEZE ◽  
NATE INCE ◽  
SVANTE JANSON ◽  
JOEL SPENCER
Keyword(s):  
Complete Graph ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Expected Value ◽  
Edge Weight ◽  
Formula Group ◽  
Image Position

We study the expected value of the lengthLnof the minimum spanning tree of the complete graphKnwhen each edgeeis given an independent uniform [0, 1] edge weight. We sharpen the result of Frieze [6] that limn→∞$\mathbb{E}$(Ln) = ζ(3) and show that$$ \mathbb{E}(L_n)=\zeta(3)+\frac{c_1}{n}+\frac{c_2+o(1)}{n^{4/3}}, $$wherec1,c2are explicitly defined constants.

scholarly journals Packing Loose Hamilton Cycles

2017 ◽  
Vol 26 (6) ◽  
pp. 839-849
Author(s):  
ASAF FERBER ◽  
KYLE LUH ◽  
DANIEL MONTEALEGRE ◽  
OANH NGUYEN
Keyword(s):  
Packing Problem ◽  
Hamilton Cycle ◽  
Uniform Hypergraph ◽  
Hamilton Cycles ◽  
Threshold Probability ◽  
Edge Disjoint ◽  
Formula Group ◽  
Vertex Set ◽  
Substantial Progress ◽  
Image Position

A subsetCof edges in ak-uniform hypergraphHis aloose Hamilton cycleifCcovers all the vertices ofHand there exists a cyclic ordering of these vertices such that the edges inCare segments of that order and such that every two consecutive edges share exactly one vertex. The binomial randomk-uniform hypergraphHkn,phas vertex set [n] and an edge setEobtained by adding eachk-tuplee∈ ($\binom{[n]}{k}$) toEwith probabilityp, independently at random.Here we consider the problem of finding edge-disjoint loose Hamilton cycles covering all buto(|E|) edges, referred to as thepacking problem. While it is known that the threshold probability of the appearance of a loose Hamilton cycle inHkn,pis$p=\Theta\biggl(\frac{\log n}{n^{k-1}}\biggr),$the best known bounds for the packing problem are aroundp= polylog(n)/n. Here we make substantial progress and prove the following asymptotically (up to a polylog(n) factor) best possible result: forp≥ logCn/nk−1, a randomk-uniform hypergraphHkn,pwith high probability contains$N:=(1-o(1))\frac{\binom{n}{k}p}{n/(k-1)}$edge-disjoint loose Hamilton cycles.Our proof utilizes and modifies the idea of ‘online sprinkling’ recently introduced by Vu and the first author.

Resolution of T. Ward's Question and the Israel–Finch Conjecture: Precise Analysis of an Integer Sequence Arising in Dynamics

2014 ◽  
Vol 24 (1) ◽  
pp. 195-215
Author(s):  
JEFFREY GAITHER ◽  
GUY LOUCHARD ◽  
STEPHAN WAGNER ◽  
MARK DANIEL WARD
Keyword(s):  
Weighted Average ◽  
Analytic Number Theory ◽  
Combinatorial Structure ◽  
Asymptotic Growth ◽  
First Order ◽  
Integer Sequence ◽  
Precise Analysis ◽  
Formula Group ◽  
Fourth Author ◽  
Image Position

We analyse the first-order asymptotic growth of \[ a_{n}=\int_{0}^{1}\prod_{j=1}^{n}4\sin^{2}(\pi jx)\, dx. \] The integer an appears as the main term in a weighted average of the number of orbits in a particular quasihyperbolic automorphism of a 2n-torus, which has applications to ergodic and analytic number theory. The combinatorial structure of an is also of interest, as the ‘signed’ number of ways in which 0 can be represented as the sum of ϵjj for −n ≤ j ≤ n (with j ≠ 0), with ϵj ∈ {0, 1}. Our result answers a question of Thomas Ward (no relation to the fourth author) and confirms a conjecture of Robert Israel and Steven Finch.

SHARP WEIGHTED BOUNDS FOR GEOMETRIC MAXIMAL OPERATORS

2016 ◽  
Vol 59 (3) ◽  
pp. 533-547 ◽  
Author(s):  
ADAM OSȨKOWSKI
Keyword(s):  
Maximal Operator ◽  
General Setting ◽  
Maximal Operators ◽  
List Type ◽  
Type Number ◽  
Type Estimate ◽  
Formula Group ◽  
Probability Spaces ◽  
Image Position

AbstractLet $\mathcal{M}$ and G denote, respectively, the maximal operator and the geometric maximal operator associated with the dyadic lattice on $\mathbb{R}^d$. (i)We prove that for any 0 < p < ∞, any weight w on $\mathbb{R}^d$ and any measurable f on $\mathbb{R}^d$, we have Fefferman–Stein-type estimate $$\begin{equation*} ||G(f)||_{L^p(w)}\leq e^{1/p}||f||_{L^p(\mathcal{M}w)}. \end{equation*} $$ For each p, the constant e1/p is the best possible.(ii)We show that for any weight w on $\mathbb{R}^d$ and any measurable f on $\mathbb{R}^d$, $$\begin{equation*} \int_{\mathbb{R}^d} G(f)^{1/\mathcal{M}w}w\mbox{d}x\leq e\int_{\mathbb{R}^d} |f|^{1/w}w\mbox{d}x \end{equation*} $$ and prove that the constant e is optimal. Actually, we establish the above estimates in a more general setting of maximal operators on probability spaces equipped with a tree-like structure.

On the number of leaves of a euclidean minimal spanning tree

1987 ◽  
Vol 24 (4) ◽  
pp. 809-826 ◽  
Author(s):  
J. Michael Steele ◽  
Lawrence A. Shepp ◽  
William F. Eddy
Keyword(s):  
Spanning Tree ◽  
Spanning Trees ◽  
Random Variables ◽  
Minimal Spanning Tree ◽  
Absolutely Continuous ◽  
Mean And Variance ◽  
Number Of Leaves ◽  
The Mean ◽  
Vertex Degrees ◽  
Minimal Spanning Trees

Let Vk,n be the number of vertices of degree k in the Euclidean minimal spanning tree of Xi, , where the Xi are independent, absolutely continuous random variables with values in Rd. It is proved that n–1Vk,n converges with probability 1 to a constant α k,d. Intermediate results provide information about how the vertex degrees of a minimal spanning tree change as points are added or deleted, about the decomposition of minimal spanning trees into probabilistically similar trees, and about the mean and variance of Vk,n.

scholarly journals Minimum Number of Monotone Subsequences of Length 4 in Permutations

2014 ◽  
Vol 24 (4) ◽  
pp. 658-679 ◽  
Author(s):  
JÓZSEF BALOGH ◽  
PING HU ◽  
BERNARD LIDICKÝ ◽  
OLEG PIKHURKO ◽  
BALÁZS UDVARI ◽  
...  
Keyword(s):  
Lower Bound ◽  
Complete Graphs ◽  
Formula Group ◽  
Minimum Number ◽  
Additional Stability ◽  
Edge Colourings ◽  
Image Position

We show that for every sufficiently largen, the number of monotone subsequences of length four in a permutation onnpoints is at least\begin{equation*} \binom{\lfloor{n/3}\rfloor}{4} + \binom{\lfloor{(n+1)/3}\rfloor}{4} + \binom{\lfloor{(n+2)/3}\rfloor}{4}. \end{equation*}Furthermore, we characterize all permutations on [n] that attain this lower bound. The proof uses the flag algebra framework together with some additional stability arguments. This problem is equivalent to some specific type of edge colourings of complete graphs with two colours, where the number of monochromaticK4is minimized. We show that all the extremal colourings must contain monochromaticK4only in one of the two colours. This translates back to permutations, where all the monotone subsequences of length four are all either increasing, or decreasing only.

On colouring random graphs

1975 ◽  
Vol 77 (2) ◽  
pp. 313-324 ◽  
Author(s):  
G. R. Grimmett ◽  
C. J. H. McDiarmid
Keyword(s):  
Random Graph ◽  
Random Graphs ◽  
Complete Subgraph ◽  
Vertex Set ◽  
Image Position

AbstractLet ωn denote a random graph with vertex set {1, 2, …, n}, such that each edge is present with a prescribed probability p, independently of the presence or absence of any other edges. We show that the number of vertices in the largest complete subgraph of ωn is, with probability one,

scholarly journals Additive correlation and the inverse problem for the large sieve

2018 ◽  
Vol 168 (2) ◽  
pp. 211-217
Author(s):  
BRANDON HANSON
Keyword(s):  
Inverse Problem ◽  
Energy Estimate ◽  
Large Sieve ◽  
Residue Classes ◽  
Formula Group ◽  
Additive Energy ◽  
Image Position

AbstractLet A ⊆ [1, N] be a set of integers with |A| ≫ $\sqrt N$. We show that if A avoids about p/2 residue classes modulo p for each prime p, then A must correlate additively with the squares S = {n2 : 1 ≤ n ≤ $\sqrt N$}, in the sense that we have the additive energy estimate $$ E(A,S)\gg N\log N. $$ This is, in a sense, optimal.

scholarly journals On the arithmetic of a family of degree - two K3 surfaces

2018 ◽  
Vol 166 (3) ◽  
pp. 523-542 ◽  
Author(s):  
FLORIAN BOUYER ◽  
EDGAR COSTA ◽  
DINO FESTI ◽  
CHRISTOPHER NICHOLLS ◽  
MCKENZIE WEST
Keyword(s):  
Projective Space ◽  
Function Field ◽  
Weighted Projective Space ◽  
Module Structure ◽  
K3 Surface ◽  
Galois Module ◽  
Generic Element ◽  
The Family ◽  
Formula Group ◽  
Image Position

AbstractLet ℙ denote the weighted projective space with weights (1, 1, 1, 3) over the rationals, with coordinates x, y, z and w; let $\mathcal{X}$ be the generic element of the family of surfaces in ℙ given by \begin{equation*} X\colon w^2=x^6+y^6+z^6+tx^2y^2z^2. \end{equation*} The surface $\mathcal{X}$ is a K3 surface over the function field ℚ(t). In this paper, we explicitly compute the geometric Picard lattice of $\mathcal{X}$, together with its Galois module structure, as well as derive more results on the arithmetic of $\mathcal{X}$ and other elements of the family X.

Sign in / Sign up

Export Citation Format

Share Document