相关论文: Analyzing Ta-Shma's Code via the Expander Mixing L…

A popular method for sampling from high-dimensional distributions is the \emph{Gibbs sampler}, which iteratively resamples sites from the conditional distribution of the desired measure given the values of the other coordinates. It is…

We consider supercritical branching random walks on transitive graphs and we prove a law of large numbers for the mean displacement of the ensemble of particles, and a Stam-type central limit theorem for the empirical distributions, thus…

For certain materials science scenarios arising in rubber technology, one-dimensional moving boundary problems (MBPs) with kinetic boundary conditions are capable of unveiling the large-time behavior of the diffusants penetration front,…

We provide a unified framework to compute the stationary distribution of any finite irreducible Markov chain or equivalently of any irreducible random walk on a finite semigroup $S$. Our methods use geometric finite semigroup theory via the…

This paper introduces new constructions of sum-rank metric codes derived from algebraic function fields, as existing results on such codes remain limited. A major challenge lies in the determination of their parameters. We address this…

The scaling and mass expansion (shortly 'sm-expansion') is a new axiom for causal perturbation theory, which is a stronger version of a frequently used renormalization condition in terms of Steinmann's scaling degree. If one quantizes the…

We study set systems formed by neighborhoods in graphs of bounded twin-width. We start by proving that such graphs have linear neighborhood complexity, in analogy to previous results concerning graphs from classes with bounded expansion and…

We investigate the ground states of spin-$S$ Kitaev ladders using exact analytical solutions (for $S = 1/2$), perturbation theory, and the density matrix renormalization group (DMRG) method. We find an even-odd effect: in the case of…

We consider a system consisting of a planar random walk on a square lattice, submitted to stochastic elementary local deformations. Depending on the deformation transition rates, and specifically on a parameter $\eta$ which breaks the…

The Smatch metric is a popular method for evaluating graph distances, as is necessary, for instance, to assess the performance of semantic graph parsing systems. However, we observe some issues in the metric that jeopardize meaningful…

We prove an upper bound for the $\varepsilon$-mixing time of the symmetric exclusion process on any graph G, with any feasible number of particles. Our estimate is proportional to $\mathsf{T}_{\mathsf{RW}(G)}\ln(|V|/\varepsilon)$, where |V|…

We discuss numerical approximation methods for Random Time Change equations which possess a deterministic drift part and jump with state-dependent rates. It is first established that solutions to such equations are versions of certain…

We consider a stochastic directed graph on the integers whereby a directed edge between $i$ and a larger integer $j$ exists with probability $p_{j-i}$ depending solely on the distance between the two integers. Under broad conditions, we…

We study an extended dynamical system on the non-negative real line with piecewise linear non-uniformly expanding local dynamics. With a uniformly distributed initial state, the distribution of successive states coincides with that of a…

We study random walk with adaptive move strategies on a class of directed graphs with variable wiring diagram. The graphs are grown from the evolution rules compatible with the dynamics of the world-wide Web [Tadi\'c, Physica A {\bf 293},…

The continuous-time quantum walk on the underlying graphs of association schemes have been studied, via the algebraic combinatorics structures of association schemes, namely semi-simple modules of their Bose-Mesner and (reference state…

We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…

This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…

The main goal of this paper is to determine the Poisson boundary of lamplighter random walks over a general class of discrete groups $\Gamma$ endowed with a rich boundary. The starting point is the Strip Criterion of identification of the…

Guided by the theory of graph limits, we investigate a variant of the cut metric for limit objects of sequences of discrete probability distributions. Apart from establishing basic results, we introduce a natural operation called {\em…