arXiv subjects

Tobias Müller

Publications and source records attributed to Tobias Müller.

68 records · Page 4Linked to original sources

arXiv2018

The first order convergence law fails for random perfect graphs

We consider first order expressible properties of random perfect graphs. That is, we pick a graph $G_n$ uniformly at random from all (labelled) perfect graphs on $n$ vertices and consider the probability that it satisfies some graph property that can be expressed in the first order language of graphs. We show that there exists such a first order expressible property for which the probability that $G_n$ satisfies it does not converge as $n\to\infty$.

math.CO↗

arXiv2018

Stability of the spiral spin liquid in MnSc$_2$S$_4$

We investigate the stability of the spiral spin liquid phase in MnSc$_2$S$_4$ against thermal and quantum fluctuations as well as against perturbing effects of longer-range interactions. Employing $ab~initio$ density functional theory (DFT) calculations we propose a realistic Hamiltonian for MnSc$_2$S$_4$, featuring second ($J_2$) and third $(J_3)$ neighbor Heisenberg interactions on the diamond lattice that are considerably larger than previously assumed. We argue that the combination of strong $J_2$ and $J_3$ couplings reproduces the correct magnetic Bragg peak position measured experimentally. Calculating the spin-structure factor within the pseudofermion functional-renormalization group technique we find that close to the magnetic phase transition the sizable $J_3$ couplings induce a strong spiral selection effect, in agreement with experiments. With increasing temperature the spiral selection becomes weaker such that in a window around three to five times the ordering temperature an approximate spiral spin liquid is realized in MnSc$_2$S$_4$.

cond-mat.str-el↗

arXiv2018

You Say 'What', I Hear 'Where' and 'Why': (Mis-)Interpreting SQL to Derive Fine-Grained Provenance

SQL declaratively specifies what the desired output of a query is. This work shows that a non-standard interpretation of the SQL semantics can, instead, disclose where a piece of the output originated in the input and why that piece found its way into the result. We derive such data provenance for very rich SQL dialects (including recursion, windowed aggregates, and user-defined functions) at the fine-grained level of individual table cells. The approach is non-invasive and implemented as a compositional source-level SQL rewrite: an input SQL query is transformed into its own interpreter that wields data dependencies instead of regular values. We deliberately design this transformation to preserve the shape of both data and query, which allows provenance derivation to scale to complex queries without overwhelming the underlying database system.

cs.DB↗

arXiv2018

Optimal Cheeger cuts and bisections of random geometric graphs

Let $d \geq 2$. The Cheeger constant of a graph is the minimum surface-to-volume ratio of all subsets of the vertex set with relative volume at most 1/2. There are several ways to define surface and volume here: the simplest method is to count boundary edges (for the surface) and vertices (for the volume). We show that for a geometric (possibly weighted) graph on $n$ random points in a $d$-dimensional domain with Lipschitz boundary and with distance parameter decaying more slowly (as a function of $n$) than the connectivity threshold, the Cheeger constant (under several possible definitions of surface and volume), also known as conductance, suitably rescaled, converges for large $n$ to an analogous Cheeger-type constant of the domain. Previously, García Trillos {\em et al.} had shown this for $d \geq 3$ but had required an extra condition on the distance parameter when $d=2$.

math.PR↗

arXiv2017

Signatures of a gearwheel quantum spin liquid in a spin-$\frac{1}{2}$ pyrochlore molybdate Heisenberg antiferromagnet

We theoretically investigate the low-temperature phase of the recently synthesized Lu$_2$Mo$_2$O$_5$N$_2$ material, an extraordinarily rare realization of a $S=1/2$ three-dimensional pyrochlore Heisenberg antiferromagnet in which Mo$^{5+}$ are the $S=1/2$ magnetic species. Despite a Curie-Weiss temperature ($Θ_{\rm CW}$) of $-121(1)$ K, experiments have found no signature of magnetic ordering $or$ spin freezing down to $T^*\approx0.5$ K. Using density functional theory, we find that the compound is well described by a Heisenberg model with exchange parameters up to third nearest neighbors. The analysis of this model via the pseudofermion functional renormalization group method reveals paramagnetic behavior down to a temperature of at least $T=|Θ_{\rm CW}|/100$, in agreement with the experimental findings hinting at a possible three-dimensional quantum spin liquid. The spin susceptibility profile in reciprocal space shows momentum-dependent features forming a "gearwheel" pattern, characterizing what may be viewed as a molten version of a chiral noncoplanar incommensurate spiral order under the action of quantum fluctuations. Our calculated reciprocal space susceptibility maps provide benchmarks for future neutron scattering experiments on single crystals of Lu$_2$Mo$_2$O$_5$N$_2$.

cond-mat.str-el↗

arXiv2017

Generalised Mycielski graphs and the Borsuk-Ulam theorem

Stiebitz determined the chromatic number of generalised Mycielski graphs using the topological method of Lovasz, which invokes the Borsuk-Ulam theorem. Van Ngoc and Tuza used elementary combinatorial arguments to prove Stiebitz's theorem for 4-chromatic generalised Mycielski graphs, and asked if there is also an elementary combinatorial proof for higher chromatic number. We answer their question by showing that Stiebitz's theorem can be deduced from a version of Fan's combinatorial lemma. Our proof uses topological terminology, but is otherwise completely discrete and could be rewritten to avoid topology altogether. However, doing so would be somewhat artificial, because we also show that Stiebitz's theorem is equivalent to the Borsuk-Ulam theorem.

math.CO↗

arXiv2017

Coloring Jordan regions and curves

A Jordan region is a subset of the plane that is homeomorphic to a closed disk. Consider a family $\mathcal{F}$ of Jordan regions whose interiors are pairwise disjoint, and such that any two Jordan regions intersect in at most one point. If any point of the plane is contained in at most $k$ elements of $\mathcal{F}$ (with $k$ sufficiently large), then we show that the elements of $\mathcal{F}$ can be colored with at most $k+1$ colors so that intersecting Jordan regions are assigned distinct colors. This is best possible and answers a question raised by Reed and Shepherd in 1996. As a simple corollary, we also obtain a positive answer to a problem of Hliněný (1998) on the chromatic number of contact systems of strings. We also investigate the chromatic number of families of touching Jordan curves. This can be used to bound the ratio between the maximum number of vertex-disjoint directed cycles in a planar digraph, and its fractional counterpart.

math.CO↗

arXiv2017

Dynamical transport measurement of the Luttinger parameter in helical edges states of 2D topological insulators

One-dimensional (1D) electron systems in the presence of Coulomb interaction are described by Luttinger liquid theory. The strength of Coulomb interaction in the Luttinger liquid, as parameterized by the Luttinger parameter K, is in general difficult to measure. This is because K is usually hidden in powerlaw dependencies of observables as a function of temperature or applied bias. We propose a dynamical way to measure K on the basis of an electronic time-of-flight experiment. We argue that the helical Luttinger liquid at the edge of a 2D topological insulator constitutes a preeminently suited realization of a 1D system to test our proposal. This is based on the robustness of helical liquids against elastic backscattering in the presence of time reversal symmetry.

cond-mat.str-el↗

arXiv2016

Law of large numbers for the largest component in a hyperbolic model of complex networks

We consider the component structure of a recent model of random graphs on the hyperbolic plane that was introduced by Krioukov et al. The model exhibits a power law degree sequence, small distances and clustering, features that are associated with the so-called complex networks. The model is controlled by two parameters $α$ and $ν$ where, roughly speaking, $α$ controls the exponent of the power law and $ν$ controls the average degree. Refining earlier results, we are able to show a law of large numbers for the largest component. That is, we show that the fraction of points in the largest component tends in probability to a constant $c$ that depends only on $α,ν$, while all other components are sublinear. We also study how $c$ depends on $α, ν$. To deduce our results, we introduce a local approximation of the random graph by a continuum percolation model on $\mathbb{R}^2$ that may be of independent interest.

math.PR↗

arXiv2015

Dark matter scenarios in a constrained model with Dirac gauginos

We perform the first analysis of Dark Matter scenarios in a constrained model with Dirac Gauginos. The model under investigation is the Constrained Minimal Dirac Gaugino Supersymmetric Standard model (CMDGSSM) where the Majorana mass terms of gauginos vanish. However, $R$-symmetry is broken in the Higgs sector by an explicit and/or effective $B_μ$-term. This causes a mass splitting between Dirac states in the fermion sector and the neutralinos, which provide the dark matter candidate, become pseudo-Dirac states. We discuss two scenarios: the universal case with all scalar masses unified at the GUT scale, and the case with non-universal Higgs soft-terms. We identify different regions in the parameter space which fullfil all constraints from the dark matter abundance, the limits from SUSY and direct dark matter searches and the Higgs mass. Most of these points can be tested with the next generation of direct dark matter detection experiments.

hep-ph↗

arXiv2015

A geometric Achlioptas process

The random geometric graph is obtained by sampling $n$ points from the unit square (uniformly at random and independently), and connecting two points whenever their distance is at most $r$, for some given $r=r(n)$. We consider the following variation on the random geometric graph: in each of $n$ rounds in total, a player is offered two random points from the unit square, and has to select exactly one of these two points for inclusion in the evolving geometric graph. We study the problem of avoiding a linear-sized (or "giant") component in this setting. Specifically, we show that for any $r\ll(n\log\log n)^{-1/3}$ there is a strategy that succeeds in keeping all component sizes sublinear, with probability tending to one as $n\to\infty$. We also show that this is tight in the following sense: for any $r\gg(n\log\log n)^{-1/3}$, the player will be forced to create a component of size $(1-o(1))n$, no matter how he plays, again with probability tending to one as $n\to\infty$. We also prove that the corresponding offline problem exhibits a similar threshold behaviour at $r(n)=Θ(n^{-1/3})$. These findings should be compared to the existing results for the (ordinary) random geometric graph: there a giant component arises with high probability once $r$ is of order $n^{-1/2}$. Thus, our results show, in particular, that in the geometric setting the power of choices can be exploited to a much larger extent than in the classical Erdős-Rényi random graph, where the appearance of a giant component can only be delayed by a constant factor.

math.PR↗

arXiv2012

Hamilton cycles in random geometric graphs

We prove that, in the Gilbert model for a random geometric graph, almost every graph becomes Hamiltonian exactly when it first becomes 2-connected. This answers a question of Penrose. We also show that in the k-nearest neighbor model, there is a constant κ such that almost every κ-connected graph has a Hamilton cycle.

math.PR↗

arXiv2011

Cops and Robbers on Geometric Graphs

Cops and robbers is a turn-based pursuit game played on a graph $G$. One robber is pursued by a set of cops. In each round, these agents move between vertices along the edges of the graph. The cop number $c(G)$ denotes the minimum number of cops required to catch the robber in finite time. We study the cop number of geometric graphs. For points $x_1, ..., x_n \in \R^2$, and $r \in \R^+$, the vertex set of the geometric graph $G(x_1, ..., x_n; r)$ is the graph on these $n$ points, with $x_i, x_j$ adjacent when $ \norm{x_i -x_j} \leq r$. We prove that $c(G) \leq 9$ for any connected geometric graph $G$ in $R^2$ and we give an example of a connected geometric graph with $c(G) = 3$. We improve on our upper bound for random geometric graphs that are sufficiently dense. Let $G(n,r)$ denote the probability space of geometric graphs with $n$ vertices chosen uniformly and independently from $[0,1]^2$. For $G \in G(n,r)$, we show that with high probability (whp), if $r \geq K_1 (\log n/n)^{1/4}$, then $c(G) \leq 2$, and if $r \geq K_2(\log n/n)^{1/5}$, then $c(G) = 1$ where $K_1, K_2 > 0$ are absolute constants. Finally, we provide a lower bound near the connectivity regime of $G(n,r)$: if $r \leq K_3 \log n / \sqrt{n} $ then $c(G) > 1$ whp, where $K_3 > 0$ is an absolute constant.

math.CO↗

arXiv2011

On the chromatic number of random geometric graphs

Given independent random points $X_1,...,X_n\in\eR^d$ with common probability distribution $ν$, and a positive distance $r=r(n)>0$, we construct a random geometric graph $G_n$ with vertex set $\{1,...,n\}$ where distinct $i$ and $j$ are adjacent when $\norm{X_i-X_j}\leq r$. Here $\norm{.}$ may be any norm on $\eR^d$, and $ν$ may be any probability distribution on $\eR^d$ with a bounded density function. We consider the chromatic number $χ(G_n)$ of $G_n$ and its relation to the clique number $ω(G_n)$ as $n \to \infty$. Both McDiarmid and Penrose considered the range of $r$ when $r \ll (\frac{\ln n}{n})^{1/d}$ and the range when $r \gg (\frac{\ln n}{n})^{1/d}$, and their results showed a dramatic difference between these two cases. Here we sharpen and extend the earlier results, and in particular we consider the `phase change' range when $r \sim (\frac{t\ln n}{n})^{1/d}$ with $t>0$ a fixed constant. Both McDiarmid and Penrose asked for the behaviour of the chromatic number in this range. We determine constants $c(t)$ such that $\frac{χ(G_n)}{nr^d}\to c(t)$ almost surely. Further, we find a "sharp threshold" (except for less interesting choices of the norm when the unit ball tiles $d$-space): there is a constant $t_0>0$ such that if $t \leq t_0$ then $\frac{χ(G_n)}{ω(G_n)}$ tends to 1 almost surely, but if $t > t_0$ then $\frac{χ(G_n)}{ω(G_n)}$ tends to a limit $>1$ almost surely.

math.CO↗