Related papers: Sensitivity and block sensitivity of nested canaly…
This paper investigates the problem of synthesizing joint distributions in the finite-length regime. For a fixed blocklength $n$ and an upper bound on the distribution approximation $\epsilon$, we prove a capacity result for fixed-length…
This article employs techniques from convex analysis to present characterizations of (maximal) $n-$monotonicity, similar to the well-established characterizations of (maximal) monotonicity found in the existing literature. These…
Sensitivity properties describe how changes to the input of a program affect the output, typically by upper bounding the distance between the outputs of two runs by a monotone function of the distance between the corresponding inputs. When…
Long-term operation of nuclear steam generators can result in the occurrence of clogging, a deposition phenomenon that may increase the risk of mechanical and vibration loadings on tube bundles and internal structures as well as potentially…
This paper presents conservative probabilistic bounds for the spectrum of the admittance matrix and classical linear power flow models under uncertain network parameters; for example, probabilistic line contingencies. Our proposed approach…
A generalization of modularity, called block modularity, is defined. This is a quality function which evaluates a label assignment against an arbitrary block pattern. Therefore, unlike standard modularity or its variants, arbitrary network…
Networks of channels conveying particles are often subject to blockages due to the limited carrying capacity of the individual channels. If the channels are coupled, blockage of one causes an increase in the flux entering the remaining open…
A frequentist definition of sensitivity of a search for new phenomena is discussed, that has several useful properties. It is based on completely standard concepts, is generally applicable, and has a very clear interpretation. It is…
This paper investigates the maximum coding rate at which data can be transmitted over a noncoherent, multiple-input, multiple-output (MIMO) Rayleigh block-fading channel using an error-correcting code of a given blocklength with a…
We prove a lower bound of $\tilde{\Omega}(n^{1/3})$ for the query complexity of any two-sided and adaptive algorithm that tests whether an unknown Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is monotone or far from monotone. This…
This paper lies in the context of the studies of eigenfunctions of graphs having minimum cardinality of support. One of the tools is the weight-distribution bound, a lower bound on the cardinality of support of an eigenfunction of a…
We establish new upper and lower bounds on the number of queries required to test convexity of functions over various discrete domains. 1. We provide a simplified version of the non-adaptive convexity tester on the line. We re-prove the…
Sensitivities of nuclear reaction rates to a variation of nuclear properties are studied. Target nuclei range from proton- to neutron-dripline for 10<=Z<=83. Reactions considered are nucleon- and alpha-induced reactions mediated by the…
We consider single-sink network flow problems. An instance consists of a capacitated graph (directed or undirected), a sink node $t$ and a set of demands that we want to send to the sink. Here demand $i$ is located at a node $s_i$ and…
The reliability function of memoryless channels with noiseless feedback and variable-length coding has been found to be a linear function of the average rate in the classic work of Burnashev. In this work we consider unifilar channels with…
In the context of extremely large-scale antenna arrays deployed in sixth-generation (6G) mobile networks, near-field (NF) communications have gained considerable attention. Unlike the planar waves formulated in the far-field,…
Circular-shift linear network coding (LNC) is a class of vector LNC with low encoding and decoding complexities, and with local encoding kernels chosen from cyclic permutation matrices. When $L$ is a prime with primitive root $2$, it was…
In~\cite{bgs2013}, exclusion sensitivity and exclusion stability for symmetric exclusion processes on graphs were defined as a natural analogue of noise sensitivity and noise stability in this setting. As these concepts were defined for any…
Oscillators based on levitated particles are promising for the development of ultrasensitive force detectors. The theoretical performance of levitated nanomechanical sensors is usually characterized by the so-called thermal noise limit…
The minimum-cost flow (MCF) problem is a fundamental optimization problem with many applications and seems to be well understood. Over the last half century many algorithms have been developed to solve the MCF problem and these algorithms…