Searcharxiv⌕ Search

arXiv subjects

Tomasz Tkocz

Publications and source records attributed to Tomasz Tkocz.

At least 55 records · Page 3Linked to original sources
arXiv2020

A randomly weighted minimum spanning tree with a random cost constraint

We study the minimum spanning tree problem on the complete graph $K_n$ where an edge $e$ has a weight $W_e$ and a cost $C_e$, each of which is an independent copy of the random variable $U^γ$ where $γ\leq 1$ and $U$ is the uniform $[0,1]$ random variable. There is also a constraint that the spanning tree $T$ must satisfy $C(T)\leq c_0$. We establish, for a range of values for $c_0,γ$, the asymptotic value of the optimum weight via the consideration of a dual problem.

math.CO↗
arXiv2020

Minimum-weight combinatorial structures under random cost-constraints

Recall that Janson showed that if the edges of the complete graph $K_n$ are assigned exponentially distributed independent random weights, then the expected length of a shortest path between a fixed pair of vertices is asymptotically equal to $(\log n)/n$. We consider analogous problems where edges have not only a random length but also a random cost, and we are interested in the length of the minimum-length structure whose total cost is less than some cost budget. For several classes of structures, we determine the correct minimum length structure as a function of the cost-budget, up to constant factors. Moreover, we achieve this even in the more general setting where the distribution of weights and costs are arbitrary, so long as the density $f(x)$ as $x\to 0$ behaves like $cx^γ$ for some $γ\geq 0$; previously, this case was not understood even in the absence of cost constraints. We also handle the case where each edge has several independent costs associated to it, and we must simultaneously satisfy budgets on each cost. In this case, we show that the minimum-length structure obtainable is essentially controlled by the product of the cost thresholds.

math.CO↗
arXiv2019

A note on the extremal noncentral sections of the cross-polytope

We find minimal and maximal length of intersections of lines at a fixed distance to the origin with the cross-polytope. We also find maximal volume noncentral sections of the cross-polypote by hyperplanes which are at a fixed large distance to the origin and minimal volume sections by symmetric slabs of a large fixed width. This parallels recent results about noncentral sections of the cube due to Moody, Stone, Zach and Zvavitch.

math.MG↗
arXiv2019

Gaussian mixtures: entropy and geometric inequalities

A symmetric random variable is called a Gaussian mixture if it has the same distribution as the product of two independent random variables, one being positive and the other a standard Gaussian random variable. Examples of Gaussian mixtures include random variables with densities proportional to $e^{-|t|^p}$ and symmetric $p$-stable random variables, where $p\in(0,2]$. We obtain various sharp moment and entropy comparison estimates for weighted sums of independent Gaussian mixtures and investigate extensions of the B-inequality and the Gaussian correlation inequality in the context of Gaussian mixtures. We also obtain a correlation inequality for symmetric geodesically convex sets in the unit sphere equipped with the normalized surface area measure. We then apply these results to derive sharp constants in Khintchine inequalities for vectors uniformly distributed on the unit balls with respect to $p$-norms and provide short proofs to new and old comparison estimates for geometric parameters of sections and projections of such balls.

math.PR↗
arXiv2019

Two remarks on generalized entropy power inequalities

This note contributes to the understanding of generalized entropy power inequalities. Our main goal is to construct a counter-example regarding monotonicity and entropy comparison of weighted sums of independent identically distributed log-concave random variables. We also present a complex analogue of a recent dependent entropy power inequality of Hao and Jog, and give a very simple proof.

cs.IT↗
arXiv2019

Random graphs with a fixed maximum degree

We study the component structure of the random graph $G=G_{n,m,d}$. Here $d=O(1)$ and $G$ is sampled uniformly from ${\mathcal G}_{n,m,d}$, the set of graphs with vertex set $[n]$, $m$ edges and maximum degree at most $d$. If $m=μn/2$ then we establish a threshold value $μ_\star$ such that if $μ<μ_\star$ then w.h.p. the maximum component size is $O(\log n)$. If $μ>μ_\star$ then w.h.p. there is a unique giant component of order $n$ and the remaining components have size $O( \log n)$.

math.CO↗
arXiv2019

On random multi-dimensional assignment problems

We study random multidimensional assignment problems where the costs decompose into the sum of independent random variables. In particular, in three dimensions, we assume that the costs $W_{i,j,k}$ satisfy $W_{i,j,k}=a_{i,j}+b_{i,k}+c_{j,k}$ where the $a_{i,j},b_{i,k},c_{j,k}$ are independent exponential rate 1 random variables. Our objective is to minimize the total cost and we show that w.h.p. a simple greedy algorithm is a $(3+o(1))$-approximation. This is in contrast to the case where the $W_{i,j,k}$ are independent exponential rate 1 random variables. Here all that is known is an $n^{o(1)}$-approximation, due to Frieze and Sorkin.

math.CO↗
arXiv2018

Comparison of moments of Rademacher chaoses

We show that complex hypercontractivity gives better constants than real hypercontractivity in comparison inequalities for (low) moments of Rademacher chaoses (homogeneous polynomials on the discrete cube).

math.PR↗
arXiv2018

A note on log-concave random graphs

We establish a threshold for the connectivity of certain random graphs whose (dependent) edges are determined by the uniform distributions on generalized Orlicz balls, crucially using their negative correlation properties. We also show the existence of a unique giant component for such random graphs.

math.CO↗
arXiv2018

Stochastic dominance and weak concentration for sums of independent symmetric random vectors

Kwapien and Woyczynski asked in their monograph (1992) whether their notion of superstrong domination is inherited when taking sums of independent symmetric random vectors (one vector dominates another if, essentially, tail probabilities of any norm of the two vectors compare up to some scaling constants). We answer this question positively. As a by-product of our methods, we establish that a certain notion of weak concentration is also preserved by taking sums of independent symmetric random vectors.

math.PR↗
arXiv2018

Sharp comparison of moments and the log-concave moment problem

This article investigates sharp comparison of moments for various classes of random variables appearing in a geometric context. In the first part of our work we find the optimal constants in the Khintchine inequality for random vectors uniformly distributed on the unit ball of the space $\ell_q^n$ for $q\in(2,\infty)$, complementing past works that treated $q\in(0,2]\cup\{\infty\}$. As a byproduct of this result, we prove an extremal property for weighted sums of symmetric uniform distributions among all symmetric unimodal distributions. In the second part we provide a one-to-one correspondence between vectors of moments of symmetric log-concave functions and two simple classes of piecewise log-affine functions. These functions are shown to be the unique extremisers of the $p$-th moment functional, under the constraint of a finite number of other moments being fixed, which is a refinement of the description of extremisers provided by the generalised localisation theorem of Fradelizi and Guédon [Adv. Math. 204 (2006) no. 2, 509-529].

math.FA↗
arXiv2017

On the convex infimum convolution inequality with optimal cost function

We show that every symmetric random variable with log-concave tails satisfies the convex infimum convolution inequality with an optimal cost function (up to scaling). As a result, we obtain nearly optimal comparison of weak and strong moments for symmetric random vectors with independent coordinates with log-concave tails.

math.PR↗
arXiv2015

Two-sided bounds for $L_p$-norms of combinations of products of independent random variables

We show that for every positive p, the L_p-norm of linear combinations (with scalar or vector coefficients) of products of i.i.d. random variables, whose moduli have a nondegenerate distribution with the p-norm one, is comparable to the l_p-norm of the coefficients and the constants are explicit. As a result the same holds for linear combinations of Riesz products. We also establish the upper and lower bounds of the L_p-moments of partial sums of perpetuities.

math.PR↗