40 citations · 60 across the 15 of their papers we have counts for
20 papers
On the largest common subtree of uniform attachment trees
Johannes Bäumler, Céline Kerriou, Bas Lodewijks +4
We study the largest common subtree of two independent unlabeled uniform attachment trees (also known as random recursive trees). Our main result shows that, when the two trees hav…
High-degree vertices in uniform recursive directed acyclic graphs with freezing
Rafael Engel, Bas Lodewijks
We study uniform recursive directed acyclic graphs with freezing. Here, a graph is built by adding vertices one-by-one and connecting a new vertex to uniformly sele…
On the depth of depth-weighted trees
Lyuben Lichev, Amitai Linker, Bas Lodewijks +1
The depth-weighted tree DWT() with weight function is a dynamic random tree grown from a root where vertices arrive consecutively and ever…
Local criteria for global connectivity comparisons: beyond stochastic domination
Johannes Bäumler, Benedikt Jahnel, Jonas Köppl +3
We introduce a site-wise domination criterion for local percolation models, which enables the comparison of one-arm probabilities even in the absence of stochastic domination. The…
Preferential Attachment Trees with Vertex Death: Persistence of the Maximum Degree
Bas Lodewijks
We consider an evolving random discrete tree model called Preferential Attachment with Vertex Death, as introduced by Deijfen. Initialised with an alive root labelled , at each…
Preferential Attachment Trees with Vertex Death: Lack of Persistence of the Maximum Degree
Markus Heydenreich, Bas Lodewijks
We consider an evolving random discrete tree model called Preferential Attachment with Vertex Death, as introduced by Deijfen. Initialised with an alive root labelled , at each…
A star is born: Explosive Crump-Mode-Jagers branching processes
Bas Lodewijks
We study a family of Crump--Mode--Jagers branching processes in random environment that explode, i.e. that grow infinitely large in finite time with positive probability. Building…
Long-range competition on the torus
Bas Lodewijks, Neeladri Maitra
We study competition between two growth models with long-range correlations on the torus of size in dimension . We append the edge set of the torus $\mathbb…
On the structure of genealogical trees associated with explosive Crump-Mode-Jagers branching processes
Tejas Iyer, Bas Lodewijks
We study the structure of genealogical trees associated with explosive Crump-Mode-Jagers branching processes (stopped at the explosion time), proving criteria for the associated tr…
Long-range first-passage percolation on the torus
Remco van der Hofstad, Bas Lodewijks
We study a geometric version of first-passage percolation on the complete graph, known as long-range first-passage percolation. Here, the vertices of the complete graph $\mathcal K…
Percolation in lattice -neighbor graphs
Benedikt Jahnel, Jonas Köppl, Bas Lodewijks +1
We define a random graph obtained via connecting each point of independently to a fixed number of its nearest neighbors via a directed edge. We ca…
Dynamic random graphs with vertex removal
Josep Díaz, Lyuben Lichev, Bas Lodewijks
We introduce and analyse a Dynamic Random Graph with Vertex Removal (DRGVR) defined as follows. At every step, with probability a new vertex is introduced, and with proba…
On the first and second largest components in the percolated Random Geometric Graph
Lyuben Lichev, Bas Lodewijks, Dieter Mitsche +1
The percolated random geometric graph has vertex set given by a Poisson Point Process in the square , and every pair of vertices at distance at most 1 i…
On joint properties of vertices with a given degree or label in the random recursive tree
Bas Lodewijks
In this paper, we study the joint behaviour of the degree, depth and label of and graph distance between high-degree vertices in the random recursive tree. We generalise the result…
The location of high-degree vertices in weighted recursive graphs with bounded random weights
Bas Lodewijks
We study the asymptotic growth rate of the label size of high-degree vertices in weighted recursive graphs (WRG) when the weights are i.i.d. almost surely bounded random variables,…
Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights
Laura Eslava, Bas Lodewijks, Marcel Ortgiese
A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its…
The maximal degree in random recursive graphs with random weights
Bas Lodewijks, Marcel Ortgiese
We study a generalisation of the random recursive tree (RRT) model and its multigraph counterpart, the uniform directed acyclic graph (DAG). Here, vertices are equipped with a rand…
A phase transition for preferential attachment models with additive fitness
Bas Lodewijks, Marcel Ortgiese
Preferential attachment models form a popular class of growing networks, where incoming vertices are preferably connected to vertices with high degree. We consider a variant of thi…
Mapping NP-hard and NP-complete optimisation problems to Quadratic Unconstrained Binary Optimisation problems
Bas Lodewijks
We discuss several mappings from well-known NP-hard problems to Quadratic Unconstrained Binary Optimisation problems which are treated incorrectly by Lucas. We provide counterexamp…
Explosion in weighted Hyperbolic Random Graphs and Geometric Inhomogeneous Random Graphs
Júlia Komjáthy, Bas Lodewijks
In this paper we study weighted distances in scale-free spatial network models: hyperbolic random graphs (HRG), geometric inhomogeneous random graphs (GIRG) and scale-free percolat…