Related papers: Minimal matchings of point processes
In some recent papers the classical `splitting necklace theorem' is linked in an interesting way with a geometric `pattern avoidance problem'. We explore the topological constraints on the existence of a (relaxed) measurable coloring of R^d…
We analyse uniformly random proper $k$-colourings of sparse graphs with maximum degree $\Delta$ in the regime $\Delta < k\ln k $. This regime corresponds to the lower side of the shattering threshold for random graph colouring, a…
We give a short survey of problems and results on (1) diameter graphs and hypergraphs, and (2) geometric Ramsey theory. We also make some modest contributions to both areas. Extending a well known theorem of Kahn and Kalai which disproved…
Let $k,l,m$ be integers and $r(k,l,m)$ be the minimum integer $N$ such that for any red-blue-green coloring of $K_{N,N}$, there is a red matching of size at least $k$ in a component, or a blue matching of at least size $l$ in a component,…
We address the question of convergence of evolving interacting particle systems as the number of particles tends to infinity. We consider two types of particles, called positive and negative. Same-sign particles repel each other, and…
A graph is said to be equimatchable if all its maximal matchings are of the same size. In this work we introduce two extensions of the property of equimatchability by defining two new graph parameters that measure how far a graph is from…
A square symmetric matrix is a Robinson similarity matrix if entries in its rows and columns are non-decreasing when moving towards the diagonal. A Robinson similarity matrix can be viewed as the affinity matrix between objects arranged in…
We consider the minimization of an energy functional given by the sum of a density perimeter and a nonlocal interaction of Riesz type with exponent $\alpha$, under volume constraint, where the strength of the nonlocal interaction is…
Consider the model where we can access a parity function through random uniform labeled examples in the presence of random classification noise. In this paper, we show that approximating the number of relevant variables in the parity…
An infinite system of point particles placed in $\mathds{R}^d$ is studied. Its constituents perform random jumps with mutual repulsion described by a translation-invariant jump kernel and interaction potential, respectively. The pure states…
We give bounds on the rate of convergence to equilibrium of the symmetric simple exclusion process in $\Z^d$. Our results include the existent results in the literature. We get better bounds and larger class of initial states via a unified…
As a starting point of our research, we show that, for a fixed order $\gamma\geq 1$, each local minimizer of a rather general nonsmooth optimization problem in Euclidean spaces is either M-stationary in the classical sense (corresponding to…
We exhibit simple lattice systems, motivated by recently proposed cold atom experiments, whose continuum limits interpolate between real and $p$-adic smoothness as a spectral exponent is varied. A real spatial dimension emerges in the…
A celebrated result of R\"odl and Ruci\'nski states that for every graph $F$, which is not a forest of stars and paths of length $3$, and fixed number of colours $r\ge 2$ there exist positive constants $c, C$ such that for $p \leq…
Consider a discrete locally finite subset $\Gamma$ of $R^d$ and the complete graph $(\Gamma,E)$, with vertices $\Gamma$ and edges $E$. We consider Gibbs measures on the set of sub-graphs with vertices $\Gamma$ and edges $E'\subset E$. The…
Graph parameters such as the clique number, the chromatic number, and the independence number are central in many areas, ranging from computer networks to linguistics to computational neuroscience to social networks. In particular, the…
In this paper, we study the smoothness of the density function of absolutely continuous measures supported on random self-similar sets on the line. We show that the natural projection of a measure with symbolic local dimension greater than…
In this paper, we consider the average size of independent edge sets, also called matchings, in a graph. We characterize the extremal graphs for the average size of matchings in general graphs and trees. In addition, we obtain inequalities…
We study graphs with the property that every edge-colouring admits a monochromatic cycle (the length of which may depend freely on the colouring) and describe those graphs that are minimal with this property. We show that every member in…
A point process is said to be rigid if for any bounded domain in the phase space, the number of particles in the domain is almost surely determined by the restriction of the configuration to the complement of our bounded domain. The main…