Related papers: Random surface growth and Karlin-McGregor polynomi…
We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…
The recently found hypergeometric multiple orthogonal polynomials on the step-line by Lima and Loureiro are shown to be random walk polynomials. It is proven that the corresponding Jacobi matrix and its transpose, which are nonnegative…
We consider a stochastic spatial point process with births and deaths on $\mathbb{R}^d$, with the hard-core property that at any time the balls of radius half of any two points do not overlap. We give explicit construction of the process.…
The Lagrangian approach is natural to study issues of turbulent dispersion and mixing. We propose in this work a general Lagrangian stochastic model including velocity and acceleration as dynamical variables for inhomogeneous turbulent…
We introduce a space inhomogeneous generalization of the dynamics on interlacing arrays considered by Borodin and Ferrari. We show that for a certain class of initial conditions the point process associated to the dynamics has determinantal…
About two dozens of exactly solvable Markov chains on one-dimensional finite and semi-infinite integer lattices are constructed in terms of convolutions of orthogonality measures of the Krawtchouk, Hahn, Meixner, Charlier, $q$-Hahn,…
In this work, we study a family of random geometric graphs on hyperbolic spaces. In this setting, N points are chosen randomly on a hyperbolic space and any two of them are joined by an edge with probability that depends on their hyperbolic…
The generating function that records the sizes of directed circuit partitions of a connected 2-in, 2-out digraph D can be determined from the interlacement graph of D with respect to a directed Euler circuit; the same is true of the…
This paper aims to clarify certain aspects of the relations between birth-death processes, measures solving a Stieltjes moment problem, and sets of parameters defining polynomial sequences that are orthogonal with respect to such a measure.…
We consider an infinite locally finite system (configuration) $\gamma$ of particles distributed over a Euclidean space $X$. Each particle located at $x\in X$ carries an internal parameter (mark, or ``spin'') $\sigma_{x}\in S=\mathbb{R}.$…
Multivariate Krawtchouk polynomials are constructed explicitly as Birth and Death polynomials, which have the nearest neighbour interactions. They form the complete set of eigenpolynomials of a birth and death process with the birth and…
The far-from-equilibrium dynamics of glassy systems share important phenomenological traits. A transition is generally observed from a time-homogeneous dynamical regime to an aging regime where physical changes occur intermittently and, on…
We use persistent homology to build a quantitative understanding of large complex systems that are driven far-from-equilibrium; in particular, we analyze image time series of flow field patterns from numerical simulations of two important…
We introduce a novel stochastic growth process, the record-driven growth process, which originates from the analysis of a class of growing networks in a universal limiting regime. Nodes are added one by one to a network, each node…
In this paper we introduce a model of spatial network growth in which nodes are placed at randomly selected locations on a unit square in $\mathbb{R}^2$, forming new connections to old nodes subject to the constraint that edges do not…
We consider symmetric partial exclusion and inclusion processes in a general graph in contact with reservoirs, where we allow both for edge disorder and well-chosen site disorder. We extend the classical dualities to this context and then…
This paper introduces graphemes for constructing and analyzing stochastic processes that describe the evolution of large dynamic graphs. Unlike graphons, which capture the static properties of dense graphs via exchangeability or subgraph…
We address a question of Grigorchuk by providing both a system of recursive formulas and an asymptotic result for the portrait growth of the first Grigorchuk group. The results are obtained through analysis of some features of the branching…
In a seminal paper in 2009, Borcea, Br\"and\'en, and Liggett described the connection between probability distributions and the geometry of their generating polynomials. Namely, they characterized that stable generating polynomials…
This paper studies birth and death processes in interactive random environments where the birth and death rates and the dynamics of the state of the environment are dependent on each other. Two models of a random environment are considered:…