Related papers: An exactly solvable continuous-time Derrida--Retau…
We study maximal clades in random phylogenetic trees with the Yule-Harding model or, equivalently, in binary search trees. We use probabilistic methods to reprove and extend earlier results on moment asymptotics and asymptotic normality. In…
In the Constrained-degree percolation model on a graph $(\mathbb{V},\mathbb{E})$ there are a sequence, $(U_e)_{e\in\mathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open…
In topological insulators and topological superconductors, the discrete jump of the topological invariant upon tuning a certain system parameter defines a topological phase transition. A unified framework is employed to address the quantum…
Drift analysis aims at translating the expected progress of an evolutionary algorithm (or more generally, a random process) into a probabilistic guarantee on its run time (hitting time). So far, drift arguments have been successfully…
We consider the model of random trees introduced by Devroye [SIAM J. Comput. 28 (1999) 409-432]. The model encompasses many important randomized algorithms and data structures. The pieces of data (items) are stored in a randomized fashion…
We consider a random process on recursive trees, with three types of events. Vertices give birth at a constant rate (growth), each edge may be removed independently (fragmentation of the tree) and clusters (or trees) are frozen with a rate…
Undulation of infection levels, usually called waves, are not well understood. In this paper we propose a mathematical model that exhibits undulation and decay towards a stable state. The model is a re-interpretation of the original…
We study the phases of an exactly solvable one dimensional model with $4-$dimensional $\Gamma-$matrix degrees of freedom on each site. The $\Gamma-$matrix model has a large set of competing interactions and displays a rich phase diagram…
By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a…
With histograms as its foundation, we develop Categorical Exploratory Data Analysis (CEDA) under the extreme-$K$ sample problem, and illustrate its universal applicability through four 1D categorical datasets. Given a sizable $K$, CEDA's…
This paper considers synchronous discrete-time dynamical systems on graphs based on the threshold model. It is well known that after a finite number of rounds these systems either reach a fixed point or enter a 2-cycle. The problem of…
The ability to understand and solve high-dimensional inference problems is essential for modern data science. This article examines high-dimensional inference problems through the lens of information theory and focuses on the standard…
We derive a system of fixed-point equations for the equilibrium transfers in a class of one-to-one matching models with linear transferable utility. We then show that, when the degree of substitution between alternatives is bounded from…
The automatic generation of decision trees based on off-line reasoning on models of a domain is a reasonable compromise between the advantages of using a model-based approach in technical domains and the constraints imposed by embedded…
Trees are fundamental data structure for many areas of computer science and system engineering. In this report, we show how to ensure eventual consistency of optimistically replicated trees. In optimistic replication, the different replicas…
The framework of this article is cell motility modeling. Approximating cells as rigid spheres we take into account for both non-penetration and adhesions forces. Adhesions are modeled as a memory-like microscopic elastic forces. This leads…
We consider linear dynamical systems under floating-point rounding. In these systems, a matrix is repeatedly applied to a vector, but the numbers are rounded into floating-point representation after each step (i.e., stored as a…
We show by extensive simulations that the whole supercritical phase of the three-dimensional uniform forest model simultaneously exhibits an infinite tree and a rich variety of critical phenomena. Besides typical scalings like algebraically…
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic has to be expressive enough to allow the formalization of…
Recently, the number of non-standard percolation models has proliferated. In all these models, there exists a phase transition at which long range connectivity is established, if local connectedness increases through a threshold $p_c$. In…