Related papers: Existence Proofs of Some EXIT Like Functions
Exponential random graph models (ERGMs) are a widely used framework for network data, enabling hypothesis testing on the structural mechanisms underlying observed networks. Bayesian ERGMs provide principled uncertainty quantification and…
This paper introduces new variational methods centered on the direct application of a profile decomposition theorem for bounded sequences in Sobolev spaces. We employ these methods to prove the existence of ground state solutions for a…
We introduce the Scattered Extrinsic Information Transfer (S-EXIT) chart as a tool for optimizing degree profiles of short length Low-Density Parity-Check (LDPC) codes under iterative decoding. As degree profile optimization is typically…
We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…
Suppose we have an arrangement $\mathcal{A}$ of $n$ geometric objects $x_1, \dots, x_n \subseteq \mathbb{R}^2$ in the plane, with a distinguished point $p_i$ in each object $x_i$. The generalized transmission graph of $\mathcal{A}$ has…
The one-dimensional asymmetric simple exclusion process (ASEP), where $N$ hard-core particles hop forward with rate $1$ and backward with rate $q<1$, is considered on a periodic lattice of $L$ site. Using KPZ universality and previous…
This paper extends some approximation methods that are used to identify closed form Bit Error Rate (BER) expressions which are frequently utilized in investigation and comparison of performance for wireless communication systems in the…
We study the random loop model with crosses and bars on sparse random graphs. Our main objective is to prove the existence of macroscopic loops, in the sense that a loop visits a positive proportion of the vertices. We develop a…
Our companion work \cite{Stojnicl1BnBxasymldp} considers random under-determined linear systems with box-constrained sparse solutions and provides an asymptotic analysis of a couple of modified $\ell_1$ heuristics adjusted to handle such…
Non-equilibrium systems are often characterized by the transport of some quantity at a macroscopic scale, such as, for instance, a current of particles through a wire. The Asymmetric Simple Exclusion Process (ASEP) is a paradigm for…
This article studies the asymptotic properties of Bayesian or frequentist estimators of a vector of parameters related to structural properties of sequences of graphs. The estimators studied originate from a particular class of graphex…
Graph signal processing (GSP) has emerged as a powerful framework for analyzing data on irregular domains. In recent years, many classical techniques in signal processing (SP) have been successfully extended to GSP. Among them, chirp…
An edge cut C of a graph G is tight if |C \M| = 1 for every perfect matching M of G. Barrier-cuts and 2-separation cuts, also referred to as ELP-cuts, are two important types of tight cuts in matching covered graphs. Edmonds, Lovasz and…
The expected gradient outerproduct (EGOP) of an unknown regression function is an operator that arises in the theory of multi-index regression, and is known to recover those directions that are most relevant to predicting the output.…
The polar transformation of a binary erasure channel (BEC) can be exactly approximated by other BECs. Ar{\i}kan proposed that polar codes for a BEC can be efficiently constructed by using its useful property. This study proposes a new class…
A finite ergodic Markov chain is said to exhibit cutoff if its distance to stationarity remains close to 1 over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Discovered in the context of card…
A graph property is elusive (or evasive) if any algorithm testing it by asking questions of the form ''Is there an edge between vertices x and y?'' must, in the worst case, examine all pairs of vertices. Elusiveness for infinite vertex sets…
The Minkowski Question Mark function relates the continued-fraction representation of the real numbers, to their binary expansion. This function is peculiar in many ways; one is that its derivative is 'singular'. One can show by classical…
In this paper, we investigate semilinear elliptic equations with general exponential-type nonlinearities in two dimensions. For such nonlinearities, we establish two main results. The first is the construction of a singular solution.…
This study proposes \emph{modular arithmetic erasure channels} (MAECs), a novel class of erasure-like channels with an input alphabet that need not be binary. This class contains the binary erasure channel (BEC) and some other known…