Tootfinder

Analysis of minimum orbital periods around d-dimensional charged black holes
Yan Peng, Guohua Liu
https://arxiv.org/abs/2510.04223 https://arxiv.org/pdf/25…

Analysis of minimum orbital periods around d-dimensional charged black holes
This paper investigates the bounds on the minimum orbital period for test objects around d-dimensional charged black holes in asymptotically flat spacetimes. We find numerically that the minimum orbital period decreases as the charge of the black hole increases. Thus, the upper limit is reached for an uncharged black hole, while the lower limit is attained for a maximally charged one. We then analytically derive the upper and lower bounds for the minimum orbital period. These results improve ou…

Minimizing smooth Kurdyka-{\L}ojasiewicz functions via generalized descent methods: Convergence rate and complexity
Masoud Ahookhosh, Susan Ghaderi, Alireza Kabgani, Morteza Rahimi
https://arxiv.org/abs/2511.10414 https://arxiv.org/pdf/2511.10414 https://arxiv.org/html/2511.10414
arXiv:2511.10414v1 Announce Type: new
Abstract: This paper addresses the generalized descent algorithm (DEAL) for minimizing smooth functions, which is analyzed under the Kurdyka-{\L}ojasiewicz (KL) inequality. In particular, the suggested algorithm guarantees a sufficient decrease by adapting to the cost function's geometry. We leverage the KL property to establish the global convergence, convergence rates, and complexity. A particular focus is placed on the linear convergence of generalized descent methods. We show that the constant step-size and Armijo line search strategies along a generalized descent direction satisfy our generalized descent condition. Additionally, for nonsmooth functions by leveraging the smoothing techniques such as forward-backward and high-order Moreau envelopes, we show that the boosted proximal gradient method (BPGA) and the boosted high-order proximal-point (BPPA) methods are also specific cases of DEAL, respectively. It is notable that if the order of the high-order proximal term is chosen in a certain way (depending on the KL exponent), then the sequence generated by BPPA converges linearly for an arbitrary KL exponent. Our preliminary numerical experiments on inverse problems and LASSO demonstrate the efficiency of the proposed methods, validating our theoretical findings.
toXiv_bot_toot

Sensitivity dependence of the Navier-Stokes turbulence of a two-dimensional Rayleigh-B\'{e}nard convection on time-step
Shijie Qin, Kun Xu, Shijun Liao
https://arxiv.org/abs/2510.11220

Sensitivity dependence of the Navier-Stokes turbulence of a two-dimensional Rayleigh-Bénard convection on time-step
A two-dimensional Rayleigh-Bénard convection governed by the Navier-Stokes (NS) equations is solved by traditional direct numerical simulation (DNS) using double precision and various time-steps. It is found that there are two kinds of final flow types, one is vortical flow, the other is zonal flow, and their statistics are completely different. Especially, the two flow types frequently alternate as the time-step decreases to a very small value, suggesting that the time-step corresponding to e…

Modified Monte Carlo method with the heat bath algorithm for a model cuprate
Yu. D. Panov, V. A. Ulitko, D. N. Yasinskaya, A. S. Moskvin
https://arxiv.org/abs/2510.08289 https:/…

Modified Monte Carlo method with the heat bath algorithm for a model cuprate
The results of numerical simulation using a modified Monte Carlo method with a heat bath algorithm for the pseudospin model of cuprates are presented. The temperature phase diagrams are constructed for various degrees of doping and for various parameters of the model, and the effect of local correlations on the critical temperatures of the model cuprate is investigated. It is shown that, in qualitative agreement with the results of the mean field, the heat bath algorithm leads to a significant …

Invariant Price of Anarchy: a Metric for Welfarist Traffic Control
Ilia Shilov, Mingjia He, Heinrich H. Nax, Emilio Frazzoli, Gioele Zardini, Saverio Bolognani
https://arxiv.org/abs/2512.05843 https://arxiv.org/pdf/2512.05843 https://arxiv.org/html/2512.05843
arXiv:2512.05843v1 Announce Type: new
Abstract: The Price of Anarchy (PoA) is a standard metric for quantifying inefficiency in socio-technical systems, widely used to guide policies like traffic tolling. Conventional PoA analysis relies on exact numerical costs. However, in many settings, costs represent agents' preferences and may be defined only up to possibly arbitrary scaling and shifting, representing informational and modeling ambiguities. We observe that while such transformations preserve equilibrium and optimal outcomes, they change the PoA value. To resolve this issue, we rely on results from Social Choice Theory and define the Invariant PoA. By connecting admissible transformations to degrees of comparability of agents' costs, we derive the specific social welfare functions which ensure that efficiency evaluations do not depend on arbitrary rescalings or translations of individual costs. Case studies on a toy example and the Zurich network demonstrate that identical tolling strategies can lead to substantially different efficiency estimates depending on the assumed comparability. Our framework thus demonstrates that explicit axiomatic foundations are necessary in order to define efficiency metrics and to appropriately guide policy in large-scale infrastructure design robustly and effectively.
toXiv_bot_toot

HJCD-IK: GPU-Accelerated Inverse Kinematics through Batched Hybrid Jacobian Coordinate Descent
Cael Yasutake, Zachary Kingston, Brian Plancher
https://arxiv.org/abs/2510.07514 h…

HJCD-IK: GPU-Accelerated Inverse Kinematics through Batched Hybrid Jacobian Coordinate Descent
Inverse Kinematics (IK) is a core problem in robotics, in which joint configurations are found to achieve a desired end-effector pose. Although analytical solvers are fast and efficient, they are limited to systems with low degrees-of-freedom and specific topological structures. Numerical optimization-based approaches are more general, but suffer from high computational costs and frequent convergence to spurious local minima. Recent efforts have explored the use of GPUs to combine sampling and …

Circular Dichroism without absorption in isolated chiral dielectric Mie particles
Rafael S. Dutra, Felipe A. Pinheiro, Diney S. Ether Jr, Cyriaque Genet, Nathan B. Viana, Paulo A. Maia Neto
https://arxiv.org/abs/2510.08428

Circular Dichroism without absorption in isolated chiral dielectric Mie particles
We demonstrate that an effect phenomenologically analogous to circular dichroism can arise even for dielectric and isotropic chiral spherical particles. By analyzing the polarimetry of light scattered from a chiral, lossless microsphere illuminated with linearly polarized light, we show that the scattered light becomes nearly circularly polarized, exhibiting large, nonresonant values of the Stokes parameter $S_3$ for a broad range of visible frequencies. This phenomenon occurs only in the Mie r…

Consensus as cooling: a granular gas model for continuous opinions on structured networks
Carlos Uriarte, Pablo Rodriguez-Lopez, Nagi Khalil
https://arxiv.org/abs/2510.06807 htt…

Consensus as cooling: a granular gas model for continuous opinions on structured networks
A continuous-opinion model accounting for the social compromise propensity is theoretically and numerically analysed. An agent's opinion is represented by a real number that can be changed through social interactions with her neighbours. The proposed dynamics depends on two fundamental parameters, $α\in[-1,1]$ and $β\ge 0$. If an interaction takes place between two agents, their relative opinions decreases an amount given by $α$. The probability of two neighbours to interact is proportional …