Related papers: Existence Proofs of Some EXIT Like Functions
This work proposes a tractable estimation of the maximum a posteriori (MAP) threshold of various families of sparse-graph code ensembles, by using an approximation for the extended belief propagation generalized extrinsic information…
Extrinsic Information Transfer (EXIT) functions can be measured by statistical methods if the message alphabet size is moderate or if messages are true a-posteriori distributions. We propose an approximation we call mixed information that…
We study semilinear elliptic equations on finite graphs with fully general exponential nonlinearities, thereby extending classical equations such as the Kazdan-Warner and Chern-Simons equations. A key contribution of this work is the…
For finite length polar codes, channel polarization leaves a significant number of channels not fully polarized. Adding a Cyclic Redundancy Check (CRC) to better protect information on the semi-polarized channels has already been…
The time at which a one-dimensional continuous strong Markov process attains a boundary point of its state space is a discontinuous path functional and it is, therefore, unclear whether the exit time can be approximated by hitting times of…
We analyze, mainly using bifurcation methods, an elliptic superlinear problem in one-dimension with periodic boundary conditions. One of the main novelties is that we follow for the first time a bifurcation approach, relying on a…
The asymmetric simple exclusion process (ASEP) is a paradigm for non-equilibrium physics that appears as a building block to model various low-dimensional transport phenomena, ranging from intracellular traffic to quantum dots. We review…
This paper employs the extrinsic information transfer (EXIT) method, a technique imported from the analysis of the iterative decoding of error control codes, to study the performance of belief propagation in community detection in the…
The standard Bayesian Information Criterion (BIC) is derived under regularity conditions which are not always satisfied by the graphical models with hidden variables. In this paper we derive the BIC score for Bayesian networks in the case…
Recently, a generalized Bernoulli process (GBP) was developed as a stationary binary sequence whose covariance function obeys a power law. In this paper, we further develop generalized Bernoulli processes, reveal their asymptotic behaviors,…
Motivated by applications in chemistry and other sciences, we study the expressive power of message-passing neural networks for geometric graphs, whose node features correspond to 3-dimensional positions. Recent work has shown that such…
We study the asymmetric simple exclusion process (ASEP) on a segment $\{1,\ldots,b_N\}$ and are interested in its total variation distance to equilibrium when started from an initial configuration $\xi^{N}$. We provide a general result…
Axiomatization and expressibility problems for Milner's process semantics (1984) of regular expressions modulo bisimilarity have turned out to be difficult for the full class of expressions with deadlock 0 and empty step~1. We report on a…
We describe certain extremalities for Gallager's $E_0$ function evaluated under the uniform input distribution for binary input discrete memoryless channels. The results characterize the extremality of the $E_0(\rho)$ curves of the binary…
The technique known as Grilliot's trick constitutes a template for explicitly defining the Turing jump functional $(\exists^2)$ in terms of a given effectively discontinuous type two functional. In this paper, we discuss the standard…
Aiming to remedy the incorrect asymptotic behavior of conventional semilocal exchange-correlation (XC) density functionals for finite systems, we propose an asymptotic correction scheme, wherein an exchange density functional whose…
In this work, we derive a new sharp asymptotic equivalent in the small temperature regime $h\to 0$ for the mean exit time from a bounded domain for the non-reversible process $dX\_t=b(X\_t)dt + \sqrt h \, dB\_t$ under a generic orthogonal…
Regularization is one of the most fundamental topics in optimization, statistics and machine learning. To get sparsity in estimating a parameter $u\in\mathbb{R}^d$, an $\ell_q$ penalty term, $\Vert u\Vert_q$, is usually added to the…
This paper studies the mixing behavior of the Asymmetric Simple Exclusion Process (ASEP) on a segment of length $N$. Our main result is that for particle densities in $(0,1),$ the total-variation cutoff window of ASEP is $N^{1/3}$ and the…
Previous work has suggested that the structural restrictions of graphs from classes of bounded expansion--locally dense pockets in a globally sparse graph--naturally coincide with common properties of real-world networks such as clustering…