Related papers: Divide and color representations for threshold Gau…
We derive, up to a constant factor, matching lower and upper bounds on the concentration functions of suprema of separable centered Gaussian processes and order statistics of Gaussian random fields. These bounds reveal that suprema of…
Two sets of objects of size $n$ are to be matched to each other based on i.i.d. costs associated to every pair of objects. Objects prefer to be matched as cheaply as possible, and a matching is said to be stable if there is no pair of…
The paper presents techniques to derive upper bounds for the mean time to recover from a single fault for self-stabilizing algorithms in the message passing model. For a new Delta+1-coloring algorithm we analytically derive a bound for the…
In this paper, we study parameter-independent stability in qualitatively heterogeneous passive networked systems containing damped and undamped nodes. Given the graph topology and a set of damped nodes, we ask if output consensus is…
This paper considers the class of stochastic processes $X$ which are Volterra convolutions of a martingale $M$. When $M$ is Brownian motion, $X$ is Gaussian, and the class includes fractional Brownian motion and other Gaussian processes…
For $(X_t)$ a two-sided $\alpha$-stable moving average, this paper studies the conditional distribution of future paths given a piece of observed trajectory when the process is far from its central values. Under this framework, vectors of…
We have studied the conductance distribution function of two-dimensional disordered noninteracting systems in the crossover regime between the diffusive and the localized phases. The distribution is entirely determined by the mean…
We derive a scale-free bound on the density of the maximum of a centered Gaussian vector. The basic bound is non-uniform, depends logarithmically on the dimension, and allows any covariance matrix. When the largest marginal variance is…
A novel representation of functions, called generalized Taylor form, is applied to the filtering of white noise processes. It is shown that every Gaussian colored noise can be expressed as the output of a set of linear fractional stochastic…
In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is…
Let $\boldsymbol{X}(t)=(X_1(t),\ldots,X_d(t)), t\in [0,S]$ be a Gaussian vector process and let $g(\boldsymbol{x}),\boldsymbol{x}\in\mathbb{R}^d$ be a continuous homogeneous function. In this paper we are concerned with the exact tail…
A new class of fully decoupled consistent splitting schemes for the Navier-Stokes equations are constructed and analyzed in this paper. The schemes are based on the Taylor expansion at $t^{n+\beta}$ with $\beta\ge 1$ being a free parameter.…
Let $B$ be a $d$-dimensional Gaussian process on $\mathbb{R}$, where the component are independents copies of a scalar Gaussian process $B_0$ on $\mathbb{R}_+$ with a given general variance function…
For many random Constraint Satisfaction Problems, by now, we have asymptotically tight estimates of the largest constraint density for which they have solutions. At the same time, all known polynomial-time algorithms for many of these…
In this paper we consider various splitting schemes for unsteady problems containing the grad-div operator. The fully implicit discretization of such problems would yield at each time step a linear problem that couples all components of the…
We study an infinite system of independent symmetric random walks on a hierarchical group, in particular, the c-random walks. Such walks are used, e.g., in population genetics. The number variance problem consists in investigating if the…
Uncertainty quantification based on generalized polynomial chaos has been used in many applications. It has also achieved great success in variation-aware design automation. However, almost all existing techniques assume that the parameters…
A proper coloring of a graph is \emph{conflict-free} if, for every non-isolated vertex, some color is used exactly once on its neighborhood. Caro, Petru\v{s}evski, and \v{S}krekovski proved that every graph $G$ has a proper conflict-free…
In this paper, we study the phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a group of non-mobile agents form either a fixed connected…
We present a notion of $\Delta$-stability and stability filtration in arbitrary categories which is equivalent to the existence of Harder-Narasimhan (HN) sequences on objects. Indeed it is equivalent to the existence of a zero morphism, a…