Related papers: Random Growth Models
This habilitation thesis summarizes the research that I have carried out from 2005 to 2019. It is organized in four chapters. The first three deal with random planar maps. Chapter 1 is about their metric properties: from a general…
In recent years, random matrices have come to play a major role in computational mathematics, but most of the classical areas of random matrix theory remain the province of experts. Over the last decade, with the advent of matrix…
For one-dimensional growth processes we consider the distribution of the height above a given point of the substrate and study its scale invariance in the limit of large times. We argue that for self-similar growth from a single seed the…
Language models famously improve under a smooth scaling law, but some specific capabilities exhibit sudden breakthroughs in performance. Advocates of "emergence" view these capabilities as unlocked at a specific scale, but others attribute…
A dynamic model for a random network evolving in continuous time is defined where new vertices are born and existing vertices may die. The fitness of a vertex is defined as the accumulated in-degree of the vertex and a new vertex is…
We construct a stationary random tree, embedded in the upper half plane, with prescribed offspring distribution and whose vertices are the atoms of a unit Poisson point process. This process which we call Hammersley's tree process extends…
A new model for biological growth is introduced that couples the geometry of an organism (or part of the organism) to the flow and deposition of material. The model has three dynamical variables (a) a Riemann metric tensor for the geometry,…
The random matrix uniformly distributed over the set of all m-by-n matrices over a finite field plays an important role in many branches of information theory. In this paper a generalization of this random matrix, called k-good random…
In an early paper (Horowitz and Albano, Phys. Rev. E.,{\bf 73} 031111 (2006)) we studied growing models, generically called $X/RD$, such that a particle is attached to the aggregate with probability $p$ following the mechanisms of a generic…
Networks are a powerful abstraction with applicability to a variety of scientific fields. Models explaining their morphology and growth processes permit a wide range of phenomena to be more systematically analysed and understood. At the…
This is a review of the Riemann-Hilbert approach to the large $N$ asymptotics in random matrix models and its applications. We discuss the following topics: random matrix models and orthogonal polynomials, the Riemann-Hilbert approach to…
Finding the most powerful node in a dynamic random network, the largest set in a partition-valued stochastic process, or the largest family in an evolving population at a given time, can be a very difficult problem. This is particularly the…
It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in…
We describe how graphical Markov models started to emerge in the last 40 years, based on three essential concepts that had been developed independently more than a century ago. Sequences of joint or single regressions and their regression…
There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…
We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree. We take such connectivity to be induced by the…
We investigate joint spectral characteristics of a family of matrices $\mathcal F $, associated with products in the semigroup generated by $\mathcal F$. In the literature, extremal measures such as the well-known joint spectral radius and…
The dynamics of complex systems in nature often occurs in terms of punctuations, or avalanches, rather than following a smooth, gradual path. A comprehensive theory of avalanche dynamics in models of growth, interface depinning, and…
We introduce a model for a growing random graph based on simultaneous reproduction of the vertices. The model can be thought of as a generalisation of the reproducing graphs of Southwell and Cannings and Bonato et al to allow for a random…
First we survey generating function methods for obtaining useful probability estimates about random matrices in the finite classical groups. Then we describe a probabilistic picture of conjugacy classes which is coherent and beautiful.…