Results 41 to 50 of about 8,255 (178)
Two families of dependence measures between random variables are introduced. They are based on the R\'enyi divergence of order $\alpha$ and the relative $\alpha$-entropy, respectively, and both dependence measures reduce to Shannon's mutual information ...
Lapidoth, Amos, Pfister, Christoph
core +1 more source
Robust estimation of a Markov chain transition matrix from multiple sample paths
Markov chains are fundamental models for stochastic dynamics, with applications in a wide range of areas such as population dynamics, queueing systems, reinforcement learning, and Monte Carlo methods. Estimating the transition matrix and stationary distribution from observed sample paths is a core statistical challenge, particularly when multiple ...
Lasse Leskelä, Maximilien Dreveton
wiley +1 more source
Topology of random simplicial complexes: a survey
This expository article is based on a lecture from the Stanford Symposium on Algebraic Topology: Application and New Directions, held in honor of Gunnar Carlsson, Ralph Cohen, and Ib Madsen.Comment: After revisions, now 21 pages, 5 ...
Kahle, Matthew
core +1 more source
Topologically Protected Negative Entanglement
It is revealed that topological flat‐band edge states can lead to robust unconventional negative entanglement entropy scaling. This arises from a new mechanism of non‐Hermitian critical skin compression (nHCSC), which strongly “compresses” quantum information beyond flat‐band degeneracy.
Wen‐Tan Xue, Ching Hua Lee
wiley +1 more source
Synthesis of amoxicillin: The reaction catalyzed by penicillin G acylase is investigated in an enzymatic reactor, considering both Michaelis–Menten and mechanism‐based models with reaction and equilibrium constants. Parameters are estimated via MCMC and Genetic Algorithm, with MCMC showing superior performance in validating the mathematical model in a ...
Lucas Figueiredo Formigosa +5 more
wiley +1 more source
Scalable Hash-Based Estimation of Divergence Measures
We propose a scalable divergence estimation method based on hashing. Consider two continuous random variables $X$ and $Y$ whose densities have bounded support.
Hero III, Alfred O., Noshad, Morteza
core +1 more source
ABSTRACT Unarguably, malware and their variants have metamorphosed into objects of attack and cyber warfare. These issues have directed research focus to modeling infrastructural settings and infection scenarios, analyzing propagation mechanisms, and conducting studies that highlight optimized remedial measures.
Chukwunonso Henry Nwokoye
wiley +1 more source
On Nonlinear Compression Costs: When Shannon Meets Rényi
In compression problems, the minimum average codeword length is achieved by Shannon entropy, and efficient coding schemes such as Arithmetic Coding (AC) achieve optimal compression.
Andrea Somazzi +2 more
doaj +1 more source
The random graph process is globally synchronizing
Abstract The homogeneous Kuramoto model on a graph G=(V,E)$G = (V,E)$ is a network of |V|$|V|$ identical oscillators, one at each vertex, where every oscillator is coupled bidirectionally (with unit strength) to its neighbors in the graph. A graph G$G$ is said to be globally synchronizing if, for almost every initial condition, the homogeneous Kuramoto
Vishesh Jain +2 more
wiley +1 more source
We consider Erd\H{o}s-R\'{e}nyi graphs $G(n,p_n)$ with large constant expected degree $\lambda$ and $p_n=\lambda/n$. Bordenave and Lelarge (2010) showed that the infinite-volume limit, in the Benjamini-Schramm topology, is a Galton-Watson tree with ...
Jung, Paul, Lee, Jaehun
core +1 more source

