We find families of prime knot diagrams with arbitrary extreme coefficients in their Jones polynomials. Some graph theory is presented in connection with this problem, generalizing ideas by Yongju Bae and Morton and giving a positive answer to a question in their paper.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “extremal graph theory”
New theorem on graph curvature thresholds and uniqueness.
problem Determining the minimum number of edges for graphs to have positive curvature.
method Analyzing graphs with specific edge counts and curvature properties.
result Optimal threshold for positive curvature and uniqueness of extremal graphs.
This paper uses MIS to identify key financial institutions with minimal risk contagion.
problem Mitigating systemic risk during extreme financial events.
method Applying extreme value theory and MIS from graph theory to identify diversified portfolios.
result Identified a subset of institutions with minimal extremal dependence for diversified portfolios.
Proposes a network-based strategy to manage financial market risks.
problem Managing extreme events in volatile financial markets.
method Extreme value theory, network model, maximum independent set, value at risk, expected shortfall.
result Developed portfolio strategies improve risk diversification.
The paper finds minimum Steklov eigenvalues on combinatorial graphs.
problem Finding the minimum Steklov eigenvalues on combinatorial graphs.
method Extending Friedman's nodal domain theory for Laplacian eigenfunctions to Steklov eigenfunctions.
result The minimum of the Steklov eigenvalue on a connected combinatorial graph is essentially attained by a star or a regular comb with minimal brooms.
Spectral clustering identifies clusters of multivariate extremes.
problem Analyzing the dependence structure of multivariate extremes.
method Spectral clustering based on a random -nearest neighbor graph.
result Spectral clustering can consistently identify clusters of multivariate extremes under certain conditions.
It was proven by González-Meneses, Manchón and Silvero that the extreme Khovanov homology of a link diagram is isomorphic to the reduced (co)homology of the independence simplicial complex obtained from a bipartite circle graph constructed from the diagram. In this paper we conjecture that this simplicial complex is al…
Deep learning model predicts wildfire spread in Australia.
problem Predicting the full distribution of wildfire spread in Australia.
method Graph convolutional neural networks and extended generalized Pareto distribution.
result Efficacy of the model demonstrated through hazard assessment.
Proves Khovanov homology has no torsion for bipartite circle graphs.
problem Proving properties of Khovanov homology for bipartite circle graphs.
method Proved homotopy equivalence of independence complexes to wedges of spheres.
result Extreme Khovanov homology has no torsion.
In this article, we improve extreme learning machines for regression tasks using a graph signal processing based regularization. We assume that the target signal for prediction or regression is a graph signal. With this assumption, we use the regularization to enforce that the output of an extreme learning machine is s…
In a wide variety of situations, anomalies in the behaviour of a complex system, whose health is monitored through the observation of a random vector X = (X1,. .. , X d) valued in R d , correspond to the simultaneous occurrence of extreme values for certain subgroups {1,. .. , d} of variables Xj. Under th…
Study finds Scherk type surfaces as extremals for zero-curvature minimal graphs.
problem Finding extremal minimal graphs with zero Gaussian curvature at the center.
method Analyzing Scherk surfaces and their properties.
result Scherk type minimal surfaces are extremals for zero-curvature minimal graphs.
Study supports conjecture about pretzel links' homology.
problem Investigate extreme Khovanov homology of pretzel links.
method Geometric realizations of the independence simplicial complex.
result Supports conjecture that extreme Khovanov homology is torsion-free.
Alt-GNNs improve travel mode choice modeling by integrating graph neural networks with GEV models.
problem Capturing alternative dependence in discrete choice models with predefined, symmetric, and uniform dependence.
method Introducing Alternative Graph Neural Networks (Alt-GNNs) that embed alternative dependence within a unified framework.
result Alt-GNNs significantly improve predictive performance over benchmark models in travel mode choice datasets.
Spectral sparsification improves Laplacian-constrained graph learning.
problem Improving accuracy of Laplacian-constrained graph learning.
method Spectral graph sparsification as a post-estimation operation.
result Improved accuracy of Laplacian-constrained graph learning.
Koopman operator theory simplifies complex systems analysis.
problem Analyzing nonlinear dynamical systems and complex networks.
method Estimating Koopman operator from data to reveal system properties.
result Koopman operators provide insights into system characteristics.
Critical graphs of quadratic differentials equidistribute in moduli space.
problem Distribution of critical graphs in moduli space.
method Study of Jenkins-Strebel differentials and their critical graphs.
result Critical graphs equidistribute to the Kontsevich measure.
Extreme value theory enhances statistical learning extrapolation for rare events.
problem Challenges in traditional machine learning methods for extreme data.
method Asymptotic theory and statistical tools for tail behavior.
result Effective extrapolation methods for extreme quantiles and anomalies.
New homology theory for graphs detects subdivisions and homology manifolds.
problem Defining a dissimilarity metric for graphs.
method Filtration on simplicial homology, using bi-colourings of vertices.
result The überhomology vanishes in lowest degree for subdivisions and coincides with fundamental class for homology manifolds.
In this letter, two explicit self-similar solutions to a graph representation of time-like extremal hypersurfaces in Minkowski spacetime are given. Meanwhile, there is an untable eigenvalue in the linearized time-like extremal hypersurfaces equation around two explicit self-similar solutions.
Graph learning from data represents a canonical problem that has received substantial attention in the literature. However, insufficient work has been done in incorporating prior structural knowledge onto the learning of underlying graphical models from data. Learning a graph with a specific structure is essential for …
Discrete analogues of classical spectral geometric inequalities and extremal eigenvalue problems on graphs.
problem Extremal eigenvalue problems on graphs
method Developing nodal domain methods for adjacency matrices
result Establishing sharp extremal characterizations across diverse graph classes
We prove that the hypothetical extreme Khovanov cohomology of a link is the cohomology of the independence simplicial complex of its Lando graph. We also provide a family of knots having as many non-trivial extreme Khovanov cohomology modules as desired, that is, examples of -thick knots which are as far of being $H…
New rigidity result for hyperbolic surfaces based on curve lengths.
problem Determining hyperbolic metrics on surfaces from curve lengths.
method Investigating oriented graphs on curve complexes and Dehn quasi-homothetic functions.
result Knowing which curve is longer suffices to determine the hyperbolic metric on a surface.
In extreme classification problems, learning algorithms are required to map instances to labels from an extremely large label set. We build on a recent extreme classification framework with logarithmic time and space, and on a general approach for error correcting output coding (ECOC) with loss-based decoding, and intr…
New method learns graphical models with latent variables for extreme events.
problem Learning graphical models with latent variables for multivariate extremes.
method Tractable convex program exttt{eglatent} for Hüsler-Reiss models.
result Consistently recovers conditional graph and latent variables.
New framework estimates treatment effects in extreme data.
problem Hindered by unavailability of counterfactual outcomes and rarity of extreme data.
method Proposes a new framework based on extreme value theory.
result Quantifies treatment effects using tail decay rates of potential outcomes.
We adapt Thistlethwaite's alternating tangle decomposition of a knot diagram to identify the potential extreme terms in its bracket polynomial, and give a simple combinatorial calculation for their coefficients, based on the intersection graph of certain chord diagrams.
Adding node feature kernels improves GCN robustness to graph perturbations.
problem GCNs' robustness to graph perturbations is a concern.
method Introduced random GCN and added node feature kernels to message passing.
result Perturbations of the graph structure can significantly degrade GCN performance.
IFH models graph generation with adjustable sequentiality.
problem Designing flexible graph generation models between one-shot and sequential approaches.
method Based on DDPM, IFH uses a node removal process to generate graphs with adjustable sequentiality.
result IFH models improve graph generation quality and efficiency compared to current methods.
Paper improves risk estimation for extreme events.
problem Estimating extreme risks accurately.
method Modified Bayes risk for expectiles, asymptotic expansions, efficient estimators.
result Asymptotic normality of estimators proved.
Estimates treatment effects in rare extreme events using EVT.
problem Estimating treatment effects in rare, impactful events like extreme climate events.
method Introduces a novel framework using EVT and multivariate regular variation for consistent treatment effect estimation.
result Developed a consistent estimator for extreme treatment effects with rigorous non-asymptotic analysis.
This paper improves bounds on how many Delta-moves are needed to trivialize a link.
problem Counting the minimum number of Delta-moves to make a link homotopy trivial.
method Classification of link homotopy and extremal graph theory.
result Quadratic and cubic upper bounds on the homotopy trivializing numbers of links.
Combines GANs and EVT for better modeling of spatial climate extremes.
problem Modeling dependencies between climate extremes, especially in high-dimensional spaces.
method Generative Adversarial Networks (GANs) combined with Extreme Value Theory (EVT).
result evtGAN outperforms classical GANs and statistical approaches in modeling spatial extremes.
New method uses extreme value theory to estimate neural network errors.
problem Quantifying the error of neural networks, especially for large values.
method Applying extreme value theory to approximate the distribution of error.
result Developed a new estimator for the shape parameter of the Pareto distribution.
Proves rigidity of extremal Kerr-Newman horizons.
problem Classifying near-horizon geometries of extremal Kerr-Newman horizons.
method Proves intrinsic geometry constraints leading to rigidity.
result Proves extremal Kerr-Newman horizons are unique.
A novel model combines deep learning and extreme value theory for multivariate cyber risk prediction.
problem High dimensionality and heavy tails in multivariate cyber risk patterns.
method Combines deep learning for point predictions and extreme value theory for quantile predictions.
result The model provides satisfactory high quantile predictions and accurate point predictions.
Flexible Tails for Normalising Flows, with Application to the Modelling of Financial Return Datastat.ML
Proposes a method to model financial returns with extreme shocks using flexible tail transformations.
problem Capturing extreme shocks in financial return data.
method Introduces a transformation layer in normalizing flows to model heavy-tailed distributions.
result Trained models can generate synthetic sets of extreme returns.
The Einstein-Maxwell equations on a smooth compact 4-manifold are reformulated as a purely Riemannian variational problem analogous to Calabi's variational problem for extremal Kahler metrics. Next, Seiberg-Witten theory is used to show that these two problems are in fact intimately related. Extremal Kahler metrics are…
A simpler proof for apex graphs in McCarty and Thomas' conjecture.
problem Proving a conjecture about apex graphs and their linklessly embeddable properties.
method Shorter and simpler proof for the apex case.
result A shorter and simpler proof for the apex case of the conjecture.
This paper defines girth for knots and links, linking it to Khovanov homology.
problem Understanding the girth of knots and links using Khovanov homology.
method Utilizing relations between Khovanov and chromatic graph homology.
result The girth of a link is determined, and its values are related to Khovanov homology.
Classification tasks usually assume that all possible classes are present during the training phase. This is restrictive if the algorithm is used over a long time and possibly encounters samples from unknown classes. The recently introduced extreme value machine, a classifier motivated by extreme value theory, addresse…
Uniqueness theorem for extremal charged black holes in de Sitter space.
problem Proving uniqueness of extremal charged black holes in de Sitter space.
method Analyzing Einstein-Maxwell theory with a positive cosmological constant.
result Local isometry to extremal Reissner-Nordström-de Sitter black hole or its near-horizon geometry.
In this paper, we study the possibility of inferring early warning indicators (EWIs) for periods of extreme bitcoin price volatility using features obtained from Bitcoin daily transaction graphs. We infer the low-dimensional representations of transaction graphs in the time period from 2012 to 2017 using Bitcoin blockc…
ExGAN generates realistic extreme samples using GANs and EVT.
problem Generating realistic extreme scenarios for risk management.
method ExGAN combines GANs with EVT to model extreme tails of distributions.
result ExGAN efficiently generates extreme samples with constant time complexity.
New method identifies extreme risk propagation in financial networks.
problem Understanding extreme risk in financial networks.
method Max-linear structural equation model, hard-thresholding, Hamming distance.
result Sparse DAG for extreme risk propagation estimated.
Balancing graph summarization and change detection in streaming data.
problem Balancing compression rate in graph summarization and accuracy in change detection.
method Introducing a probabilistic hierarchical latent variable model and optimizing parameters based on the minimum description length principle to balance the trade-off.
result Guaranteed suppression of Type I error probability (false alarms) in change detection.
Kernel PCA helps analyze multivariate extremes and clusters them effectively.
problem Analyzing the dependence structure of multivariate extremes.
method Kernel PCA as a method for clustering and dimension reduction.
result Kernel PCA preimages effectively identify clusters in multivariate extremes.