Related papers: Percolation Inequalities and Decision Trees
We show variants of spectral sparsification routines can preserve the total spanning tree counts of graphs, which by Kirchhoff's matrix-tree theorem, is equivalent to determinant of a graph Laplacian minor, or equivalently, of any SDDM…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
We study linear statistics of a class of determinantal processes which interpolate between Poisson and GUE/Ginibre statistics in dimension 1 or 2. These processes are obtained by performing an independent Bernoulli percolation on the…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
We provide arguments for the property of the degree-degree correlations of giant components formed by the percolation process on uncorrelated random networks. Using the generating functions, we derive a general expression for the…
We obtain the exact solution of the bond-percolation thresholds with inhomogenous probabilities on the square lattice. Our method is based on the duality analysis with real-space renormalization, which is a profound technique invented in…
We introduce and study a new notion of patterns in Stirling and $k$-Stirling permutations, which we call block patterns. We prove a general result which allows us to compute generating functions for the occurrences of various block patterns…
We give a direct rigorous proof of the Kearns--Saul inequality which bounds the Laplace transform of a generalised Bernoulli random variable. We extend the arguments to generalised Poisson-binomial distributions and characterise the set of…
Given a rooted tree and a ranking of its leaves, what is the minimum number of inversions of the leaves that can be attained by ordering the tree? This variation of the problem of counting inversions in arrays originated in mathematical…
We study bond percolation on the square lattice with one-dimensional inhomogeneities. Inhomogeneities are introduced in the following way: A vertical column on the square lattice is the set of vertical edges that project to the same vertex…
Consider ordinary bond percolation on a finite or countably infinite graph. Let s, t, a and b be vertices. An earlier paper proved the (nonintuitive) result that, conditioned on the event that there is no open path from s to t, the two…
We construct near optimal linear decision trees for a variety of decision problems in combinatorics and discrete geometry. For example, for any constant $k$, we construct linear decision trees that solve the $k$-SUM problem on $n$ elements…
We study the influence of the seed in random trees grown according to the uniform attachment model, also known as uniform random recursive trees. We show that different seeds lead to different distributions of limiting trees from a total…
Percolation threshold of a network is the critical value such that when nodes or edges are randomly selected with probability below the value, the network is fragmented but when the probability is above the value, a giant component…
The Harnack inequality established in [13] for generalized Mehler semigroup is improved and generalized. As applications, the log-Harnack inequality, the strong Feller property, the hyper-bounded property, and some heat kernel inequalities…
Benjamini and Kesten introduced in 1995 the problem of embedding infinite binary sequences into a Bernoulli percolation configuration, known as "percolation of words". We give a positive answer to their Open Problem 2: almost surely, all…
The probability distributions of the order parameter for two models in the directed percolation universality class were evaluated. Monte Carlo simulations have been performed for the one-dimensional generalized contact process and the…
This paper shows that decision trees constructed with Classification and Regression Trees (CART) and C4.5 methodology are consistent for regression and classification tasks, even when the number of predictor variables grows…
Percolation problems appear in a large variety of different contexts ranging from the design of composite materials to vaccination strategies on community networks. The key observable for many applications is the percolation threshold.…
We study large random partitions boxed into a rectangle and coming from skew Howe duality, or alternatively from dual Schur measures. As the sides of the rectangle go to infinity, we obtain: 1) limit shape results for the profiles…