Related papers: New Algorithm for Parallel Laplacian Growth by Ite…
The method of iterated conformal maps for the study of Diffusion Limited Aggregates (DLA) is generalized to the study of Laplacian Growth Patterns and related processes. We emphasize the fundamental difference between these processes: DLA…
A first-principles statistical theory is constructed for the evolution of two dimensional interfaces in Laplacian fields. The aim is to predict the pattern that the growth evolves into, whether it becomes fractal and if so the…
Many models of fractal growth patterns (like Diffusion Limited Aggregation and Dielectric Breakdown Models) combine complex geometry with randomness; this double difficulty is a stumbling block to their elucidation. In this paper we…
Graphs with diverse structural characteristics play a central role in modelling and optimization tasks. The ability to generate different types of graphs that exhibit shared properties is likewise essential for algorithm selection and…
It had been conjectured that Diffusion Limited Aggregates and Laplacian Growth patterns (with small surface tension) are in the same universality class. Using iterated conformal maps we construct a 1-parameter family of fractal growth…
We study the fractal and multifractal properties (i.e. the generalized dimensions of the harmonic measure) of a 2-parameter family of growth patterns that result from a growth model that interpolates between Diffusion Limited Aggregation…
Conformal mapping models are used to study competition of noise and anisotropy in Laplacian growth. For that, a new family of models is introduced with the noise level and directional anisotropy controlled independently. Fractalization is…
A new model of Laplacian stochastic growth is formulated using conformal mappings. The model describes two growth regimes, stable and turbulent, separated by a sharp phase transition. The first few Fourier components of the mapping define…
We propose an efficient and robust iterative solution to the multi-object matching problem. We first clarify serious limitations of current methods as well as the inappropriateness of the standard iteratively reweighted least squares…
We construct a family of birational maps acting on two dimensional projective varieties, for which the growth of the degrees of the iterates is cubic. It is known that this growth can be bounded, linear, quadratic or exponential for such…
We consider the set of all 2-step recurrences (difference equations) that are given by linear fractional maps. These give birational maps of the plane. We determine the degree growth of these birational maps. We find the all the maps in…
We investigate the iterative construction of discrete Laplacians on 2D square lattices, revealing emergent fractal-like patterns shaped by modular arithmetic. While classical 2222-style iterations reproduce known structures such as the…
In this paper, we present Laplacian multiscale flow matching (LapFlow), a novel framework that enhances flow matching by leveraging multi-scale representations for image generative modeling. Our approach decomposes images into Laplacian…
This paper proposes a methodology for the automated construction of rectangular floorplans (RFPs) while addressing dimensional constraints and adjacency relations. Here, adjacency relations are taken in the form of a dimensionless…
Laplacian growth is the study of interfaces that move in proportion to harmonic measure. Physically, it arises in fluid flow and electrical problems involving a moving boundary. We survey progress over the last decade on discrete models of…
The general equations of motion for two dimensional Laplacian growth are derived using the conformal mapping method. In the singular case, all singularities of the conformal map are on the unit circle, and the map is a degenerate…
Time-dependent conformal maps are used to model a class of growth phenomena limited by coupled non-Laplacian transport processes, such as nonlinear diffusion, advection, and electro-migration. Both continuous and stochastic dynamics are…
While topological data analysis has emerged as a powerful paradigm for structural inference, its foundational tools, notably persistent homology and the persistent Laplacian, are frequently insensitive to localized structural fluctuations…
Evolutionary Algorithms are naturally inspired approximation optimisation algorithms that usually interfere with science problems when common mathematical methods are unable to provide a good solution or finding the exact solution requires…
The partial Latin square extension problem is to fill as many as possible empty cells of a partially filled Latin square. This problem is a useful model for a wide range of applications in diverse domains. This paper presents the first…