Peer Revenue Past citations are no guarantee of future returns

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Monday 4 May

Algebraic Topology

The Algebra of Categorical Spectra

Categorical spectra are spectrum objects in pointed $(\infty,\infty)$-categories: sequences $(X_n)$ equipped with equivalences $X_n\simeq \Omega X_{n+1}$. This thesis develops foundations for categorical spectra and constructs their tensor product, the stabilized analogue of the lax Gray tensor product of $(\infty,\infty)$-categories. We use this tensor product to study stability phenomena, expressed as the coincidence of certain finite weighted colimits and limits. As an application, we give a precise categorical derivation of the cobordism hypothesis with singularities from the ordinary cobordism hypothesis, making rigorous a sketch of Lurie.
Read the full abstract

2605.03114 · 4 May · Revised version of the author's thesis, originally submitted in July 2024. The main results remain unchanged, but several proofs have been improved and typos are fixed. https://jscholarship.library.jhu.edu/handle/1774.2/70013 v2: removed incorrect claims about closure of strong Steiner complexes under partial duality (Prop 2.4.17 and Remark A.2.5)

Combinatorics

Linearly distributive coherence in the absence of units

Coherence in a monoidal category asserts that all morphisms built from structural isomorphisms with a fixed source and target coincide. These structural isomorphisms include, in particular, the associators. Linearly distributive categories carry two tensor products, with structural morphisms given by associators and distributors relating the two tensor products. In several examples, including Grothendieck–Verdier categories, also known as $\ast$-autonomous categories, these distributors need not be invertible. We give a self-contained proof that linearly distributive categories without units are coherent, while units may obstruct coherence. With the same techniques, we also establish an analogous coherence result for Frobenius linearly distributive functors without units. These results admit a reformulation in terms of directed paths in associahedra and multiplihedra.
Read the full abstract

Algebraic Geometry

Gaiotto Loci and the Nilpotent Cone for $\mathrm{Sp}_{2n}(\mathbb C)$

Fix a theta characteristic on a compact Riemann surface and let $G$ be a connected complex semisimple Lie group equipped with a symplectic representation. The moment map sends a nonzero spinor with values in the associated representation bundle to a $G$-Higgs field, and the Zariski closure of the stable Higgs bundles obtained in this way is the corresponding Gaiotto locus. For an arbitrary symplectic representation, the Gaiotto locus is isotropic, and we give a Petri-type criterion for it to be Lagrangian. For the standard representation of $\mathrm{Sp}_{2n}(\mathbb C)$, with $n\geq 2$, where the moment map is $\psi\mapsto\psi\otimes\psi$, the Gaiotto locus lies in the nilpotent cone. We prove that it is the irreducible component obtained as the Bialynicki-Birula closure associated with $\mathcal U(\mathrm{Sp}_{2n-2}(\mathbb C))$. Its intersection with the stable cotangent chart is the closure of the conormal bundle to the one-spinor stratum of the generalized theta divisor.
Read the full abstract

Group Theory

Congruence rigidity of algebraic groups

We identify the simple algebraic groups over number fields that are, in a suitable sense, determined by their finite adele points. Assuming CSP and Grothendieck rigidity, our results essentially characterize higher rank arithmetic groups that are profinitely solitary: the profinite commensurability class determines the commensurability class among finitely generated residually finite groups. This generalizes previous work of the second author with R. Spitler from split groups to arbitrary groups.
Read the full abstract

Differential Geometry · Cross-listed from cs.LG

Pose Tracking with a Foundation Pose Model and an Ensemble Directional Kalman Filter

This paper introduces the ensemble directional Kalman filter (EnDKF), an ensemble-based Kalman filtering approach for pose tracking that jointly estimates an object's position and attitude using ideas from directional statistics. The EnDKF integrates a unit-quaternion attitude representation to move beyond canonical Kalman filter mean and covariance assumptions that poorly capture directional uncertainty. Experiments on a synthetic constant-velocity constant-angular-velocity system and a digital-twin head-tracking scenario using the FoundationPose algorithm demonstrate a significant reduction in error as opposed to merely using measurements.
Read the full abstract

All authors Tianlu Lu, Asif Sijan, Thomas Noh, Huaijin Chen, Andrey A. Popov

Category Theory

Monads in 2-categories

This is a condensed overview of the formal theory of monads in a 2-category. Commutative diagrams and string diagrams are given side by side. In the string diagrams, each concept is visualized in a way that suggests its properties using topological intuition. For example, monads themselves appear as channels of fluid, suggesting the unit and associativity laws by topological deformation. We cover monads, modules, (co)lax 1-cells and the 2-cells between them, algebra objects, bimodules, distributive laws, codensity monads, and pushforward monads. In addition to the standard 2-categories of monads in a 2-category, we also define two double categories of monads in a 2-category. For example, applied to spans, this yields the two double categories of categories, functors, and retrofunctors upon restricting to the 1-cells carried by functions.
Read the full abstract

Probability

Berry-Esseen bounds for multivariate martingale difference sequences in the Kolmogorov distance

We derive new Gaussian approximations for finite martingale difference sequences in $\mathbb{R}^d$ with respect to the Kolmogorov distance. Under appropriate conditions, our bounds exhibit a dependence of order $n^{-1/4}$ on the length of the sequence and of order $\mathrm{polylog}(d)$ on the dimension. As an application, we derive a high-dimensional Berry-Esseen bound over hyper-rectangles for martingale sequences generated from Markov chains.
Read the full abstract

All authors Weichen Wu, Dung Le, Arun Kumar Kuchibhotla, Alessandro Rinaldo

Algebraic Geometry

Support theorem of universal compactified Jacobians

We prove a full support theorem for the relative good moduli space of the universal compactified Jacobian $\bar{\pi}\colon \overline{J}_{g,n}^{d,\phi}\to \overline{\mathcal{M}}_{g,n}$, showing that every direct summand appearing in the BBDG decomposition of $\mathrm{R}\bar{\pi}_*\mathrm{IC}(\overline{J}_{g,n}^{d,\phi})$ has full support on the base $\overline{\mathcal{M}}_{g,n}$. Moreover, we explicitly describe this decomposition governed by the derived pushforward of the constant sheaf on the universal curve. The first proof synthesizes Maulik and Shen's generalization of Ngô's support theorem, a decomposition theorem for the good moduli space morphism, and equivariant perverse sheaves. We also provide an independent second proof by variation of stability conditions and the support theorem for relative Jacobians by Migliorini, Shende, and Viviani.
Read the full abstract

Combinatorics

Combinatorial aspects of normal ordering of 3-dimensional skew polynomial rings

In this paper, we discuss combinatorial aspects of normal ordering of 3-dimensional skew polynomial rings defined and classified by Bell and Smith \cite{BellSmith1990}. With some help of the Mathematical software SageMath, we are able to reduce the length of computation of PBW forms and normal orderings appearing in commutation rules of these algebras.
Read the full abstract

Combinatorics

Cyclic Sieving Phenomenon for Independent sets of graphs

In this paper, we present examples of the cyclic sieving phenomenon coming from studying independent sets in graphs of a fixed size k. Given a graph G, and a cyclic group C acting on the graph, then C also acts on the collection of independent sets of G of a fixed size k. We exhibit cyclic sieving phenomena for a cyclic group acting on the collection of independent sets of powers of cycle graphs. As a corollary, we also find a closed formula for the number of independent sets of a given size in the power of a cycle graph, and in the power of a path. We also show how the graph construction of whiskering can be used to obtain new cyclic sieving phenomena from old phenomena. We also discuss recursive techniques to exhibit cyclic sieving phenomena for the independent sets of gear graphs, helm graphs, and book graphs.
Read the full abstract

Numerical Analysis

High-Dimensional Enhanced Sampling via Regularized Path-Dependent McKean–Vlasov Dynamics using Tensor Density Approximation

Sampling from high-dimensional Gibbs measures poses a challenge when the energy landscape consists of multiple metastable states. Enhanced-sampling methods mitigate this difficulty by introducing adaptive biasing potentials to facilitate the exploration along prescribed collective variables (CVs), but their scalability is often limited by the dimension of the CV space. Motivated by the Wasserstein-gradient-flow interpretation of adaptive biasing, we propose a regularized path-dependent McKean–Vlasov formulation for high-dimensional enhanced sampling. The formulation replaces the variational regularization of the Wasserstein functional by a direct regularization of the CV marginal density in the McKean–Vlasov drift, avoiding the outer convolution over the CV domain. Furthermore, it replaces the instantaneous law by a weighted path-history measure to improve statistical stability in the small-replica regime. We establish well-posedness of the resulting regularized and path-dependent stochastic dynamics under suitable assumptions. For numerical realization, the history-averaged CV marginal density is approximated using an optimization-free functional hierarchical tensor representation, leading to a scalable density-based adaptive biasing scheme. Numerical experiments on benchmark potentials and molecular systems demonstrate the effectiveness of the proposed method for sampling problems with CV dimensions up to 64.
Read the full abstract

Algebraic Geometry

Bures Geodesics and Restricted Barycenters for Kronecker Positive Definite Matrices

We study the extrinsic Bures–Wasserstein geometry of the determinant-normalized Kronecker model $\mcK_n=\{V\ot U:U,V\in\Sp^n,\ \det U=1\}\subset\Sp^{n^2}$, asking when the ambient Bures geodesic between two Kronecker positive definite matrices can remain in this lower-dimensional model. Local membership near an endpoint is shown to be equivalent to membership of the whole segment, and this happens exactly in the one-factor cases: either $U_1=U_0$ or $V_1$ is a positive scalar multiple of $V_0$. Consequently, any endpoint pair not confined to these one-factor alternatives leaves the model immediately. The criterion is expressed by a partial-trace residual. In fixed commuting charts it becomes an equivalent rank-one square-root profile and yields computable departure diagnostics. We also obtain exact formulas for two restricted barycenter problems: fixed commuting-coordinate slices, solved by Perron singular vectors, and one-factor subfamilies, reduced to standard Bures–Wasserstein barycenters on $\Sp^n$.
Read the full abstract

Optimization and Control · Cross-listed from cs.NI

Sensitivity Analysis of Tactical Wireless Network Design Under Realistic Operational Constraints

The design of tactical wireless networks reflects a complex interplay among structural constraints, technological choices, and underlying modeling assumptions. Although optimization-based approaches have been widely explored, the impact of configuration parameters on network topology quality and overall performance is still not fully understood. This paper presents a comprehensive sensitivity analysis of tactical wireless network design under realistic operational constraints. It systematically investigates three categories of parameters: (i) structural topology rules, including master hub selection; (ii) technological factors such as antenna beamwidth; and (iii) modeling parameters embedded in the objective formulation. Optimized topologies are produced using a Tabu Search metaheuristic, and statistical analyses based on the Friedman and Wilcoxon tests are performed to assess the significance of observed variations across different network sizes. The findings reveal scale-dependent technological transitions and threshold effects in structural constraints. The analysis differentiates parameters that fundamentally reshape network topology from those that primarily influence performance magnitude. Together, these insights provide practical guidance for parameter tuning and topology configuration in mission-critical tactical wireless deployments.
Read the full abstract

Mathematical Physics · Cross-listed from hep-ph

Solution of the boundary problem for the axial-vector field in the hard-wall AdS/QCD model

We solve an equation of motion for the axial-vector field under boundary conditions of the bulk-to-boundary propagator in the framework of the hard-wall model of AdS/QCD. The equation is reduced to the form of a homogeneous ordinary differential equation with varying coefficients. We solve conjugate equations and find fundamental solutions. This allows us to establish main relations and necessity conditions. The integral equation has both Volterra and Fredholm terms and was solved by the iteration method. We apply a new scheme to solve the equation, since all linearly independent necessary conditions for the existence of a solution were defined and used to establish a sufficient condition for Fredholm solvability of the problem.
Read the full abstract

Algebraic Topology

Global dimension of the category of rational incomplete Mackey functors for a finite abelian group G

In this paper, we analyse the global dimension of the category of rational incomplete Mackey functors over a finite abelian group. Incomplete Mackey functors have recently risen to prominence in algebraic topology and hence it is valuable to understand their homological algebra invariants. When working over the rational numbers, results of Greenlees–May and Thévanez–Webb show that the homological algebra of complete Mackey functors is quite simple, but the incomplete case is more complicated. In this paper we use splitting results by the first, third and fourth authors to give an upper bound on the global dimension of rational incomplete Mackey functors where the incompleteness is governed by what is known as a disk-like transfer system. We then avail ourselves of a new connection to incidence algebras over posets to calculate the global dimension of rational incomplete Mackey functors in the disk-like case when the group is abelian.
Read the full abstract

All authors David Barnes, Anna Marie Bohmann, Michael A. Hill, Magdalena Kędziorek

Logic

A Computably Enumerable $tt$-Degree Without Computably Enumerable Irreducible $m$-Degrees

In this paper, we provide a negative solution to Problem 3 formulated by P.~Odifreddi in his survey articles “Strong Reducibilities” (1981) and “Reducibilities” (1999). The problem asks whether every computably enumerable (c.e.) $tt$-degree contains a c.e.\ irreducible $m$-degree (i.e., an $m$-degree consisting of only one $1$-degree). We answer this question in the negative by proving the existence of a c.e.\ $tt$-degree that does not contain any c.e.\ irreducible $m$-degree. Our proof relies on the structural properties of c.e.\ semirecursive sets with a rigid complement, originally constructed by A.~N.~Degtev. We show that the unique c.e.\ $m$-degree contained within the $tt$-degree of such a set consists of simple sets, which cannot be cylinders, and therefore necessarily splits into multiple $1$-degrees. Furthermore, our result demonstrates that a classical 1969 theorem by C.~G.~Jockusch Jr. – which guarantees the existence of an irreducible $m$-degree within every c.e.\ $tt$-degree – is strictly optimal and cannot be generally strengthened to require such an $m$-degree to be computably enumerable.
Read the full abstract

Geometric Topology

Gordian distance and clasper surgery for links

In 2000, Habiro introduced the notion of $C_k$-equivalence of knots and links. This geometric filtration is closely connected to finite type invariants, a class of invariants including Milnor's invariants. Shortly thereafter, Ohyama, Taniyama, and Yamada proved that $C_k$-equivalence, and by extension finite type invariants, say very little about the unknotting number by showing that any knot is at most one crossing change away from being $C_k$-trivial for any $k\in \mathbb{N}$. The same is not true for links, since the pairwise linking number gives a lower bound on unlinking and is an invariant of $C_2$-equivalence. We prove that, aside from the linking number, the result of Ohyama, Taniyama, and Yamada extends to links: any $n$-component link with linking number zero can be reduced to a $C_k$-trivial link in at most $n^2$ crossing changes. As a consequence, Milnor's invariants carry only limited information about the unlinking number. To establish a lower bound, we produce a sequence of $n$-component links for which the crossing change distance to a $C_k$-trivial link grows quadratically in $n$. Notably, these bounds are independent of the choice of $k\in \mathbb{N}$. Finally, we determine the exact number of crossing changes to a $C_k$-trivial link for links with nonzero linking numbers and where no component is $C_k$-trivial.
Read the full abstract

All authors Anthony Bosman, Christopher W. Davis, Taylor Martin, Katherine Vance

Probability

Uniform-in-time quantitative fluctuations of large scale interacting particle systems

We study fluctuations of mean-field interacting particle systems around their McKean–Vlasov limit. Our main result provides a uniform-in-time quantitative central limit theorem for the fluctuation process, with convergence rate of order $N^{-1/2}$ to the corresponding Gaussian limit in the Wasserstein metric. The proof relies on two main ingredients. First, we establish a uniform-in-time weak expansion for specific functionals of the empirical measure around their limiting behavior. This yields, in particular, uniform-in-time control of the convergence of the prelimit variance to its limiting counterpart. We also derive a backward PDE representation of the limiting variance, which is of independent interest. Second, we use Malliavin calculus tools and, in particular, a second-order Poincaré inequality that bounds the Wasserstein distance between the fluctuation process and its Gaussian limit in terms of the first- and second-order Malliavin derivatives of the particle flow. The quantitative convergence rates then follow from a delicate analysis of these derivatives, yielding the sharp estimates required for uniform-in-time control.
Read the full abstract

Combinatorics · Cross-listed from quant-ph

Closed form logical error rate approximations for surface codes

We propose a novel method to calculate logical error rates in surface codes, assuming independent and identically distributed physical errors. These results fit well known scaling laws for studied physical error rates and code distances, but break down in some other regimes. Increasing the code distance still reduces logical error rates, but returns diminish quickly beyond a certain point. We show how to use our method to analyze hypothetical quantum computers with various configurations and select designs with lower error rates. Currently, this requires expensive classical simulations of quantum decoders for various distances and physical error rates or inaccurate extrapolation from minimal experimental data. Instead, we use the symmetry of the problem to count the configurations that result in a logical error with our novel software. Given a physical error rate, we can deduce the probability of a logical error to provably good accuracy quickly. We include an analysis of measurement errors to allow for a more complete comparison of different surface code implementations. We extend this counting method to a particular locally-correlated error model and another globally-correlated error model.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Tweedie-based nonparametric estimation for semicontinuous mixed densities

Semicontinuous outcomes occur frequently in health services, insurance, and cost studies. Standard nonparametric density estimators are not well suited to such data because they do not naturally accommodate the mixed structure, the nonnegative support, or the pronounced boundary effects near zero. To address these limitations, we introduce an asymmetric kernel estimator for mixed densities on $[0,\infty)$ based on the Tweedie distribution. For a power parameter $p\in(1,2)$, the Tweedie kernel itself has a point mass at zero and an absolutely continuous component on $(0,\infty)$, yielding a unified smoothing construction that preserves the atom at zero and smooths the positive component using the full semicontinuous sample. We establish pointwise bias and variance expansions, derive asymptotic formulae for the mean squared error and mean integrated squared error, obtain optimal bandwidth rates, and prove asymptotic normality. We propose a profile least-squares cross-validation procedure to jointly select the bandwidth and the power parameter. Simulation results show competitive performance, particularly in challenging boundary-spike and heavy-tailed settings, and an application to emergency department length-of-stay data illustrates the practical value of the method.
Read the full abstract

Group Theory

Almost planar finitely presented groups

We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely simply connected graphs: a $k$-planar, coarsely simply connected, connected, locally finite, quasi-transitive graph is quasi-isometric to a planar graph.
Read the full abstract

Representation Theory

Pinned Jordan Decomposition of Characters and Depth-Zero Hecke Algebras

We construct a pinned canonical Jordan decomposition of characters for finite reductive groups in cases where the relevant dual centralizers may be disconnected. For a connected reductive group \(G\) over a finite field, with a fixed pinning, and for a semisimple element \(s\in G^*\), we construct a canonical bijection between the Lusztig series \(\mathcal E(G,s)\) and the unipotent characters of \(C_{G^*}(s)^{F^*}\). This refines Lusztig's orbit-valued Jordan decomposition for groups with disconnected centre, and is characterized by compatibility with Deligne–Lusztig character formulae and Harish–Chandra series. We also treat a class of possibly disconnected reductive groups with abelian component group whose rational components admit pinning-preserving representatives. In this setting the natural result is an enriched disconnected Jordan decomposition: the target records the connected unipotent Jordan datum, the source Clifford class, and the corresponding projective Clifford label. When the transported Clifford classes agree with the ordinary Clifford classes on the dual-centralizer side, this enriched target recovers the usual unipotent characters of the corresponding disconnected dual centralizer. The construction uses pinned-normalized preferred extensions of cuspidal unipotent characters, Clifford theory, relative Weyl group comparison, Malle's matching, and connected and disconnected Howlett–Lehrer theory. As an application, we give a pinned canonical form of the finite-field input in Ohara's comparison of depth-zero Hecke algebra parameters with the unipotent case.
Read the full abstract

Information Theory

Linear and cyclic codes over some special rings

In this paper, we describe linear and cyclic codes over the rings of the form $R_{s,p}=\mathbb{Z}_{p}[u]/\left( f\left(u\right) /\left( u-s\right) \right)$, where $p$ is a prime number and $f\left( u\right) =u^{p}-u$, with $s\in \{0,1,...,p-1\}$.

Mathematical Physics · Cross-listed from quant-ph

Relations between different definitions of the quantum Wasserstein distance

The quantum Wasserstein distances defined by Golse, Mouhot, Paul, and Caglioti and by De Palma and Trevisan coincide for qubits when a single operator appears in the cost function. As a consequence, the square of the self-distance equals the Wigner-Yanase skew information in this case. Moreover, for finite-dimensional systems of dimension $d\ge2$ and any number of operators, we show that the Golse-Mouhot-Paul-Caglioti self-distance is bounded from below by the De Palma-Trevisan self-distance.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Can wormholes have vanishing Love numbers?

Wormholes are fascinating alternatives to black hole geometries. In this paper, we have studied a special case of wormhole solution in the context of $R=0$ spacetime. Our approximate analytical calculations show that under a strictly static axial gravitational perturbation of this spacetime, the magnetic-type tidal Love number (for $\ell=2$) vanishes if we keep the solution of the master equation up to linear order in the regularisation parameter of the geometry. Moreover, imposing physically viable boundary conditions on the master variable we have corroborated our result with the numerical solutions. We have further extended our analysis towards the case of Damour-Solodukhin wormhole, which also yields similar conclusion.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

General method for obtaining the energy minimum of spin Hamiltonians for separable states

We introduce a highly general method to determine the energy minimum of spin Hamiltonians over separable states when the single-particle reduced density matrices are fixed. We present efficient numerical methods that reduce the problem to calculations in a two-particle system. For a broad class of very general spin models, we present analytic formulas for the minimum. For ferromagnetic Ising and Ising-like models of spin-j particles, the minimum over separable states on two-colorable lattices, and over symmetric separable states on fully connected graphs, is given by a compact analytic formula involving the quantum Fisher information. For antiferromagnetic Ising-like and XY-like models of spin j-particles living on a complete graph, the energy minimum for symmetric separable states is given with the expectation value of single-particle operators. For the ferromagnetic Heisenberg chain of spin-1/2 particles, the minimum is expressed via the Uhlmann-Jozsa fidelity. These relations enable the extraction of the quantum Fisher information and quantum fidelity of the corresponding single-particle reduced states from correlation measurements on ground-state ensembles of suitably engineered spin models. For a number of other models, we obtain not necessarily tight lower bounds. We also present bounds for various levels of multiparticle entanglement.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Page Curve for Local-Operator Entanglement from Free Probability

The local-operator entanglement (LOE) measures the classical simulability of a Heisenberg operator and is conjectured to witness many-body chaos in locally interacting systems. Using tools from free probability, we analytically compute its asymptotic value for Haar random dynamics for all Rényi indices. We find that to the first two orders in large dimension, for traceless operators it exactly reproduces the Page curve for random states. In contrast to higher-order out-of-time-ordered correlators (OTOCs), which depend on more complex operator correlations via free cumulants, the leading-order LOE is independent of the initial operator. \add{We detail exactly how these higher-order correlations are encoded in the coefficients of the finite-size corrections. Therefore, guided by our Haar result, we argue that the long-time value of the LOE entropies in chaotic systems is robust: they depend only on a simple sub-sector of the hierarchy of correlations encoded by the full Eigenstate Thermalization Hypothesis. Our results therefore provide a conceptual boundary between operator simulability and higher-order scrambling diagnostics.
Read the full abstract

History and Overview of Mathematics

Using Large Language Models as a Co-Author in Undergraduate Quantum Group Research

This article describes the use of Claude CLI and its Opus 4.6 model, as a tool for writing an entirely AI-generated mathematics research paper. The resulting paper is comparable in scope and quality to papers previously produced by advanced undergraduate students in eight-week summer REU programs advised by the author. The main result is a new explicit formula for a central element of $U_q(\mathfrak{so}_{12})$, which can be used for an interacting particle system with Markov duality. Using SageMath and a sparse PBW-basis pairing matrix that admits symbolic inversion, Claude reduced the central-element computation by several orders of magnitude: a calculation that took 60 hours in a 2023 Python implementation completed in under a minute on a laptop. The article reflects on the implications for undergraduate research mentorship: if generative AI can now produce research of REU caliber, advisors must select problems that better demonstrate the qualities valued by graduate admissions committees. Limitations including poor runtime estimates and literal handling of differing mathematical conventions are documented.
Read the full abstract

Information Theory

Information Theory and Statistical Learning

This manuscript contains preprint of a chapter under consideration for inclusion in the forthcoming third edition of Cover and Thomas's Elements of Information Theory, posted with permission from Wiley. The table of contents EIT-3 ToC of the new edition can be found at: https://docs.google.com/document/d/1L-m4oQEJw1PJhoxBeMwrrBD8S_HmvzMEkPbYvS24980/edit?usp=sharing . For feedback, please contact abbas@ee.stanford.edu Learning and information theory intersect in both model training and the characterization of fundamental performance limits. This manuscript provides a concise and accessible treatment of the first intersection, requiring only basic background in information theory and statistics at the senior undergraduate or first-year graduate level. End-of-chapter exercises make the material well suited for classroom use as well as self-study. The chapter focuses on the role of divergence measures in model training, with examples ranging from linear and logistic regression to autoregressive models, variational autoencoders, diffusion models, generative adversarial networks, and score-based models. It introduces the evidence lower bound (ELBO), f-divergences, and the Fisher divergence. In particular, the treatment of the generative diffusion model provides a more systematic and explicit derivation than is typical in the literature.
Read the full abstract

Classical Analysis and ODEs

Shifted Lévy's Dragon Curve and Directed Graph

It is known that every point on Lévy's Dragon Curve admits a natural representation as a complex power series. We introduce a directed graph $\mathcal{G}_1$ which characterizes this representation. In this paper, we study the translation of the curve by $s=-1/2+i/2$. We identify another directed graph $\mathcal{G}_2$, that characterizes the translated curve and exhibits a revolving structure analogous to that of $\mathcal{G}_1$.
Read the full abstract