Related papers: The exploration process of critical Boltzmann plan…
We study the Boltzmann-Langevin equation which describes the dynamics of hot Yang-Mills fields with typical momenta of order of the magnetic screening scale g^2 T. It is transformed into a path integral and Feynman rules are obtained. We…
We study the Temporal Exploration problem, where an agent must visit all vertices of a temporal graph while traversing at most one available edge per time step. Unlike static graphs, which can be explored in linear time, temporal…
Given $n$ points in the plane, a \emph{covering path} is a polygonal path that visits all the points. If no three points are collinear, every covering path requires at least $n/2$ segments, and $n-1$ straight line segments obviously suffice…
In this paper we consider a Boltzmann-type kinetic description of Follow-the-Leader traffic dynamics and we study the resulting asymptotic distributions, namely the counterpart of the Maxwellian distribution of the classical kinetic theory.…
We develop a new framework that extends the quantum walk framework of Magniez, Nayak, Roland, and Santha, by utilizing the idea of quantum data structures to construct an efficient method of nesting quantum walks. Surprisingly, only…
We extend Smirnov's proof of the existence and conformal invariance of the scaling limit of critical site-percolation on the triangular lattice to particular sequences of periodic graphs with more arbitrary large-scale structure, obtained…
Let $\left\{ Z_{n},n=0,1,2,...\right\} $ be a critical branching process in i.i.d. random environment, $Z_{r,n}$ be the number of particles in the process at moment $0\leq r\leq n-1$ that have a positive number of descendants in generation…
A colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the second half. We show that planar graphs have nonrepetitive…
Lattice field theories are fundamental testbeds for computational physics; yet, sampling their Boltzmann distributions remains challenging due to multimodality and long-range correlations. While normalizing flows offer a promising…
Existing measures of bipartite nonclassical correlation that is typically characterized by nonvanishing nonlocalizable information under the zero-way CLOCC protocol are expensive in computational cost. We define and evaluate economical…
The configuration model is a sequence of random graphs constructed such that in the large network limit the degree distribution converges to a pre-specified probability distribution. The component structure of such random graphs can be…
The talk presented at ICMP 97 focused on the scaling limits of critical percolation models, and some other systems whose salient features can be described by collections of random lines. In the scaling limit we keep track of features seen…
Random non-commutative geometries are a novel approach to taking a non-perturbative path integral over geometries. They were introduced in arxiv.org/abs/1510.01377, where a first examination was performed. During this examination we found…
The continuous-time random walk is defined as a Poissonization of discrete-time random walk. We study the noncolliding system of continuous-time simple and symmetric random walks on ${\mathbb{Z}}$. We show that the system is determinantal…
Edgeworth expansions for random walks on covering graphs with groups of polynomial volume growths are obtained under a few natural assumptions. The coefficients appearing in this expansion depends on not only geometric features of the…
A finite element framework is presented for the analysis of crack-tip phenomena in an elastic material containing a single edge crack under compressive loading. The mechanical response of the material is modeled by a nonlinear constitutive…
By constructing jointly a random graph and an associated exploration process, we define the dynamics of a "parking process" on a class of uniform random graphs as a measure-valued Markov process, representing the empirical degree…
We construct and study the conformal loop ensembles CLE(kappa), defined for all kappa between 8/3 and 8, using branching variants of SLE(kappa) called exploration trees. The conformal loop ensembles are random collections of countably many…
Recent works have shown that random triangulations decorated by critical ($p=1/2$) Bernoulli site percolation converge in the scaling limit to a $\sqrt{8/3}$-Liouville quantum gravity (LQG) surface (equivalently, a Brownian surface)…
We consider the $N$-particle noncolliding Bernoulli random walk --- a discrete time Markov process in $\mathbb{Z}^{N}$ obtained from a collection of $N$ independent simple random walks with steps $\in\{0,1\}$ by conditioning that they never…