相关论文: Generalized Measures of Fault Tolerance in Exchang…

We present a method which provides a unified framework for most stability theorems that have been proved in graph and hypergraph theory. Our main result reduces stability for a large class of hypergraph problems to the simpler question of…

In this paper we prove that for an ergodic hyperbolic measure $\omega$ of a $C^{1+\alpha}$ diffeomorphism $f$ on a Riemannian manifold $M$, there is an $\omega$-full measured set $\widetilde{\Lambda}$ such that for every invariant…

Elementary trapping sets (ETSs) are the main culprits for the performance of LDPC codes in the error floor region. Due to the large quantity, complex structures, and computational difficulties of ETSs, how to eliminate dominant ETSs in…

We introduce a one-parameter family of Borel regular measures on $\mathbb{R}^n$ that enhances Lebesgue measure by incorporating a scale-invariant penalty for codimension-1 boundary structures. Utilizing Carath\'eodory's outer measure…

Coherent errors in quantum operations are ubiquitous. Whether arising from spurious environmental couplings or errors in control fields, such errors can accumulate rapidly and degrade the performance of a quantum circuit significantly more…

We consider one dimensional generalized parabolic Cahn-Hilliard equation $$ u_t=-\partial_{xx}\big[\partial_{xx}u-W'(u)\big]+W''(u)\big[\partial_{xx} u -W'(u)\big], \qquad \forall\, (t,x)\in [0,+\infty)\times {\mathbb R}, $$ where the…

Tangent measure and blow-up methods, are powerful tools for understanding the relationship between the infinitesimal structure of the boundary of a domain and the behavior of its harmonic measure. We introduce a method for studying tangent…

This paper studies distributed strategies for average-consensus of arbitrary vectors in the presence of network interference. We assume that the underlying communication on any \emph{link} suffers from \emph{additive interference} caused…

Recent work has established that, for every positive integer $k$, every $n$-node graph has a $(2k-1)$-spanner on $O(f^{1-1/k} n^{1+1/k})$ edges that is resilient to $f$ edge or vertex faults. For vertex faults, this bound is tight. However,…

The Network-on-Chips is a promising candidate for addressing communication bottlenecks in many-core processors and neural network processors. In this work, we consider the generalized fault-tolerance topology generation problem, where the…

To the best of our knowledge, since the extended horizontal linear complementarity problem (EHLCP) was first introduced and studied by Kaneko in 1977, no iterative methods or error analysis have been developed for it due to the…

Aims: Try to prove the $n$-dimensional balanced hypercube $BH_n$ is $(2n-2)$-fault-tolerant-prescribed hamiltonian laceability. Methods: Prove it by induction on $n$. It is known that the assertation holds for $n\in\{1,2\}$. Assume it holds…

We study tools for inference conditioned on model selection events that are defined by the generalized lasso regularization path. The generalized lasso estimate is given by the solution of a penalized least squares regression problem, where…

Electrical impedance tomography (EIT) is a non-invasive imaging method with diverse applications, including medical imaging and non-destructive testing. The inverse problem of reconstructing internal electrical conductivity from boundary…

A novel perturbative method, proposed by Panda {\it et al.} [1] to solve the Helmholtz equation in two dimensions, is extended to three dimensions for general boundary surfaces. Although a few numerical works are available in the literature…

We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to generalize known constructs involving relativized unambiguity based complexity classes (UP and \mathcal{UP}) to new constructs…

For a simple model of mutually interacting qubits it is shown how the errors induced by mutual interactions can be eliminated using concatenated coding. The model is solved exactly for arbitrary interaction strength, for two well-known…

In Bayesian multilevel models, the data are structured in interconnected groups, and their posteriors borrow information from one another due to prior dependence between latent parameters. However, little is known about the behaviour of the…

Vertex-fault-tolerance was introduced by Hayes~\cite{Hayes1976} in 1976, and since then it has been systematically studied in different aspects. In this paper we study $k$-vertex-fault-tolerant graphs for $p$ disjoint complete graphs of…

For two graphs $F$ and $H$, the relative Tur\'{a}n number $\mathrm{ex}(H,F)$ is the maximum number of edges in an $F$-free subgraph of $H$. Foucaud, Krivelevich, and Perarnau \cite{FKP} and Perarnau and Reed \cite{PR} studied these…