activity
20092021
most citedMeasurement of in with decays by a combined time-dependent Dalitz plot analysis of BaBar and Belle data

32 citations · 60 across the 8 of their papers we have counts for

collaborators

12 papers

math.PR2021

Poisson-Voronoi percolation in the hyperbolic plane with small intensities

Benjamin T. Hansen, Tobias Müller

We consider percolation on the Voronoi tessellation generated by a homogeneous Poisson point process on the hyperbolic plane. We show that the critical probability for the existenc…

math.CO2021

On the contractibility of random Vietoris-Rips complexes

Tobias Müller, Matěj Stehlík

We show that the Vietoris-Rips complex built over points sampled at random from a uniformly positive probability measure on a convex body $K\subseteq \mathbb…

math.CO2020

Component Games on Random Graphs

Rani Hod, Michael Krivelevich, Tobias Müller +2

In the component game played on a graph , two players, Maker and Breaker, alternately claim~ and~ previously unclaimed edges of , respectively. Maker…

math.CO2020

Limiting probabilities of first order properties of random sparse graphs and hypergraphs

Alberto Larrauri, Tobias Müller, Marc Noy

Let be the binomial random graph in the sparse regime, which as is well-known undergoes a phase transition at . Lynch (Random Structures Algorithms, 1992) s…

math.PR2020

The critical probability for Voronoi percolation in the hyperbolic plane tends to

Benjamin T. Hansen, Tobias Müller

We consider percolation on the Voronoi tessellation generated by a homogeneous Poisson point process on the hyperbolic plane. We show that the critical probability for the existenc…

hep-ex2018★ 32 cited

Measurement of in with decays by a combined time-dependent Dalitz plot analysis of BaBar and Belle data

The BaBar, Belle Collaborations, : +407

We report measurements of and from a time-dependent Dalitz plot analysis of with decays, where the lig…

math.CO2017

The first order convergence law fails for random perfect graphs

Tobias Müller, Marc Noy

We consider first order expressible properties of random perfect graphs. That is, we pick a graph uniformly at random from all (labelled) perfect graphs on vertices and c…

math.CO2017★ 3 cited

Generalised Mycielski graphs and the Borsuk-Ulam theorem

Tobias Müller, Matěj Stehlík

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 eleme…

math.PR2015★ 1 cited

The critical probability for confetti percolation equals

Tobias Muller

In the confetti percolation model, or two-coloured dead leaves model, radius one disks arrive on the plane according to a space-time Poisson process. Each disk is coloured black wi…

math.CO2014

Logical limit laws for minor-closed classes of graphs

Peter Heinig, Tobias Muller, Marc Noy +1

Let be an addable, minor-closed class of graphs. We prove that the zero-one law holds in monadic second-order logic (MSO) for the random graph drawn uniformly at rando…

math.CO2011

Cops and Robbers on Geometric Graphs

Andrew Beveridge, Andrzej Dudek, Alan Frieze +1

Cops and robbers is a turn-based pursuit game played on a graph . One robber is pursued by a set of cops. In each round, these agents move between vertices along the edges of th…

math.PR2009★ 24 cited

Hamilton cycles in random geometric graphs

József Balogh, Béla Bollobás, Michael Krivelevich +2

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 Penro…