Results 41 to 50 of about 676 (93)
Hausdorff dimensions of irreducible Markov hom tree‐shifts
Journal of the London Mathematical Society, Volume 111, Issue 6, June 2025.Abstract This paper features a Cramér's theorem for finite‐state Markov chains indexed by rooted d$d$‐trees, obtained via the method of types in the classical analysis of large deviations. Along with the theorem comes two applications: an almost‐sure type convergence of sample means and a formula for the Hausdorff dimension of the symbolic space ...
Jung‐Chao Ban +2 more
wiley +1 more source
Concentration and Model Selection Consistency of the Group Lasso for α$$ \alpha $$‐Mixing Errors
Stat, Volume 14, Issue 1, March 2025.ABSTRACT The group lasso in linear regression models is studied for α$$ \alpha $$‐mixing subexponential errors. Nonasymptotic guarantees are provided for the estimation error of the sparse coefficient vector and the associated predictions for the high‐dimensional regime where the number of regressors can grow much faster than the sample size.
Robin Martens, Ansgar Steland
wiley +1 more source
Tail asymptotics for dependent subexponential differences [PDF]
Siberian Mathematical Journal, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Albrecher, H +2 more
openaire +4 more sources
Tail approximations of integrals of Gaussian random fields
, 2012 This paper develops asymptotic approximations of $P(\int_Te^{f(t)}\,dt>b)$ as $b\rightarrow\infty$ for a homogeneous smooth Gaussian random field, $f$, living on a compact $d$-dimensional Jordan measurable set $T$.
Liu, Jingchen
core +1 more source
Counting circuit double covers
Journal of Graph Theory, Volume 108, Issue 2, Page 374-395, February 2025.Abstract We study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to C k ${C}_{k}$ for some k $k$) instead of cycles (graphs with all degrees even). We give an almost‐exponential lower bound for graphs with a surface embedding of representativity at least 4.
Radek Hušek, Robert Šámal
wiley +1 more source
Central limit theorem in disordered Monomer‐Dimer model
Random Structures &Algorithms, Volume 66, Issue 1, January 2025.Abstract We consider the disordered monomer‐dimer model on general finite graphs with bounded degrees. Under the finite fourth moment assumption on the weight distributions, we prove a Gaussian central limit theorem for the free energy of the associated Gibbs measure with a rate of convergence. The central limit theorem continues to hold under a nearly
Wai‐Kit Lam, Arnab Sen
wiley +1 more source
Typical Structure of Hereditary Graph Families. I. Apex‐free Families
Random Structures &Algorithms, Volume 66, Issue 1, January 2025.ABSTRACT A family of graphs ℱ$$ \mathcal{F} $$ is hereditary if ℱ$$ \mathcal{F} $$ is closed under isomorphism and taking induced subgraphs. The speed of ℱ$$ \mathcal{F} $$ is the sequence {|ℱn|}n∈ℕ$$ {\left\{|{\mathcal{F}}^n|\right\}}_{n\in \mathbb{N}} $$, where ℱn$$ {\mathcal{F}}^n $$ denotes the set of graphs in ℱ$$ \mathcal{F} $$ with the vertex ...
Sergey Norin, Yelena Yuditsky
wiley +1 more source
IET Information Security, Volume 2025, Issue 1, 2025.The current multikey fully homomorphic encryption (MKFHE) needs to add exponential noise in the distributed decryption phase to ensure the simulatability of partial decryption. Such a large noise causes the ciphertext modulus of the scheme to increase exponentially compared to the single‐key fully homomorphic encryption (FHE), further reducing the ...
Xiaokang Dai +3 more
wiley +1 more source
Ranking and Drawing in Subexponential Time [PDF]
, 2011 In this paper we obtain parameterized subexponential-time algorithms for p -Kemeny Aggregation (p-KAGG) — a problem in social choice theory — and for p -One-Sided Crossing Minimization (p-OSCM) – a problem in graph drawing (see the introduction for definitions).
Fernau, H. +5 more
openaire +3 more sources
Two-dimensional ruin probability for subexponential claim size
, 2017 We analyse the asymptotics of ruin probabilities of two insurance companies (or two branches of the same company) that divide between them both claims and premia in some specified proportions when the initial reserves of both companies tend to infinity ...
Foss, Sergey +3 more
core +1 more source