Tootfinder

Faster Algorithm for Second (s,t)-mincut and Breaking Quadratic barrier for Dual Edge Sensitivity for (s,t)-mincut
Surender Baswana, Koustav Bhanja, Anupam Roy
https://arxiv.org/abs/2507.01366

Faster Algorithm for Second (s,t)-mincut and Breaking Quadratic barrier for Dual Edge Sensitivity for (s,t)-mincut
We study (s,t)-cuts of second minimum capacity and present the following algorithmic and graph-theoretic results. 1. Vazirani and Yannakakis [ICALP 1992] designed the first algorithm for computing an (s,t)-cut of second minimum capacity using $O(n^2)$ maximum (s,t)-flow computations. For directed integer-weighted graphs, we significantly improve this bound by designing an algorithm that computes an $(s,t)$-cut of second minimum capacity using $O(\sqrt{n})$ maximum (s,t)-flow computations w.h.…

Comparing Optimization Algorithms Through the Lens of Search Behavior Analysis
Gjorgjina Cenikj, Ga\v{s}per Petelin, Tome Eftimov
https://arxiv.org/abs/2507.01668

Comparing Optimization Algorithms Through the Lens of Search Behavior Analysis
The field of numerical optimization has recently seen a surge in the development of "novel" metaheuristic algorithms, inspired by metaphors derived from natural or human-made processes, which have been widely criticized for obscuring meaningful innovations and failing to distinguish themselves from existing approaches. Aiming to address these concerns, we investigate the applicability of statistical tests for comparing algorithms based on their search behavior. We utilize the cross-match statis…

Unified Interference-Aware Water-Filling for QoS-Constrained Communication, Sensing, and JRC
Ahmed Naeem, Anastassia Gharib, H\"useyin Arslan
https://arxiv.org/abs/2506.01400

Unified Interference-Aware Water-Filling for QoS-Constrained Communication, Sensing, and JRC
Water-filling (WF) algorithms are pivotal in maximizing capacity and spectral efficiency in multiple-input and multiple-output (MIMO) systems. However, traditional WF approaches cater solely to communication requirements, neglecting the emerging heterogeneity of 6G, including sensing and joint radar-communication (JRC). As these diverse demands grow in importance and have different Quality of Service (QoS) constraints, traditional WF becomes inadequate. Therefore, in this paper, we propose a un…

A High-Performance Evolutionary Multiobjective Community Detection Algorithm
Guilherme O. Santos, Lucas S. Vieira, Giulio Rossetti, Carlos H. G. Ferreira, Gladston Moreira
https://arxiv.org/abs/2506.01752

A High-Performance Evolutionary Multiobjective Community Detection Algorithm
Community structure is a key feature of complex networks, underpinning a diverse range of phenomena across social, biological, and technological systems. While traditional methods, such as Louvain and Leiden, offer efficient solutions, they rely on single-objective optimization, often failing to capture the multifaceted nature of real-world networks. Multi-objective approaches address this limitation by considering multiple structural criteria simultaneously, but their high computational cost r…

State Similarity in Modular Superconducting Quantum Processors with Classical Communications
Bujiao Wu, Changrong Xie, Peng Mi, Zhiyi Wu, Zechen Guo, Peisheng Huang, Wenhui Huang, Xuandong Sun, Jiawei Zhang, Libo Zhang, Jiawei Qiu, Xiayu Linpeng, Ziyu Tao, Ji Chu, Ji Jiang, Song Liu, Jingjing Niu, Yuxuan Zhou, Yuxuan Du, Wenhui Ren, Youpeng Zhong, Tongliang Liu, Dapeng Yu

State Similarity in Modular Superconducting Quantum Processors with Classical Communications
As quantum devices continue to scale, distributed quantum computing emerges as a promising strategy for executing large-scale tasks across modular quantum processors. A central challenge in this paradigm is verifying the correctness of computational outcomes when subcircuits are executed independently following circuit cutting. Here we propose a cross-platform fidelity estimation algorithm tailored for modular architectures. Our method achieves substantial reductions in sample complexity compar…

Grid-Connected, Data-Driven Inverter Control, Theory to Hardware
Sebastian Graf, Keith Moffat, Anurag Mohapatra, Alessandro Chiuso, Florian D\"orfler
https://arxiv.org/abs/2507.02325

Grid-Connected, Data-Driven Inverter Control, Theory to Hardware
Grid-connected inverter control is challenging to implement due to the difficulty of obtaining and maintaining an accurate grid model. Direct Data-Driven Predictive Control provides a model-free alternative to traditional model-based control methods. This paper describes how the recently-proposed Transient Predictive Control (TPC) can be used for real-world, plug-and-play inverter control. The following hypotheses were tested: 1) The TPC algorithm can be run online using standard hardware, and …

Parallel-in-Time Preconditioning for Time-Dependent Variational Mean Field Games
Heidi Wolles Lj\'osheim, Dante Kalise, John W. Pearson, Francisco J. Silva
https://arxiv.org/abs/2507.01958

Parallel-in-Time Preconditioning for Time-Dependent Variational Mean Field Games
We study the numerical approximation of a time-dependent variational mean field game system with local couplings and either periodic or Neumann boundary conditions. Following a variational approach, we employ a finite difference discretization and solve the resulting finite-dimensional optimization problem using the Chambolle--Pock primal--dual algorithm. As this involves computing proximal operators and solving ill-conditioned linear systems at each iteration, we propose a general class of par…

Validation of the MySurgeryRisk Algorithm for Predicting Complications and Death after Major Surgery: A Retrospective Multicenter Study Using OneFlorida Data Trust
Yuanfang Ren, Esra Adiyeke, Ziyuan Guan, Zhenhong Hu, Mackenzie J Meni, Benjamin Shickel, Parisa Rashidi, Tezcan Ozrazgat-Baslanti, Azra Bihorac
https://arxiv.org/abs…

Validation of the MySurgeryRisk Algorithm for Predicting Complications and Death after Major Surgery: A Retrospective Multicenter Study Using OneFlorida Data Trust
Despite advances in surgical techniques and care, postoperative complications are prevalent and effects up to 15% of the patients who underwent a major surgery. The objective of this study is to develop and validate models for predicting postoperative complications and death after major surgery on a large and multicenter dataset, following the previously validated MySurgeryRisk algorithm. This retrospective, longitudinal and multicenter cohort analysis included 508,097 encounters from 366,875 a…

This https://arxiv.org/abs/2502.08342 has been replaced.
initial toot: https://mastoxiv.page/@arX…

Electron Fourier ptychography for phase reconstruction
Phase reconstruction is important in transmission electron microscopy for structural studies. We describe electron Fourier ptychography and its application to phase reconstruction of both radiation-resistant and beam-sensitive materials. We demonstrate that the phase of the exit wave can be reconstructed to high resolution using a modified iterative phase retrieval algorithm using data collected in an alternative optical geometry. This method achieves a spatial resolution of 0.63 nm at a fluenc…

Faster exponential algorithms for cut problems via geometric data structures
L\'aszl\'o Kozma, Junqi Tan
https://arxiv.org/abs/2506.22281 https://

Faster exponential algorithms for cut problems via geometric data structures
For many hard computational problems, simple algorithms that run in time $2^n \cdot n^{O(1)}$ arise, say, from enumerating all subsets of a size-$n$ set. Finding (exponentially) faster algorithms is a natural goal that has driven much of the field of exact exponential algorithms (e.g., see Fomin and Kratsch, 2010). In this paper we obtain algorithms with running time $O(1.9999977^n)$ on input graphs with $n$ vertices, for the following well-studied problems: - $d$-Cut: find a proper cut in wh…