Related papers: Random Polymers and Generalized Urn Processes
Polymer quantization is a non-standard approach to quantizing a classical system inspired by background independent approaches to quantum gravity such as loop quantum gravity. When applied to field theory it introduces a characteristic…
We present a simple reaction kinetics model to describe the polymer synthesis used by Lusignan et al. (PRE, 60, 5657, 1999) to produce randomly branched polymers in the vulcanization class. Numerical solution of the rate equations gives…
We analyse a preferential urn model with randomness using the replica method. The preferential urn model is a stochastic model based on the concept "the rich get richer." The replica analysis clarifies that the preferential urn model with…
We employ a multiscale approach to model the translocation of biopolymers through nanometer size pores. Our computational scheme combines microscopic Langevin molecular dynamics (MD) with a mesoscopic lattice Boltzmann (LB) method for the…
In this work, we define the notion of unimodular random measured metric spaces as a common generalization of various other notions. This includes the discrete cases like unimodular graphs and stationary point processes, as well as the…
Gaussian random field on general ultrametric space is introduced as a solution of pseudodifferential stochastic equation. Covariation of the introduced random field is computed with the help of wavelet analysis on ultrametric spaces. Notion…
We consider a two-particle quantum systems in a d-dimensional Euclidean space with interaction and in presence of a random external potential (a continuous two-particle Anderson model). We establish Wegner-type estimates (inequalities) for…
Let $Z^1$ and $Z^2$ be partition functions in the random polymer model in the same environment but driven by different underlying random walks. We give a comparison in concave stochastic order between $Z^1$ and $Z^2$ if one of the random…
A notion of random walks for circle packings is introduced. The geometry behind this notion is discussed, together with some applications. In particular, we obtain a short proof of a result regarding the type problem for circle packings,…
We propose a novel characterization method of randomly branched polymers based on the geometrical property of such objects in confined spaces. The central idea is that randomly branched polymers exhibit passing/clogging transition across…
The models surveyed include generalized P\'{o}lya urns, reinforced random walks, interacting urn models, and continuous reinforced processes. Emphasis is on methods and results, with sketches provided of some proofs. Applications are…
We study the autocovariance functions of moving average random fields over the integer lattice $\mathbb{Z}^d$ from an algebraic perspective. These autocovariances are parametrized polynomially by the moving average coefficients, hence…
The paper deals with different properties of polynomials in random elements: bounds for characteristics functionals of polynomials, stochastic generalization of the Vinogradov mean value theorem, characterization problem, bounds for…
Drawing (a multiset of) coloured balls from an urn is one of the most basic models in discrete probability theory. Three modes of drawing are commonly distinguished: multinomial (draw-replace), hypergeometric (draw-delete), and Polya…
Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where…
Random walks with a general, nonlinear barrier have found recent applications ranging from reionization topology to refinements in the excursion set theory of halos. Here, we derive the first-crossing distribution of random walks with a…
Random walks are ubiquitous in the sciences, and they are interesting from both theoretical and practical perspectives. They are one of the most fundamental types of stochastic processes; can be used to model numerous phenomena, including…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
We study the geometry of infinite random Boltzmann planar maps having weight of polynomial decay of order $k^{-2}$ for each vertex of degree $k$. These correspond to the dual of the discrete "stable maps" of Le Gall and Miermont [Scaling…
The random walk to be considered takes place in the d- spherical dual of the group U(n + 1), for a fixed finite dimensional irreducible representation d of U(n). The transition matrix comes from the three term recursion relation satisfied…