English
Related papers

Related papers: On Mappings on the Hypercube with Small Average St…

200 papers

We consider the contact process on a countable-infinite and connected graph of bounded degree. For this process started from the upper invariant measure, we prove certain uniform mixing properties under the assumption that the infection…

Probability · Mathematics 2018-10-17 Stein Andreas Bethuelsen

Let $I=[0,1]$ and consider disjoint closed regions $G_{1},....,G_{n}$ in $% I\times I$ and subintervals $I_{1},......,I_{n},$ such that $G_{i}$ projects onto $I_{i.}$ We define the lower and upper maps $\tau_{1},$ $\tau_{2}$ by the lower…

Dynamical Systems · Mathematics 2013-09-25 A. Boyarsky , P. Góra , Zh. Li

We study a new type of random minimum spanning trees. It is built on the complete graph where each vertex is given a weight, which is a positive real number. Then, each edge is given a capacity which is a random variable that only depends…

Probability · Mathematics 2020-12-04 Othmane Safsafi

It is well known that estimating the expectation of any given bounded random variable with values in $[-B, B]$ has a sample complexity of $\mathrm{O}(B^2/\epsilon^2)$ that is independent of the underlying probability measure. We show that…

Optimization and Control · Mathematics 2026-04-29 Yan Li

Let $(X_i)_{i\geq 1}$ be an i.i.d. sample on $\RRR^d$ having density $f$. Given a real function $\phi$ on $\RRR^d$ with finite variation and given an integer valued sequence $(j_n)$, let $\fn$ denote the estimator of $f$ by wavelet…

Statistics Theory · Mathematics 2012-01-27 Davit Varron

A well-known open problem on the behavior of optimal paths in random graphs in the strong disorder regime, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [31,32,38,70] is as…

Probability · Mathematics 2024-01-15 Shankar Bhamidi , Sanchayan Sen

We construct a refined bijection $\phi$ between alternating permutations and 0-1-2 increasing trees with degree at most 2. It satisfies that the first element of alternating permutation $\pi$ is equal to the first vertex in $\phi(\pi)$ in…

Combinatorics · Mathematics 2010-03-25 Heesung Shin

We establish the following two main results on order types of points in general position in the plane (realizable simple planar order types, realizable uniform acyclic oriented matroids of rank $3$): (a) The number of extreme points in an…

Computational Geometry · Computer Science 2022-06-09 Xavier Goaoc , Emo Welzl

An HI mass function (HIMF) was derived for 751 galaxies selected from the deep Parkes HI survey across the Zone of Avoidance (HIZOA). HIZOA contains both the Great Attractor Wall and the Local Void, two of the most extreme environments in…

Astrophysics of Galaxies · Physics 2019-04-17 Khaled Said , Renée C. Kraan-Korteweg , Lister Staveley-Smith

Let $(X,d)$ be a compact metric space, $f:X \mapsto X$ be a continuous map satisfying a property we call almost specification (which is slightly weaker than the $g$-almost product property of Pfister and Sullivan), and $\phi$ be a…

Dynamical Systems · Mathematics 2012-05-04 Daniel J. Thompson

The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over…

Statistical Mechanics · Physics 2010-04-27 Allon G. Percus , Gabriel Istrate , Bruno Goncalves , Robert Z. Sumi , Stefan Boettcher

A $(\phi,\epsilon)$-expander-decomposition of a graph $G$ (with $n$ vertices and $m$ edges) is a partition of $V$ into clusters $V_1,\ldots,V_k$ with conductance $\Phi(G[V_i]) \ge \phi$, such that there are $O(\epsilon m)$ inter-cluster…

Data Structures and Algorithms · Computer Science 2025-11-20 Daniel Agassy , Dani Dorfman , Haim Kaplan

Given F:[a,b]^k\to [a,b] and a nonconstant X_0 with P(X_0\in [a,b])=1, define the hierarchical sequence of random variables {X_n}_{n\ge 0} by X_{n+1}=F(X_{n,1},...,X_{n,k}), where X_{n,i} are i.i.d. as X_n. Such sequences arise from…

Probability · Mathematics 2007-05-23 Larry Goldstein

The Swift-Hohenberg equation (SHE) is a partial differential equation that explains how patterns emerge from a spatially homogeneous state. It has been widely used in the theory of pattern formation. Following a recent study by Bramburger…

Pattern Formation and Solitons · Physics 2023-12-19 Georgi S. Medvedev , Dmitry E. Pelinovsky

The purpose of this article is to prove a generalisation of the Besicovitch-Federer projection theorem about a characterisation of rectifiable and unrectifiable sets in terms of their projections. For an $m$-unrectifiable set…

Functional Analysis · Mathematics 2016-12-15 Jacek Gałęski

Let $\mathcal{A}$ be a union-closed family of sets with base set $b(\mathcal{A})=\bigcup_{A \in \mathcal{A}}A$ denoted by $[n]=\{1, \cdots, n\}$, and for any real $x>0$, let $\mathcal{A}_{<x} = \{A \in \mathcal{A} \ | \ |A| < x\}$. Also,…

Combinatorics · Mathematics 2025-09-17 Christopher Bouchard

Let $\Theta^{(n)}$ be a random vector uniformly distributed on the unit sphere $\mathbb S^{n-1}$ in $\mathbb R^n$. Consider the projection of the uniform distribution on the cube $[-1,1]^n$ to the line spanned by $\Theta^{(n)}$. The…

Probability · Mathematics 2021-09-21 Samuel G. G. Johnston , Zakhar Kabluchko , Joscha Prochno

We extend the semiclassical theory of scarring of quantum eigenfunctions psi_{n}(q) by classical periodic orbits to include situations where these orbits undergo generic bifurcations. It is shown that |psi_{n}(q)|^{2}, averaged locally with…

Chaotic Dynamics · Physics 2009-10-31 J. P. Keating , S. D. Prado

We study the problem of estimating the average of a Lipschitz continuous function $f$ defined over a metric space, by querying $f$ at only a single point. More specifically, we explore the role of randomness in drawing this sample. Our goal…

Data Structures and Algorithms · Computer Science 2011-01-21 Abhimanyu Das , David Kempe

The expansion of a hypergraph, a natural extension of the notion of expansion in graphs, is defined as the minimum over all cuts in the hypergraph of the ratio of the number of the hyperedges cut to the size of the smaller side of the cut.…

Data Structures and Algorithms · Computer Science 2014-04-18 Anand Louis , Yury Makarychev