English
Related papers

Related papers: Bounding a global red-blue proportion using local …

200 papers

We present, at the gedanken level, a possibly novel non-statistical demonstration of nonlocality for two maximally entangled particles. The argument requires only two alternative experimental contexts, only one and the same single-particle…

Quantum Physics · Physics 2007-05-23 Demetrios Kalamidas

We present an algebraic description of the sets of local correlations in arbitrary networks, when the parties have finite inputs and outputs. We consider networks generalizing the usual Bell scenarios by the presence of multiple…

Quantum Physics · Physics 2019-03-12 Denis Rosset , Nicolas Gisin , Elie Wolfe

Global hyperbolicity is a central concept in Mathematical Relativity. Here, we review the different approaches to this concept explaining both, classical approaches and recent results. The former includes Cauchy hypersurfaces, naked…

General Relativity and Quantum Cosmology · Physics 2026-04-07 Miguel Sánchez

We analyze combinatorial optimization problems over a pair of random point sets of equal cardinal. Typical examples include the matching of minimal length, the traveling salesperson tour constrained to alternate between points of each set,…

Probability · Mathematics 2011-10-06 Franck Barthe , Charles Bordenave

We show that the initial value problem associated to the dispersive generalized Benjamin-Ono-Zakharov-Kuznetsov equation$$ u\_t-D\_x^\alpha u\_{x} + u\_{xyy} = uu\_x,\quad (t,x,y)\in\R^3,\quad 1\le \alpha\le 2,$$is locally well-posed in the…

Analysis of PDEs · Mathematics 2016-01-06 Francis Ribaud , Stéphane Vento

We study the local dimension of the convolution of two measures. We give conditions for bounding the local dimension of the convolution on the basis of the local dimension of one of them. Moreover, we give a formula for the local dimension…

Dynamical Systems · Mathematics 2025-02-26 Kevin G. Hare , Joaquin G. Prandi

Given a set of $n$ red and $n$ blue points in the plane, we are interested in matching red points with blue points by straight line segments so that the segments do not cross. We develop a range of tools for dealing with the non-crossing…

Computational Geometry · Computer Science 2021-11-19 Marko Savić , Miloš Stojaković

A $d$-dimensional binary Markov random field on a lattice torus is considered. As the size $n$ of the lattice tends to infinity, potentials $a=a(n)$ and $b=b(n)$ depend on $n$. Precise bounds for the probability for local configurations to…

Probability · Mathematics 2010-10-13 David Coupier

The global existence of bounded solutions to reaction-diffusion systems with fractional diffusion in the whole space $\mathbb R^N$ is investigated. The systems are assumed to preserve the non-negativity of initial data and to dissipate…

Analysis of PDEs · Mathematics 2025-02-25 Phuoc-Tai Nguyen , Bao Quoc Tang

We consider a general class of $N\times N$ random matrices whose entries $h_{ij}$ are independent up to a symmetry constraint, but not necessarily identically distributed. Our main result is a local semicircle law which improves previous…

Probability · Mathematics 2013-05-28 Laszlo Erdos , Antti Knowles , Horng-Tzer Yau , Jun Yin

We provide a framework for studying randomly coloured point sets in a locally compact, second-countable space on which a metrisable unimodular group acts continuously and properly. We first construct and describe an appropriate dynamical…

Dynamical Systems · Mathematics 2019-08-15 Peter Müller , Christoph Richard

Phenomena with a constrained sample space appear frequently in practice. This is the case e.g. with strictly positive data and with compositional data, like percentages and the like. If the natural measure of difference is not the absolute…

Methodology · Statistics 2008-02-20 G. Mateu-Figueras , V. Pawlowsky-Glahn , J. J. Egozcue

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

Optimization and Control · Mathematics 2019-07-02 Thomas Kerdreux , Igor Colin , Alexandre d'Aspremont

Using a new point of view inspired by hyperplane arrangements, we generalize the converse to Pascal's Theorem, sometimes called the Braikenridge-Maclaurin Theorem. In particular, we show that if 2k lines meet a given line, colored green, in…

Algebraic Geometry · Mathematics 2011-08-18 Will Traves

A competition process on $\mathbb{Z}^d$ is considered, where two species compete to color the sites. The entities are driven by branching random walks. Specifically red (blue) particles reproduce in discrete time and place offspring…

Probability · Mathematics 2022-03-29 Maria Deijfen , Timo Vilkas

We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area with location and congestion dependent costs. We study both…

Computer Science and Game Theory · Computer Science 2009-10-29 Alonso Silva , Eitan Altman , Pierre Bernhard , Merouane Debbah

It has long been known that random regular graphs are with high probability good expanders. This was first established in the 1980s by Bollob\'as by directly calculating the probability that a set of vertices has small expansion and then…

Discrete Mathematics · Computer Science 2012-11-05 Michael Lampis

Asymptotic normality for the natural volume measure of random polytopes generated by random points distributed uniformly in a convex body in spherical or hyperbolic spaces is proved. Also the case of Hilbert geometries is treated and…

Probability · Mathematics 2019-09-13 Florian Besau , Christoph Thäle

It is proved that for integers $b, r$ such that $3 \leq b < r \leq \binom{b+1}{2} - 1$, there exists a red/blue edge-colored graph such that the red degree of every vertex is $r$, the blue degree of every vertex is $b$, yet in the closed…

Combinatorics · Mathematics 2023-12-15 Yair Caro , Josef Lauri , Xandru Mifsud , Raphael Yuster , Christina Zarb

To determine the relative position of any two surfaces in a system, one approach is to useoperations (Minkowski sum and intersection) on sets of constraints. These constraints aremade compliant with half-spaces of R^n where each set of…

Computational Geometry · Computer Science 2015-09-30 Lazhar Homri , Denis Teissandier , Alex Ballu
‹ Prev 1 3 4 5 6 7 10 Next ›