{"total":31,"items":[{"citing_arxiv_id":"2606.28308","ref_index":5,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Which Nash Equilibrium? Solver-Dependent Selection on Zero-Sum Nash Polytopes","primary_cat":"cs.GT","submitted_at":"2026-06-26T17:53:30+00:00","verdict":"ACCEPT","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Regularized last-iterate solvers select the maximum-entropy Nash equilibrium while regret-averaging methods select lower-entropy faces on zero-sum Nash polytopes, verified on analytic testbeds and a 180-game ensemble.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.27261","ref_index":62,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Non-colliding space-time inhomogeneous Markov chains","primary_cat":"math.PR","submitted_at":"2026-06-25T16:44:59+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Derives leading asymptotics for collision-time tails of integrable inhomogeneous Markov chains via steepest-descent analysis and Karlin-McGregor expansion, confirming a prediction for push-block particle systems.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.26024","ref_index":48,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Matrix Approximation of Bachelier Option Prices and Greeks under Stochastic Volatility models","primary_cat":"q-fin.PR","submitted_at":"2026-06-24T16:50:47+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"A matrix approximation technique computes Bachelier option prices and Greeks under stochastic volatility models for infinitely many strikes from finite expectations.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.18458","ref_index":7,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Stable size-biasing and the positive scale-mixture order of generalized Gaussian laws","primary_cat":"math.PR","submitted_at":"2026-06-16T20:04:47+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Generalized Gaussians satisfy X_p =^d V X_q with positive V independent of X_q if and only if p ≤ q, with explicit V constructed from α-stable laws and size-biasing when p < q.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.13374","ref_index":16,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Temporal Conductance and Bounds on the Voter Model for Dynamic Networks","primary_cat":"cs.DC","submitted_at":"2026-06-11T13:58:23+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Defines temporal conductance Φ for dynamic networks and proves the voter model consensus time is O(m/(d_min Φ)) with a tight lower bound.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.11778","ref_index":17,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Consensus Time in 3-Majority and 2-Choices Is Determined by the Maximum Initial Opinion Density","primary_cat":"cs.DC","submitted_at":"2026-06-10T08:05:16+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Consensus time in 3-Majority is \tilde{\\Theta}(\\min\\{1/\\|\\alpha^{(0)}\\|_\\infty, \\sqrt{n}\\}) and in 2-Choices is \\tilde{\\Theta}(1/\\|\\alpha^{(0)}\\|_\\infty) w.h.p., governed by maximum initial opinion density for every starting configuration.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.10257","ref_index":9,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Downward conditional monotonicity gives survival and extinction for contact processes in random environments","primary_cat":"math.PR","submitted_at":"2026-06-08T23:56:24+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Introduces downward conditional monotonicity for MMPP to obtain stochastic domination bounds that determine survival and extinction regimes for contact processes in finite-state random environments via QBD eigenvalue comparison.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.07947","ref_index":110,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Bayesian Global Fr\\'echet Regression via Weak Conditional Expectations","primary_cat":"stat.ME","submitted_at":"2026-06-06T02:34:09+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A Bayesian global Fréchet regression method is introduced via a Fréchet Bayes rule that reduces the problem to scalar tasks, allows prior-data interpolation, and remains valid under moment conditions using weak conditional expectations.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.06451","ref_index":19,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Simultaneous EF1 and approximate MMS allocations for submodular valuations","primary_cat":"cs.GT","submitted_at":"2026-06-04T17:47:59+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Existence of EF1 and constant-ρ MMS allocations proven for submodular valuations.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.04633","ref_index":25,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Lipschitz stable sequence classes: an approach to Rademacher type and cotype of Lipschitz functions","primary_cat":"math.FA","submitted_at":"2026-06-03T09:06:29+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Introduces Lipschitz stable sequence classes to define (Z,Y)-summing Lipschitz functions and identifies Rademacher type and cotype for Lipschitz functions with these spaces, proving the type case forms a Banach Lipschitz ideal while the cotype does not.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.03076","ref_index":12,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Optimal constants of smoothing estimates for quantum harmonic oscillators","primary_cat":"math.CA","submitted_at":"2026-06-02T03:06:30+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Establishes optimal constants and extremizers for smoothing estimates of quantum harmonic oscillators as direct analogues of prior free-particle results.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.30121","ref_index":8,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Improved Survival Results for the One-Dimensional Renewal Contact Process","primary_cat":"math.PR","submitted_at":"2026-05-28T15:55:08+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Proves finiteness of λ_c(μ) for the 1D renewal contact process when interarrival distributions are arithmetic or have uniformly small atomic components on short intervals.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.21737","ref_index":20,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Escaping Chaos in Random Multiplicative Functions","primary_cat":"math.NT","submitted_at":"2026-05-20T21:01:44+00:00","verdict":null,"verdict_confidence":null,"novelty_score":null,"formal_verification":null,"one_line_summary":null,"context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.19989","ref_index":126,"ref_count":2,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Error Bounds for Importance Sampling with Estimated Proposal Distributions","primary_cat":"math.ST","submitted_at":"2026-05-19T15:27:17+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Derives non-asymptotic error bounds for standard, defensive, and self-normalized importance sampling with random KDE proposals from geometrically ergodic Markov chains, separating n^{-1/2} Monte Carlo error from MIAE/MISE proposal error.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.17220","ref_index":63,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Skewed weak and Pareto-tailed strong interactions accompany community diversity and complexity","primary_cat":"q-bio.PE","submitted_at":"2026-05-17T01:49:08+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Empirical plant-animal network data and generalized Lotka-Volterra simulations identify SWAPS interaction distributions as a community signature that requires taxonomic constraints, multiple interaction types, and accompanies elevated diversity and complexity.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.12760","ref_index":12,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"How long should a block be?","primary_cat":"stat.ME","submitted_at":"2026-05-12T21:14:09+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Excessively long blocks lower asymptotic relative efficiency in the block-maxima method, and new likelihood and diagnostic procedures are proposed to check whether a chosen length is adequate under rounding or censoring.","context_count":1,"top_context_role":"background","top_context_polarity":"support","context_text":"efficiency relative to estimation from a full sample can drop to 50% when the top 1% of a sample is censored (Davison and Smith, 1990, Table 1). The efficiencies for estimation of individual parameters may be computed as the ratios of the diagonal elements of the variance matrices. Figure 2 shows the square roots of these ratios for different values ofξand formin the interval[1,12], and the corresponding ratio for estimation of the 20-observation return level. These square roots have a direct interpretation as the ratio of the asymptotic lengths of confidence intervals based on the full sample rather than onX (m) alone. Thus, for example, the upper right-hand panel shows that intervals for the scale parameterσbased on the entire sample are respectively roughly 0."},{"citing_arxiv_id":"2605.08485","ref_index":45,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Sinkhorn Treatment Effects: A Causal Optimal Transport Measure","primary_cat":"stat.ML","submitted_at":"2026-05-08T21:03:11+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"The Sinkhorn treatment effect is a new entropic optimal transport measure of divergence between counterfactual distributions that admits first- and second-order pathwise differentiability, debiased estimators, and asymptotically valid tests for distributional treatment effects.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.00157","ref_index":18,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Asymptotic Replacement for Quantum Channel Products with Applications to Inhomogeneous Matrix Product States","primary_cat":"quant-ph","submitted_at":"2026-04-30T19:26:11+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Products of finite-dimensional quantum channels asymptotically forget input states under decay of the centered trace-Dobrushin coefficient, yielding unique replacement channels and convergence for deterministic and random inhomogeneous MPS.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.20285","ref_index":110,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Time-dependent structural equation modeling of fans' football fever using activity tracking data during the 2025 DFB Cup final","primary_cat":"stat.AP","submitted_at":"2026-04-22T07:31:12+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"Football fever in spectators follows a V-shaped time course captured as a latent process from heart rate and stress data via time-dependent structural equation modeling.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.20139","ref_index":9,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Atypical Decay Rates for Atypical Heights in Random Recursive Trees","primary_cat":"math.PR","submitted_at":"2026-04-22T03:07:50+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Random recursive trees exhibit polynomial upper-tail and stretched-exponential lower-tail large deviation probabilities for height, with an atypical prefactor in the lower tail that grows slower than any n-fold iterated logarithm.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.14860","ref_index":14,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Best of both worlds: Stochastic & adversarial best-arm identification","primary_cat":"stat.ML","submitted_at":"2026-04-16T10:47:50+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"No algorithm can be optimal in both stochastic and adversarial best-arm identification; a new parameter-free algorithm matches the derived lower bound up to log factors in stochastic cases while handling adversarial rewards.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.05860","ref_index":2,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Symmetry-Breaking and Hysteresis in a Duplex Voter Model","primary_cat":"nlin.AO","submitted_at":"2026-04-07T13:20:26+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A duplex voter model on multiplex networks exhibits spontaneous symmetry-breaking and a cusp bifurcation with noise that unfolds explosive versus non-explosive transitions.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2601.16226","ref_index":7,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"D-MODD: A Diffusion Model of Opinion Dynamics Derived from Online Data","primary_cat":"physics.soc-ph","submitted_at":"2026-01-16T16:17:44+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"D-MODD is a data-derived Langevin stochastic differential equation whose transition kernel reproduces the one-step opinion change probabilities observed in social media data on a polarized climate topic.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2512.23178","ref_index":1,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Clipped Gradient Methods for Nonsmooth Convex Optimization under Heavy-Tailed Noise: A Refined Analysis","primary_cat":"math.OC","submitted_at":"2025-12-29T03:35:53+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Refined analysis of Clipped SGD yields improved high-probability rates involving generalized effective dimension and establishes matching lower bounds showing optimality for convergence in expectation under heavy-tailed noise.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2509.11706","ref_index":12,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Threshold and quasi-stationary distribution for the SIS model on networks","primary_cat":"cs.SI","submitted_at":"2025-09-15T09:07:04+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Dynamic state expansion with infection memory improves pair approximation accuracy for SIS epidemic threshold and quasi-stationary distribution on arbitrary networks.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2509.02829","ref_index":8,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"An iterated $I$-projection procedure for solving the generalized minimum information checkerboard copula problem","primary_cat":"math.PR","submitted_at":"2025-09-02T20:51:02+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"An iterated I-projection procedure solves the generalized minimum information checkerboard copula problem with convergence guarantees and numerical tests up to dimension four.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2508.06649","ref_index":44,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Measuring Stereotype and Deviation Biases in Large Language Models","primary_cat":"cs.CL","submitted_at":"2025-08-08T19:03:57+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"Four advanced LLMs display significant stereotype bias and deviation bias when generating profiles tied to political affiliation, religion, and sexual orientation.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2502.04280","ref_index":46,"ref_count":2,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Mean-Field Analysis of Latent Variable Process Models on Dynamically Evolving Graphs with Feedback Effects","primary_cat":"math.PR","submitted_at":"2025-02-06T18:27:13+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Characterizes the distributional mean-field limit of co-evolving latent space networks with feedback, including empirical measures and graphon convergence, via a conditional propagation of chaos result.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2405.08202","ref_index":3,"ref_count":2,"confidence":0.9,"is_internal_anchor":false,"paper_title":"The mean field stubborn voter model","primary_cat":"math.PR","submitted_at":"2024-05-13T21:41:50+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Derives novel scaling limit and explicit consensus probabilities for mean-field voter model with heavy-tailed waiting times, governed by extreme-value landscape of the tail index.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2401.03937","ref_index":35,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Cutoff for mixtures of permuted Markov chains: reversible case","primary_cat":"math.PR","submitted_at":"2024-01-08T14:57:20+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Proves cutoff at entropic time log n/h for reversible mixtures of permuted Markov chains under mild assumptions on the base chains.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"1907.05381","ref_index":80,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Adaptive Pricing in Insurance: Generalized Linear Models and Gaussian Process Regression Approaches","primary_cat":"econ.EM","submitted_at":"2019-07-02T08:18:54+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Adaptive GLM with MQLE and GP regression with UCB for dynamic insurance pricing, showing parameter convergence and regret analysis under delayed claims.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}