614 research outputs found
Faltings delta-invariant and semistable degeneration
We determine the asymptotic behavior of the Arakelov metric, the
Arakelov-Green's function, and the Faltings delta-invariant for arbitrary
one-parameter families of complex curves with semistable degeneration. The
leading terms in the asymptotics are given a combinatorial interpretation in
terms of S. Zhang's theory of admissible Green's functions on polarized
metrized graphs.Comment: 50 page
Benchmarking treewidth as a practical component of tensor-network--based quantum simulation
Tensor networks are powerful factorization techniques which reduce resource
requirements for numerically simulating principal quantum many-body systems and
algorithms. The computational complexity of a tensor network simulation depends
on the tensor ranks and the order in which they are contracted. Unfortunately,
computing optimal contraction sequences (orderings) in general is known to be a
computationally difficult (NP-complete) task. In 2005, Markov and Shi showed
that optimal contraction sequences correspond to optimal (minimum width) tree
decompositions of a tensor network's line graph, relating the contraction
sequence problem to a rich literature in structural graph theory. While
treewidth-based methods have largely been ignored in favor of dataset-specific
algorithms in the prior tensor networks literature, we demonstrate their
practical relevance for problems arising from two distinct methods used in
quantum simulation: multi-scale entanglement renormalization ansatz (MERA)
datasets and quantum circuits generated by the quantum approximate optimization
algorithm (QAOA). We exhibit multiple regimes where treewidth-based algorithms
outperform domain-specific algorithms, while demonstrating that the optimal
choice of algorithm has a complex dependence on the network density, expected
contraction complexity, and user run time requirements. We further provide an
open source software framework designed with an emphasis on accessibility and
extendability, enabling replicable experimental evaluations and future
exploration of competing methods by practitioners.Comment: Open source code availabl
List-coloring and sum-list-coloring problems on graphs
Graph coloring is a well-known and well-studied area of graph theory that has many applications. In this dissertation, we look at two generalizations of graph coloring known as list-coloring and sum-list-coloring. In both of these types of colorings, one seeks to first assign palettes of colors to vertices and then choose a color from the corresponding palette for each vertex so that a proper coloring is obtained.
A celebrated result of Thomassen states that every planar graph can be properly colored from any arbitrarily assigned palettes of five colors. This result is known as 5-list-colorability of planar graphs. Albertson asked whether Thomassen\u27s theorem can be extended by precoloring some vertices which are at a large enough distance apart. Hutchinson asked whether Thomassen\u27s theorem can be extended by allowing certain vertices to have palettes of size less than five assigned to them. In this dissertation, we explore both of these questions and answer them in the affirmative for various classes of graphs.
We also provide a catalog of small configurations with palettes of different prescribed sizes and determine whether or not they can always be colored from palettes of such sizes. These small configurations can be useful in reducing certain planar graphs to obtain more information about their structure.
Additionally, we look at the newer notion of sum-list-coloring where the sum choice number is the parameter of interest. In sum-list-coloring, we seek to minimize the sum of varying sizes of palettes of colors assigned the vertices of a graph. We compute the sum choice number for all graphs on at most five vertices, present some general results about sum-list-coloring, and determine the sum choice number for certain graphs made up of cycles
Adaptivity Complexity for Causal Graph Discovery
Causal discovery from interventional data is an important problem, where the
task is to design an interventional strategy that learns the hidden ground
truth causal graph on nodes while minimizing the number of
performed interventions. Most prior interventional strategies broadly fall into
two categories: non-adaptive and adaptive. Non-adaptive strategies decide on a
single fixed set of interventions to be performed while adaptive strategies can
decide on which nodes to intervene on sequentially based on past interventions.
While adaptive algorithms may use exponentially fewer interventions than their
non-adaptive counterparts, there are practical concerns that constrain the
amount of adaptivity allowed. Motivated by this trade-off, we study the problem
of -adaptivity, where the algorithm designer recovers the causal graph under
a total of sequential rounds whilst trying to minimize the total number of
interventions. For this problem, we provide a -adaptive algorithm that
achieves approximation with
respect to the verification number, a well-known lower bound for adaptive
algorithms. Furthermore, for every , we show that our approximation is
tight. Our definition of -adaptivity interpolates nicely between the
non-adaptive () and fully adaptive () settings where our
approximation simplifies to and respectively, matching the
best-known approximation guarantees for both extremes. Our results also extend
naturally to the bounded size interventions.Comment: Accepted into UAI 202
Constant & time-varying hedge ratio for FBMKLCI stock index futures
This paper examines hedging strategy in stock index futures for Kuala Lumpur Composite Index futures of Malaysia. We employed two different econometric
methods such as-vector error correction model (VECM) and bivariate generalized autoregressive conditional heteroskedasticity (BGARCH) models to estimate
optimal hedge ratio by using daily data of KLCI index and KLCI futures for the period from January 2012 to June 2016 amounting to a total of 1107 observations.
We found that VECM model provides better results with respect to estimating hedge ratio for spot month futures and one-month futures, while BGACH shows
better for distance futures. While VECM estimates time invariant hedge ratio, the BGARCH shows that hedge ratio changes over time. As such, hedger should
rebalance his/her position in futures contract time to time in order to reduce risk exposure
Matchings and Flows in Hypergraphs
In this dissertation, we study matchings and flows in hypergraphs using combinatorial methods. These two problems are among the best studied in the field of combinatorial optimization. As hypergraphs are a very general concept, not many results on graphs can be generalized to arbitrary hypergraphs. Therefore, we consider special classes of hypergraphs, which admit more structure, to transfer results from graph theory to hypergraph theory.
In Chapter 2, we investigate the perfect matching problem on different classes of hypergraphs generalizing bipartite graphs. First, we give a polynomial time approximation algorithm for the maximum weight matching problem on so-called partitioned hypergraphs, whose approximation factor is best possible up to a constant. Afterwards, we look at the theorems of König and Hall and their relation. Our main result is a condition for the existence of perfect matchings in normal hypergraphs that generalizes Hall’s condition for bipartite graphs.
In Chapter 3, we consider perfect f-matchings, f-factors, and (g,f)-matchings. We prove conditions for the existence of (g,f)-matchings in unimodular hypergraphs, perfect f-matchings in uniform Mengerian hypergraphs, and f-factors in uniform balanced hypergraphs. In addition, we give an overview about the complexity of the (g,f)-matching problem on different classes of hypergraphs generalizing bipartite graphs.
In Chapter 4, we study the structure of hypergraphs that admit a perfect matching. We show that these hypergraphs can be decomposed along special cuts. For graphs it is known that the resulting decomposition is unique, which does not hold for hypergraphs in general. However, we prove the uniqueness of this decomposition (up to parallel hyperedges) for uniform hypergraphs.
In Chapter 5, we investigate flows on directed hypergraphs, where we focus on graph-based directed hypergraphs, which means that every hyperarc is the union of a set of pairwise disjoint ordinary arcs. We define a residual network, which can be used to decide whether a given flow is optimal or not. Our main result in this chapter is an algorithm that computes a minimum cost flow on a graph-based directed hypergraph. This algorithm is a generalization of the network simplex algorithm.Diese Arbeit untersucht Matchings und Flüsse in Hypergraphen mit Hilfe kombinatorischer Methoden. In Graphen gehören diese Probleme zu den grundlegendsten der kombinatorischen Optimierung. Viele Resultate lassen sich nicht von Graphen auf Hypergraphen verallgemeinern, da Hypergraphen ein sehr abstraktes Konzept bilden. Daher schauen wir uns bestimmte Klassen von Hypergraphen an, die mehr Struktur besitzen, und nutzen diese aus um Resultate aus der Graphentheorie zu übertragen. In Kapitel 2 betrachten wir das perfekte Matchingproblem auf Klassen von „bipartiten“ Hypergraphen, wobei es verschiedene Möglichkeiten gibt den Begriff „bipartit“ auf Hypergraphen zu definieren. Für sogenannte partitionierte Hypergraphen geben wir einen polynomiellen Approximationsalgorithmus an, dessen Gütegarantie bis auf eine Konstante bestmöglich ist. Danach betrachten wir die Sätze von Konig und Hall und untersuchen deren Zusammenhang. Unser Hauptresultat ist eine Bedingung für die Existenz von perfekten Matchings auf normalen Hypergraphen, die Halls Bedingung für bipartite Graphen verallgemeinert. Als Verallgemeinerung von perfekten Matchings betrachten wir in Kapitel 3 perfekte f-Matchings, f-Faktoren und (g, f)-Matchings. Wir beweisen Bedingungen für die Existenz von (g, f)-Matchings auf unimodularen Hypergraphen, perfekten f-Matchings auf uniformen Mengerschen Hypergraphen und f-Faktoren auf uniformen balancierten Hypergraphen. Außerdem geben wir eine Übersicht über die Komplexität des (g, f)-Matchingproblems auf verschiedenen Klassen von Hypergraphen an, die bipartite Graphen verallgemeinern. In Kapitel 4 untersuchen wir die Struktur von Hypergraphen, die ein perfektes Matching besitzen. Wir zeigen, dass diese Hypergraphen entlang spezieller Schnitte zerlegt werden können. Für Graphen weiß man, dass die so erhaltene Zerlegung eindeutig ist, was im Allgemeinen für Hypergraphen nicht zutrifft. Wenn man jedoch uniforme Hypergraphen betrachtet, dann liefert jede Zerlegung die gleichen unzerlegbaren Hypergraphen bis auf parallele Hyperkanten. Kapitel 5 beschäftigt sich mit Flüssen in gerichteten Hypergraphen, wobei wir Hypergraphen betrachten, die auf gerichteten Graphen basieren. Das bedeutet, dass eine Hyperkante die Vereinigung einer Menge von disjunkten Kanten ist. Wir definieren ein Residualnetzwerk, mit dessen Hilfe man entscheiden kann, ob ein gegebener Fluss optimal ist. Unser Hauptresultat in diesem Kapitel ist ein Algorithmus, um einen Fluss minimaler Kosten zu finden, der den Netzwerksimplex verallgemeinert
Exact and Heuristic Solutions to the Bandwidth Minimization Problem
The bandwidth minimization problem is a classical combinatorial optimization problem studied since about 1960. It is formulated as follows. Given a connected graph G=(V,E) with n vertices, the task is to find a permutation l of the vertices (also called a labeling), i.e., a bijection between V and {1,2,...,n}, such that the maximum difference |l(u)-l(v)|, for uv in E, is minimized. This problem is NP-hard, even for binary trees. Applications of the bandwidth problem can be found in many areas: solving systems of linear equations, data storage, electronic circuit design, and recently in compression of topological information from digital road networks. In this dissertation we report our contributions of both heuristic and exact methods for the bandwidth problem. On the heuristic side, we start by modifying a heuristic method which exploits properties of the graph. Next we propose an approximate objective function for the bandwidth problem. It is very sensitive to alterations in a permutation and can thus be used efficiently in global optimization heuristic methods. A simulated annealing method using the approximate objective function is reported. We also present an application of the bandwidth problem to the compression of topological information of digital road networks. For exact methods, which are our main focus, we formulate the concept of a partial permutation. Based on this concept, we introduce new constraints for the bandwidth problem and apply them efficiently in a branch-and-bound algorithm. We analyze the relation between certain partial permutations and show that some partial permutations are dominated by others. Therefore, they can be eliminated in the branch-and-bound tree and this reduces the search space and running time. Furthermore, we enhance the use of partial permutations in branch-and-bound algorithms with a 2-labeling scheme, supported by the dominance rule. Instead of extending the partial permutation one-by-one, our scheme uses two vertices simultaneously. We evaluate our algorithms on a popular benchmark suite which comprises 113 instances with less than 1,000 vertices each. In many cases our work improves on the best known lower bound in the literature. Moreover, our exact algorithms are capable of computing lower bounds for much larger instances. We perform computational experiments on a second suite of 36 instances with more than 1,000 vertices each, whose best known lower bound so far is the generic theoretical one. We can improve this bound for some instances in this suite, the largest such instance having about 15,600 vertices. Finally, we parallelize our branch-and-bound algorithms and run the solver on a parallel cluster with 256 processors, improving the lower bound for some instances in the first benchmark suite even further
Size of orthogonal sets of exponentials for the disk
Suppose \Lambda \subseteq \RR^2 has the property that any two exponentials
with frequency from are orthogonal in the space , where D
\subseteq \RR^2 is the unit disk. Such sets are known to be finite
but it is not known if their size is uniformly bounded. We show that if there
are two elements of which are distance apart then the size of
is . As a consequence we improve a result of Iosevich and
Jaming and show that has at most elements in any disk of
radius
- …