Related papers: Existence Proofs of Some EXIT Like Functions
We prove a large deviation principle for a greedy exploration process on an Erd\"os-R\'enyi (ER) graph when the number of nodes goes to infinity. To prove our main result, we use the general strategy to study large deviations of processes…
We present an extension of the BEER model for eccentric binaries - eBEER, approximating the BEaming, Ellipsoidal and Reflection effects by harmonic series of the Keplerian elements of their orbit. As such, it can be a tool for fast…
In this paper, in order to characterize the critical error linear complexity spectrum (CELCS) for $2^n$-periodic binary sequences, we first propose a decomposition based on the cube theory. Based on the proposed $k$-error cube…
We consider elliptic systems with superlinear and subcritical boundary conditions and a bifurcation parameter as a multiplicative factor. By combining the rescaling method with degree theory and elliptic regularity theory, we prove the…
We consider the asymmetric simple exclusion process (ASEP) on a semi-infinite chain which is coupled at the end to a reservoir with a particle density that changes periodically in time. It is shown that the density profile assumes a…
In this paper we will deal with problems in approximation theory of bounded analytic functions on the unit disc and their boundary behavior on the unit circle. We will attempt to unify two known such theorems to create a stronger theorem.…
We describe a practical algorithm for computing Brauer-Manin obstructions to the existence of rational points on hyperelliptic curves defined over number fields. This offers advantages over descent based methods in that its correctness does…
Edmonds, Lov\'asz, and Pulleyblank showed that if a matching covered graph has a nontrivial tight cut, then it also has a nontrivial ELP-cut. Carvalho et al. gave a stronger conjecture: if a matching covered graph has a nontrivial tight cut…
We consider the asymmetric exclusion process (ASEP) in one dimension on sites $i = 1,..., N$, in contact at sites $i=1$ and $i=N$ with infinite particle reservoirs at densities $\rho_a$ and $\rho_b$. As $\rho_a$ and $\rho_b$ are varied, the…
Considering the large deviations of activity and current in the Asymmetric Simple Exclusion Process (ASEP), we show that there exists a non-trivial correspondence between the joint scaled cumulant generating functions of activity and…
We consider the totally asymmetric simple exclusion process (TASEP) on a periodic one-dimensional lattice of L sites. Using Bethe ansatz, we derive parametric formulas for the eigenvalues of its generator in the thermodynamic limit. This…
Extending independently the Balitsky-Kovchegov (BK) equation to running coupling or to fluctuation effects due to Pomeron loops is known to lead in both cases to qualitative changes of the traveling-wave asymptotic solutions. In this paper…
It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…
Using complex methods combined with Baire's Theorem we show that one-sided extendability, extendability and real analyticity are rare phenomena on various spaces of functions in the topological sense. These considerations led us to…
Using the generalized normally ordered form of words in a locally-free group of $n$ generators, we show that in the limit $n\to\infty$, the partition function of weighted directed lattice animals on a semi-infinite strip coincides with the…
The symmetric simple exclusion process (SEP) is a paradigmatic model of diffusion in a single-file geometry, in which the particles cannot cross. In this model, the study of currents have attracted a lot of attention. In particular, the…
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (BEC) with bounded complexity per…
Graph Neural Networks (GNNs) have received increasing attention due to their ability to learn from graph-structured data. However, their predictions are often not interpretable. Post-hoc instance-level explanation methods have been proposed…
The totally asymmetric simple exclusion process (TASEP), which describes the stochastic dynamics of interacting particles on a lattice, has been actively studied over the past several decades and applied to model important biological…
We study explosive percolation (EP) on Erd\"{o}s-R\'{e}nyi network for product rule (PR) and sum rule (SR). Initially, it was claimed that EP describes discontinuous phase transition, now it is well-accepted as a probabilistic model for…