English
Related papers

Related papers: Arithmetic area for m planar Brownian paths

200 papers

We consider the number of partitions of $n$ whose Young diagrams fit inside an $m \times \ell$ rectangle; equivalently, we study the coefficients of the $q$-binomial coefficient $\binom{m+\ell}{m}_q$. We obtain sharp asymptotics throughout…

Combinatorics · Mathematics 2019-02-05 Stephen Melczer , Greta Panova , Robin Pemantle

We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…

Statistical Mechanics · Physics 2017-05-24 S. K. Nechaev , M. V. Tamm , O. V. Valba

We establish in this paper the existence of weak solutions of infinite-dimensional shift invariant stochastic differential equations driven by a Brownian term. The drift function is very general, in the sense that it is supposed to be…

Probability · Mathematics 2015-09-01 David Dereudre , Sylvie Roelly

We present some exact expressions for the number of paths of a given length in a perfect $m$-ary tree. We first count the paths in perfect rooted $m$-ary trees and then use the results to determine the number of paths in perfect unrooted…

Combinatorics · Mathematics 2017-11-27 Peter J. Humphries

We consider the following problem: given a program, find tight asymptotic bounds on the values of some variables at the end of the computation (or at any given program point) in terms of its input values. We focus on the case of…

Logic in Computer Science · Computer Science 2023-06-22 A. M. Ben-Amram , G. W. Hamilton

In this letter, we study the open spinning strings and their SYM duals. A new class of folded open spinning strings is found. At planar one-loop level in SYM, by solving the thermodynamic limit of the Bethe ansatz equations for an…

High Energy Physics - Theory · Physics 2009-11-10 Bin Chen , Xiao-Jun Wang , Yong-Shi Wu

This paper contains a partial answer to the open problem 3.11 of \cite{[H2008]}. That is to find an explicit bijection on Schr\"oder paths that inverts the statistics area and bounce. This paper started as an attempt to write the sum over…

Combinatorics · Mathematics 2020-05-29 Nancy Wallace

Some asymptotic properties of a Brownian motion in multifractal time, also called multifractal random walk, are established. We show the almost sure and $L^1$ convergence of its structure function. This is an issue directly connected to the…

Probability · Mathematics 2009-05-22 Laurent Duvernet

We prove an integral formula for the spectral flow of differentiable loops of unitaries of the form ${\rm Id}+$Schatten. Our formula is in terms of a regularised winding number, expressed in terms of exact differential forms, and we show…

Functional Analysis · Mathematics 2026-04-27 A. Alexander , A. Carey , G. Levitina , A. Rennie

We consider one-dimensional Brownian motion conditioned (in a suitable sense) to have a local time at every point and at every moment bounded by some fixed constant. Our main result shows that a phenomenon of entropic repulsion occurs: that…

Probability · Mathematics 2010-04-22 Itai Benjamini , Nathanael Berestycki

Given a compact manifold $X$ with boundary and a submersion $f : X \rightarrow Y$ whose restriction to the boundary of $X$ has isolated critical points with distinct critical values and where $Y$ is $[0,1]$ or $S^1$, the connected…

Algebraic Topology · Mathematics 2020-06-23 Gunnar Carlsson , Benjamin Filippenko

We investigate the sample path properties of Martin-L\"of random Brownian motion. We show (1) that many classical results which are known to hold almost surely hold for every Martin-L\"of random Brownian path, (2) that the effective…

Logic · Mathematics 2014-06-09 Kelty Allen , Laurent Bienvenu , Theodore Slaman

We enumerate the number of monotonic lattice paths starting at $(0,0)$ and terminating at $(m,n)$ in which $l$ of the first $k$ steps lie below the line $y=x\ (0\leq k\leq m\leq n)$. These closed formulas consist of terms which are a…

Combinatorics · Mathematics 2015-08-21 Charles Hoffman , Corey Manack

We study the structure of a uniformly randomly chosen partial order of width 2 on n elements. We show that under the appropriate scaling, the number of incomparable elements converges to the height of a one dimensional Brownian excursion at…

Probability · Mathematics 2013-06-24 Nayantara Bhatnagar , Nick Crawford , Elchanan Mossel , Arnab Sen

Building on previous work by Cameron et al. in [3], we give a recurrence for computing the number of acyclic orientations of complete $k$-partite graphs, which can be implemented to obtain a dynamic programming algorithm running in time…

Combinatorics · Mathematics 2018-08-09 Veselin Blagoev

An overview is presented of recent work on some statistical problems on multiparticle random walks. We consider a Euclidean, deterministic fractal or disordered lattice and N >> 1 independent random walkers initially (t=0) placed onto the…

Statistical Mechanics · Physics 2007-05-23 Luis Acedo , Santos B. Yuste

We introduce and study the random non-compact metric space called the Brownian plane, which is obtained as the scaling limit of the uniform infinite planar quadrangulation. Alternatively, the Brownian plane is identified as the…

Probability · Mathematics 2012-04-27 Nicolas Curien , Jean-François Le Gall

We consider a space-time continuous directed polymer in random environment. The path is Brownian and the medium is Poissonian. We review many results obtained in the last decade, and also we present new ones. In this fundamental setup, we…

Probability · Mathematics 2023-06-21 Francis Comets , Clément Cosco

We give alternate constructions of (i) the scaling limit of the uniform connected graphs with given fixed surplus, and (ii) the continuum random unicellular map (CRUM) of a given genus that start with a suitably tilted Brownian continuum…

Probability · Mathematics 2021-11-17 Grégory Miermont , Sanchayan Sen

In this work we introduce the graph-theoretic notion of mendability: for each locally checkable graph problem we can define its mending radius, which captures the idea of how far one needs to modify a partial solution in order to "patch a…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-09-15 Alkida Balliu , Juho Hirvonen , Darya Melnyk , Dennis Olivetti , Joel Rybicki , Jukka Suomela