Related papers: Existence Proofs of Some EXIT Like Functions
The output distribution, when rate is above capacity, is investigated. It is shown that there is an asymptotic equipartition property (AEP) of the typical output sequences, independently of the specific codebook used, as long as the…
We consider the biased card shuffling and the Asymmetric Simple Exclusion Process (ASEP) on the segment. We obtain the asymptotic of their mixing times: our result show that these two continuous-time Markov chains display cutoff. Our…
Graph Neural Networks (GNNs) are increasingly adopted across domains such as molecular biology and social network analysis, yet their black-box nature hinders interpretability and trust. This is especially problematic in high-stakes…
We present an automated classification of 2165 \textit{Kepler} eclipsing binary (EB) light curves that accompanied the second \textit{Kepler} data release. The light curves are classified using Locally Linear Embedding, a general nonlinear…
It is well known that an arbitrary graphical model of statistical inference defined on a tree, i.e. on a graph without loops, is solved exactly and efficiently by an iterative Belief Propagation (BP) algorithm convergent to unique minimum…
Following Zhou's framework, we consider the emergent geometry of the generalized Br\'ezin-Gross-Witten models whose partition functions are known to be a family of tau-functions of the BKP hierarchy. More precisely, we construct a spectral…
This work introduces operator space analogues of the Separable Extension Property (SEP) for Banach spaces; the Complete Separable Extension Property (CSEP) and the Complete Separable Complemention Property (CSCP). The results use the…
This paper presents an in-depth analysis of the generalized isotonic recursive partitioning (GIRP) algorithm for fitting isotonic models under separable convex losses, proposed by Luss and Rosset [J. Comput. Graph. Statist., 23 (2014), pp.…
Boundary analysis is developed for a rich class of generally infinite weighted graphs with compact metric completions. These graph completions have totally disconnected boundaries. The classical notion of $\epsilon$-components and the…
The Baik-Ben Arous-Peche (BBP) transition sets fundamental limits for detecting low-rank structure in noisy high-dimensional data and underlies a wide range of spectral methods in many fields from physics to statistics and data sciences. In…
A loop series expansion for the partition function of a general statistical model on a graph is carried out. If the auxiliary probability distributions of the expansion are chosen to be a fixed point of the belief-propagation equation, the…
We generalize the Brezzi-Rappaz-Raviart approximation theorem, which allows to obtain existence and a priori error estimates for approximations of solutions to some nonlinear partial differential equations. Our contribution lies in the fact…
A new functional form for the exchange enhancement in the generalized gradient approximation within density functional theory is given. The functional form satisfies the constraints used to construct the Perdew-Burke-Ernzerhof (PBE)…
Reeb graphs are an important tool for abstracting and representing the topological structure of a function defined on a manifold. We have identified three properties for faithfully representing Reeb graphs in a visualization: they should be…
We prove that the equational theory of the positive calculus of relations with transitive closure (PCoR*) is EXPSPACE-complete. Here, PCoR* terms consist of the following standard operators on binary relations: identity, empty,…
The totally asymmetric simple exclusion process with generalized update is a version of the discrete time totally asymmetric exclusion process with an additional inter-particle interaction that controls the degree of particle clustering.…
We show that Reed-Muller codes achieve capacity under maximum a posteriori bit decoding for transmission over the binary erasure channel for all rates $0 < R < 1$. The proof is generic and applies to other codes with sufficient amount of…
In transcendental dynamics significant progress has been made by studying points whose iterates escape to infinity at least as fast as iterates of the maximum modulus. Here we take the novel approach of studying points whose iterates escape…
The Graph Burning Problem (GBP) is a combinatorial optimization problem that has gained relevance as a tool for quantifying a graph's vulnerability to contagion. Although it is based on a very simple propagation model, its decision version…
Excursion reflected Brownian motion (ERBM) is a strong Markov process defined in a finitely connected domain $D \subset \C$ that behaves like a Brownian motion away from the boundary of $D$ and picks a point according to harmonic measure…