In the current article we study complex cycles of higher multiplicity in a specific polynomial family of holomorphic foliations in the complex plane. The family in question is a perturbation of an exact polynomial one-form giving rise to a foliation by Riemann surfaces. In this setting, a complex cycle is defined as a …
Improves training GANs by escaping limit cycles.
problem Limit cycling behavior in training GANs.
method Predictive Centripetal Acceleration Algorithm (PCAA) combined with Adam.
result PCAA improves convergence rates and effectively trains GANs.
Endogenous business cycles explain higher comovement across countries.
problem Standard models struggle to explain high comovement in business cycles across countries.
method Developed a demand-driven reduced-form model with strategic complementarities and international trade linkages.
result Combining endogenous business cycles with exogenous shocks matches empirical comovement levels.
The current article studies certain problems related to complex cycles of holomorphic foliations with singularities in the complex plane. We focus on the case when polynomial differential one-form gives rise to a foliation by Riemann surfaces. In this setting, a complex cycle is defined as a nontrivial element of the f…
This paper identifies the unique efficient cycle for most hyperbolic manifolds but not for the figure-8 knot complement.
problem Identifying the unique efficient cycle for hyperbolic manifolds.
method Analyzing the limit of fundamental cycles and their ℓ1-norm convergence. result The uniqueness of the efficient cycle is proven for most hyperbolic manifolds but not for the figure-8 knot complement.
Study asymptotic expansion of graph Laplacian on discretized surfaces, relating spanning trees and cycle-rooted forests.
problem Asymptotic expansion of graph Laplacian on discretized surfaces.
method Relate spanning trees and cycle-rooted spanning forests to zeta-regularized determinants.
result Explicit formula for limit of cycle-rooted spanning forest probability and topological observables.
AdaBoost cycles in probability simplex dynamics.
problem Understanding cycling behavior in AdaBoost.
method Computational methods and dynamical systems analysis.
result Correspondence between AdaBoost cycling and continued fractions dynamics.
Study on synchronization in financial markets with time delays.
problem Understanding market dynamics and synchronization in financial systems with time delays.
method Examined a system of coupled non-linear delay-differential equations, linearized for small delays, and analyzed collective dynamics using bifurcation diagrams and numerical solutions.
result Demonstrated that limit cycles can be maintained in coupled N-asset models with appropriate parameterization, leading to market synchronization.
Originally, the Carnot cycle is a theoretical thermodynamic cycle that provides an upper limit on the efficiency that any classical thermodynamic engine can achieve during the conversion of heat into work, or conversely, the efficiency of a refrigeration system in creating a temperature difference by the application of…
This paper proposes an alternative to the classical price-adjustment mechanism (called "tâtonnement" after Walras) that is second-order in time. The proposed mechanism, an analogue to the damped harmonic oscillator, provides a dynamic equilibration process that depends only on local information. We show how such a proc…
We prove that tangent cones to 2-dimensional calibrated cycles are unique. Using this result we prove a rate of convergence for the mass of the blow-up of a calibrated integral 2-cycle towards the limiting density. With the same techniques, we can also prove such a rate for J-holomorphic maps between almost complex man…
Dual decomposition provides a tractable framework for designing algorithms for finding the most probable (MAP) configuration in graphical models. However, for many real-world inference problems, the typical decomposition has a large integrality gap, due to frustrated cycles. One way to tighten the relaxation is to intr…
Paper speeds up topological signal identification and cycle matching.
problem Efficiently identifying and matching topological signals across datasets.
method Cohomological approach to persistent homology computation.
result Significantly faster performance on large-scale datasets.
Paper introduces Cycles Protocol to integrate trade credit into market clearing.
problem Liquidity embedded in trade credit outside formal settlement infrastructures.
method Distributed, multilateral clearing mechanism based on double-entry accounting.
result Cycles Protocol maximizes balance sheet compression without redistributing counterparty risk.
In this article we introduce algorithms which compute iterations of Gauss-Manin connections, Picard-Fuchs equations of Abelian integrals and mixed Hodge structure of affine varieties of dimension n in terms of differential forms. In the case n=1 such computations have many applications in differential equations and…
CycleMorph improves image registration by preserving topology with cycle consistency.
problem Preserving original topology during deformation in image registration.
method Cycle-consistent deformable image registration approach.
result Effective and accurate registration on diverse image pairs within seconds.
We have analyzed the Indices of Industrial Production (Seasonal Adjustment Index) for a long period of 240 months (January 1988 to December 2007) to develop a deeper understanding of the economic shocks. The angular frequencies estimated using the Hilbert transformation, are almost identical for the 16 industrial secto…
We consider any pseudo holomorphic integral 2-cycle in an arbitrary almost complex manifold and perform a blow up analysis at an arbitrary point. Building upon a pseudo algebraic blow up (previously introduced by the author) we prove a geometric rate of decay for the mass ratio towards the limiting density, with an exp…
Agent-based market shows herding cycles with square-root price impact.
problem Understanding herding cycles in agent-based markets.
method Agent-based model with 20,000 retail traders interacting with a single institutional agent.
result Agent discovers multi-cycle predatory strategy with 8-11 complete cycles over 2000 trading days.
The fundamental group of a hyperbolic manifold acts on the limit set, giving rise to a cross-product C^* algebra. We construct nontrivial K-cycles for the cross-product algebra, thereby extending some results of Connes and Sullivan to higher dimensions. We also show how the Patterson-Sullivan measure on the limit set c…
Let N be a manifold (with boundary) of dimension at least 3, such that its interior admits a hyperbolic metric of finite volume. We discuss the possible limits arising from sequences of relative fundamental cycles approximating the simplicial volume. As applications, we extend results of Jungreis and Calegari from clos…
Constructs unbounded KK-cycles for Riemannian embeddings in codimension one.
problem Understanding Riemannian embeddings in codimension one.
method Constructs unbounded KK-cycles from C(X) to C0(Y), each with a connection, representing the shriek class. result The unbounded product of !ε with the Dirac operator DY represents the KK-theoretic factorization of the fundamental class [X]=!⊗[Y]. CDLF predicts product life-cycles in cold-start phases with high accuracy.
problem Forecasting new products in early phases when data is scarce.
method Conditional Diffusion Life-cycle Forecaster (CDLF) combining static descriptors, reference trajectories, and new observations.
result CDLF outperforms classical models in accuracy and probabilistic forecasting.
Develop a variational framework for statistical inference on cyclic interactions.
problem Estimating and comparing large-scale recurrent organization in directed interactions.
method Represent directed interactions as edge flows on a simplicial complex and evolve under an energy-minimizing dynamical system.
result Separate transient interaction components from persistent harmonic flows, yielding a low-dimensional cycle space.
We develop a method to summarize causal models with cycles in cubic time.
problem Cycles in high-dimensional causal models limit applicability of existing methods.
method We relax the acyclicity assumption in LiNG models and develop a low-dimensional DAG summary.
result Our method allows recovery of a low-dimensional DAG from high-dimensional data with cycles.
We present a simple agent-based model of a financial system composed of leveraged investors such as banks that invest in stocks and manage their risk using a Value-at-Risk constraint, based on historical observations of asset prices. The Value-at-Risk constraint implies that when perceived risk is low, leverage is high…
We address the issue of limit cycling behavior in training Generative Adversarial Networks and propose the use of Optimistic Mirror Decent (OMD) for training Wasserstein GANs. Recent theoretical results have shown that optimistic mirror decent (OMD) can enjoy faster regret rates in the context of zero-sum games. WGANs …
Horizon saddle connections imply dense hyperbolic geodesics on dilation surfaces.
problem Characterize dilation surfaces with dense hyperbolic geodesics.
method Analyzing saddle connections and directional flow properties.
result Dilation surfaces with horizon saddle connections have dense hyperbolic geodesics.
We describe an algorithm that associates to each positive real number r and each finite collection Cr of planar pixels of size r a planar piecewise linear set Sr with the following additional property: if Cr is the collection of pixels of size r that touch a given compact semialgebraic set S, then the …
Service-induced congestion in memory-constrained LLM serving
problem Service-induced congestion in memory-constrained large language model (LLM) serving
method Developing a discrete-time dynamical model of memory-constrained LLM inference
result The system converges to a unique worst-case limit cycle that is asymptotically stable outside a Lebesgue-measure-zero exact-capture set, with throughput losses as large as 50%.
Odd crossing numbers and even rotation numbers for cycles in plane immersions.
problem Analyzing crossing and rotation numbers of cycles in plane immersions of graphs.
method Generic immersions and Legendrian embeddings of graphs, focusing on cycles of specific lengths.
result Sum of rotation numbers of all 5-cycles is even, and sum of crossing numbers is odd.
The paper analyzes profitable bidding strategies for BESS in day-ahead and intraday markets.
problem Optimizing profitability of Battery Energy Storage Systems (BESS) in day-ahead and intraday markets.
method Employing the rolling intrinsic approach to model continuous intraday markets, accounting for bid-ask spreads and liquidity constraints.
result Multi-market bidding strategies outperform single-market participation, and relaxing daily cycling constraints can unlock additional value.
We analyze operational risk in terms of a spin glass model. Several regimes are investigated, as a functions of the parameters that characterize the dynamics. The system is found to be robust against variations of these parameters. We unveil the presence of limit cycles and scrutinize the features of the asymptotic sta…
Proves inequality for 1-dimensional cycles.
problem Proving the Parametric Coarea Inequality for 1-cycles.
method Analytical proof based on conjecture by Guth and Liokumovich.
result Proved the Parametric Coarea Inequality for 1-cycles.
This work introduces novel methods to identify and compare cycles across topological objects.
problem Identifying and comparing topological features, particularly cycles, across different topological objects.
method Two complementary approaches: dendrogram-based merge-tree algorithms and Stratified Gradient Sampling.
result Transformed cycle matching into hierarchical clustering and topological optimization framework.
This article introduces proximal planar vortex 1-cycles, resembling the structure of vortex atoms introduced by William Thomson (Lord Kelvin) in 1867 and recent work on the proximity of sets that overlap either spatially or descriptively. Vortex cycles resemble Thomson's model of a vortex atom, inspired by P.G. Tait's …
The matching of multiple objects (e.g. shapes or images) is a fundamental problem in vision and graphics. In order to robustly handle ambiguities, noise and repetitive patterns in challenging real-world settings, it is essential to take geometric consistency between points into account. Computationally, the multi-match…
Maps with a single face converge to hyperbolic surfaces in large genus.
problem Understanding geometric properties of high genus maps.
method Analyzing uniformly random maps and their convergence to hyperbolic surfaces.
result Lengths of simple cycles converge to a Poisson process.
Study Agol cycles for pseudo-Anosov 3-braids.
problem Conditions for equivalent Agol cycles of pseudo-Anosov 3-braids.
method Investigate necessary and sufficient conditions.
result Necessary and sufficient conditions for equivalent Agol cycles of pseudo-Anosov 3-braids.
Method detects lithium-ion battery knee onset for early warning.
problem Early warning of lithium-ion battery performance changes.
method Temporal dynamics extraction and Matrix Profile anomaly detection.
result Knee onset detected for categorizing battery health.
Study shows credit expansion in mortgage markets influenced U.S. business cycle.
problem Lack of causal evidence in cross-country business cycle studies.
method Unique research design combining cross-metropolitan U.S. data.
result Credit expansion caused stronger booms and busts in house-related industries.
Researchers compute Connes-Chamseddine cycle on 6D manifolds using noncommutative integral.
problem Computing the Connes-Chamseddine cycle for 6D manifolds.
method Using noncommutative integral on 6D manifolds, they compute the cycle.
result The Connes-Chamseddine cycle on 6D manifolds is computed.
Gauss diagrams' properties can change with Hamiltonian cycle choice.
problem The impact of Hamiltonian cycle choice on Gauss diagrams.
method Examined realizable and unrealizable Gauss diagrams, and proved preservation of realizability under certain Hamiltonian cycle changes.
result Properties of Gauss diagrams can vary with Hamiltonian cycle choice.
Proximal algorithms applied to current deformation into cycles.
problem Deformation of de Rham currents into cycles.
method Proximal algorithms, total variation denoising for differential forms.
result Calibrated cycles constructed in calibrated manifolds.
New algorithm for learning causal structures with disjoint cycles in linear non-Gaussian models.
problem Learning causal structures with cycles in linear non-Gaussian models.
method Characterizing when graphs determine the same model, using quadratic and cubic polynomial relations, and a strategy of decorrelating cycles and multivariate regression.
result Consistent and computationally efficient algorithm for learning causal structures with disjoint cycles.
Study of large mass limits of G2 and Calabi-Yau monopoles on specific manifolds.
problem Understanding the behavior of monopoles in the large mass limit on G2 and Calabi-Yau manifolds.
method Developed a structure theory for the limit of SU(2) G2-monopoles and Calabi-Yau monopoles, extracting singular abelian G2-monopoles with Dirac singularities. result Proved an energy identity for monopole bubbles in the large mass limit.
Credit expansion led to stronger household leverage cycles during the U.S. business cycle.
problem Understanding the role of credit supply in the U.S. business cycle.
method Causal evidence from 1999-2010 U.S. business cycle data.
result Credit expansion, particularly in private-label mortgages, caused stronger household leverage cycles.
Let G be a complex simple direct limit group, specifically SL(∞;C), SO(∞;C) or Sp(∞;C). Let F be a (generalized) flag in C∞. If G is SO(∞;C) or Sp(∞;C) we suppose further that F is isotropic. Let…