Related papers: Random surface growth and Karlin-McGregor polynomi…

While modern representation learning relies heavily on global error signals, decentralized algorithms driven by local interactions offer a fundamental distributed alternative. However, the macroscopic convergence properties of these…

In this paper we extend the results of the research started by the first author, in which Karlin-McGregor diagonalization of certain reversible Markov chains over countably infinite general state spaces by orthogonal polynomials was used to…

In their seminal paper introducing the theory of random graphs, Erd\H{o}s and R\'{e}nyi considered the evolution of the structure of a random subgraph of $K_n$ as the density increases from $0$ to $1$, identifying two key points in this…

We compute averages of products and ratios of characteristic polynomials associated with Orthogonal, Unitary, and Symplectic Ensembles of Random Matrix Theory. The pfaffian/determinantal formulas for these averages are obtained, and the…

We consider a continuous time Markov process on $\mathbb{N}_0$ which can be interpreted as generalized alternating birth-death process in a non-autonomous random environment. Depending on the status of the environment the process either…

A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neighbors being connected). Existing models of large graphs…

Expanding upon the rich history of algebraic techniques in probability, we show the existence of and construct a Markov chain using the Hopf square map on a quantum group that is both non-commutative and non-cocommutative. This extends the…

A Markov evolution of a system of point particles in $\mathbb{R}^d$ is described at micro-and mesoscopic levels. The particles reproduce themselves at distant points (dispersal) and die, independently and under the influence of each other…

We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time…

Intermittent maps of Pomeau-Manneville type are well-studied in one-dimension, and also in higher dimensions if the map happens to be Markov. In general, the nonconformality of multidimensional intermittent maps represents a challenge that…

Based on the framework of Plamen Iliev, multivariate Meixner polynomials are constructed explicitly as Birth and Death polynomials. They form the complete set of eigenpolynomials of a birth and death process with the birth and death rates…

Let X be a locally finite, connected graph without vertices of degree 1. Non-backtracking random walk moves at each step with equal probability to one of the "forward" neighbours of the actual state, i.e., it does not go back along the…

A new semianalytical model that explains the formation and sizes of the 'great walls' - the largest structures observed in the universe is suggested. Although the basis of the model is the Zel'dovich approximation it has been used in a new…

We introduce a one-dimensional stochastic system where particles perform independent diffusions and interact through pairwise coagulation events, which occur at a nontrivial rate upon collision. Under appropriate conditions on the diffusion…

We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in combinatorial probability and can be thought of…

A general theory is developed to study individual based models which are discrete in time. We begin by constructing a Markov chain model that converges to a one-dimensional map in the infinite population limit. Stochastic fluctuations are…

Simple random coverage models, well studied in Euclidean space, can also be defined on a general compact metric space. By analogy with the geometric models, and with the discrete coupon collector's problem and with cover times for finite…

Passive random walker dynamics is introduced on a growing surface. The walker is designed to drift upward or downward and then follow specific topological features, such as hill tops or valley bottoms, of the fluctuating surface. The…

Diaconis and Griffiths (2014) study the multivariate Krawtchouk polynomials orthogonal on the multinomial distribution. In this paper we derive the reproducing kernel orthogonal polynomials Q_n(x,y};N,p) on the multinomial distribution…

We consider a nonlinear coupled discrete-time model of population dynamics. This model describes the movement of populations within a heterogeneous landscape, where the growth of subpopulations are modelled by (possibly different) bounded…