Searcharxiv⌕ Search

arXiv · 2610.16454

Axioms and internal rigidity of spectral duality structures

Abstract

Spectral duality structures (SDS) explain why a distinguished family of initial distributions makes the absorption probabilities of resetting processes insensitive to the resetting mechanism. Here we study their axioms. We prove that the six defining conditions are mutually independent and determine what each one contributes. The key tool is a structure theorem valid for an arbitrary permutation and an arbitrary positive weight: every insensitive distribution is supported on a union of cycles balanced at a common level, and the level of a cycle is fixed by the geometric mean of the weight on it. From it, positivity selects the admissible root, the constant orbit product is equivalent to the existence of an insensitive distribution of full support, and the involution is equivalent to the response rank being equal to the number of free weight parameters. Without the duality relation, insensitivity of a single distribution is cheap and generically isolated; duality turns it into structural neutrality of the separatrix. The full-rank condition splits into two layers: a weaker condition is equivalent to maximal response rank, while full rank also excludes insensitivity at any other level. We then show that a single SDS is internally rigid: compatible semigroup structures force a constant weight, compatible abelian group structures obey a precise arithmetic condition, congruences form a simple lattice, and the automorphism group is computed explicitly. Finally, the axioms do not determine the orientation of the response; in the two-site case we give the exact condition under which the geometric and analytic sign criteria agree.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Juan Antonio Vega Coso. 2026-10-12. Axioms and internal rigidity of spectral duality structures. https://arxiv.org/abs/2610.16454

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Loglinear Hawkes processes: existence, nonexplosion, stability and moment bounds

This paper discusses a special class of nonlinear Hawkes processes, where the rate function is the exponential function. We call these processes loglinear Hawkes processes. Such processes are used with success in computational neuroscience and we provide a mathematical background for them. After obtaining existence from a standard Poisson embedding, we give sufficient conditions for explosion and nonexplosion that cover a large class of memory functions. In order to give sufficient stability conditions, we construct an autoregressive integer-valued time series that gives pathwise upper bounds for the bin counts of a loglinear Hawkes process. From here, a Markov chain argument shows that the regeneration time for a loglinear Hawkes process has finite expectation if the memory function is negative enough in a neighborhood of zero. Stability in total variation follows. Finally, we show that both the loglinear Hawkes process under a large class of initial conditions and its stationary version have finite exponential moments.

math.PR↗

Eddy viscosity by Lévy transport noises

We consider stochastic linear transport equations in dimension $d\geq 2$ and stochastic 2D Euler equations with $L^2$-initial condition, both driven by Lévy transport noise in the Marcus sense. Under a suitable scaling limit of the noises, we prove that the solutions to the stochastic linear transport equations converge to the solution of the deterministic heat equation, while weak solutions to the stochastic 2D Euler equations converge weakly to the unique solution of the deterministic 2D Navier--Stokes equation. These results show that small-scale jump noises generate eddy viscosity, extending the recent studies on Itô--Stratonovich diffusion limits to the discontinuous setting.

math.PR↗

Triggered urn models for frequently asked questions (FAQ)

We investigate a nonclassic urn model with triggers that increase the number of colors. The scheme has emerged as a model for web services that set up frequently asked questions (FAQ). We present a thorough asymptotic analysis of the FAQ urn scheme in generality that covers a large number of special cases, such as Simon's urn. For instance, we consider time dependent triggering probabilities. We identify regularity conditions on these probabilities that classify the schemes into those where the number of colors in the urn remains almost surely finite or increases to infinity and conditions that tell us whether all the existing colors are observed infinitely often or not. We determine the rank curve, too. In view of the broad generality of the trigger probabilities, a spectrum of limit distributions appears, from central limit theorems to Poisson approximation, to power-laws, revealing connections to Heaps exponent and Zipf's law. A combinatorial approach to the Simon urn is presented to indicate the possibility of such exact analysis, which is important for short-term predictions. Extensive simulations on real datasets (from Amazon sales) as well as computer-generated data clearly indicate that the asymptotic and exact theory developed agrees with practice.

math.PR↗