Related papers: The branching structure of diffusion-limited aggre…
Motivated by theoretical analyses of spatially localized structures with arbitrarily long periodic plateaus, we provide a framework of assumptions that simplifies their analysis and leads to a topological criterion for when localized…
We revisit Kesten's argument for the upper bound on the growth rate of DLA. We are able to make the argument robust enough so that it applies to many graphs, where only control of the heat kernel is required. We apply this to many examples…
We provide a novel family of generative block-models for random graphs that naturally incorporates degree distributions: the block-constrained configuration model. Block-constrained configuration models build on the generalised…
Diffusion models are state-of-the-art tools for various generative tasks. Yet training these models involves estimating high-dimensional score functions, which in principle suffers from the curse of dimensionality. It is therefore important…
We develop a theory for distributed branch points and investigate their role in determining the shape and influencing the mechanics of thin hyperbolic objects. We show that branch points are the natural topological defects in hyperbolic…
We analyze the structure of two dimensional disordered cellular systems generated by extensive computer simulations. These cellular structures are studied as topological trees rooted on a central cell or as closed shells arranged…
We present numerical solution of the chlorine dioxide-iodine-malonic acid reaction-diffusion system in two dimensions in a boundary-fed system using a realistic model. The bifurcation diagram for the transition from non-symmetry breaking…
The theory of patterns formation for a reaction-diffusion system defined on a multiplex is developed by means of a perturbative approach. The intra-layer diffusion constants act as small parameter in the expansion and the unperturbed state…
A directed polymer is allowed to branch, with configurations determined by global energy optimization and disorder. A finite size scaling analysis in 2D shows that, if disorder makes branching more and more favorable, a critical transition…
For $\alpha \in (1,2]$, the $\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\alpha$-dependent power-law tail behavior. It consists of a sequence of compact measured…
In recent decades, it has been emphasized that the evolving structure of networks may be shaped by interaction principles that yield sparse graphs with a vertex degree distribution exhibiting an algebraic tail, and other structural traits…
In close analogy to diffusion limited aggregation (DLA) and inspired by a work of Roux, a random walker algorithm is constructed to solve the problem of crack growth in an elastic medium. In contrast to conventional lattice approaches, the…
We address a three-dimensional, coarse-grained description of dislocation networks at grain boundaries between rotated crystals. The so-called amplitude expansion of the phase-field crystal model is exploited with the aid of finite element…
Granular mixtures frequently segregate by grain size along the axis of partially-filled, horizontal, rotating tubes. When segregation approaches saturation at the surface, a well-defined pattern of bands with wavelength $\lambda$ emerges.…
We investigate the geometric properties of percolation clusters, by studying square-lattice bond percolation on the torus. We show that the density of bridges and nonbridges both tend to 1/4 for large system sizes. Using Monte Carlo…
We introduce a lattice gas model of cluster growth via the diffusive aggregation of particles in a closed system obeying a local, deterministic, microscopically reversible dynamics. This model roughly corresponds to placing the irreversible…
Diffusion models have become a leading framework in generative modeling, yet their theoretical understanding -- especially for high-dimensional data concentrated on low-dimensional structures -- remains incomplete. This paper investigates…
The {\sc Directed Maximum Leaf Out-Branching} problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we improve known parameterized algorithms and…
We consider the following problem in one-dimensional diffusion-limited aggregation (DLA). At time $t$, we have an "aggregate" consisting of $\Bbb{Z}\cap[0,R(t)]$ [with $R(t)$ a positive integer]. We also have $N(i,t)$ particles at $i$,…
The structure-preserving doubling algorithm (SDA) is a fairly efficient method for solving problems closely related to Hamiltonian (or Hamiltonian-like) matrices, such as computing the required solutions to algebraic Riccati equations.…