相关论文: Meanders: A Direct Enumeration Approach
In this paper, we construct families of polynomials defined by recurrence relations related to mean-zero random walks. We show these families of polynomials can be used to approximate $z^n$ by a polynomial of degree $\sim \sqrt{n}$ in…
Nonintersecting Brownian bridges on the unit circle form a determinantal stochastic process exhibiting random matrix statistics for large numbers of walkers. We investigate the effect of adding a drift term to walkers on the circle…
Connecting optimal transport and variational inference, we present a principled and systematic framework for sampling and generative modelling centred around divergences on path space. Our work culminates in the development of the…
What does a typical road network look like? Existing generative models tend to focus on one aspect to the exclusion of others. We introduce the general-purpose \emph{quadtree model} and analyze its shortest paths and maximum flow.
We study the passage (translocation) of a self-avoiding polymer through a membrane pore in two dimensions. In particular, we numerically measure the probability distribution Q(T) of the translocation time T, and the distribution P(s,t) of…
Connectivity is a fundamental structural feature of a network that determines the outcome of any dynamics that happens on top of it. However, an analytical approach to obtain connection probabilities between nodes associated to paths of…
Up-down permutations are counted by tangent resp. secant numbers. Considering words instead, where the letters are produced by independent geometric distributions, there are several ways of introducing this concept; in the limit they all…
One way to analyze complicated non-autonomous flows is through trying to understand their transport behavior. In a quantitative, set-oriented approach to transport and mixing, finite time coherent sets play an important role. These are…
We introduce a cellular automaton model coupled with a transport equation for flows on graphs. The direction of the flow is described by a switching process where the switching probability dynamically changes according to the value of the…
In this article we study a \emph{non-directed} polymer model in dimension $d\ge 2$: we consider a simple symmetric random walk on $\mathbb{Z}^d$ which interacts with a random environment, represented by i.i.d. random variables…
We construct a one-parameter family of singly periodic translating solutions to mean curvature flow that converge as the period tends to $0$ to the union of a grim reaper surface and a plane that bisects it lengthwise. The surfaces are…
In the broadcasting problem on trees, a $\{-1,1\}$-message originating in an unknown node is passed along the tree with a certain error probability $q$. The goal is to estimate the original message without knowing the order in which the…
We apply to the $n\times n$ chessboard the counting theory from Part I for nonattacking placements of chess pieces with unbounded straight-line moves, such as the queen. Part I showed that the number of ways to place $q$ identical…
We study the directed polymer model for general graphs (beyond $\mathbb Z^d$) and random walks. We provide sufficient conditions for the existence or non-existence of a weak disorder phase, of an $L^2$ region, and of very strong disorder,…
This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks in the quarter plane are characterized by the fact that the one-step transition probabilities…
Common meadows are commutative and associative algebraic structures with two operations (addition and multiplication) with additive and multiplicative identities and for which inverses are total. The inverse of zero is an error term…
The theory of q-analogs develops many combinatorial formulas for finite vector spaces over a finite field with q elements--all in analogy with formulas for finite sets (which are the special case of q=1). A direct-sum decomposition of a…
Active walker models have proved to be extremely effective in understanding the evolution of a large class of systems in biology like ant trail formation and pedestrian trails. We propose a simple model of a random walker which modifies its…
Motivated by an investigation of ground state properties of randomly charged polymers, we discuss the size distribution of the largest Q-segments (segments with total charge Q) in such N-mers. Upon mapping the charge sequence to…
We introduce a general formulation for an implicit equation-free method in the setting of slow-fast systems. First, we give a rigorous convergence result for equation-free analysis showing that the implicitly defined coarse-level time…