English
Related papers

Related papers: Limits of determinantal processes near a tacnode

200 papers

The second part of the paper mainly deals with convergence of infinite determinantal measures, understood as the convergence of the approximating finite determinantal measures. In addition to the usual weak topology on the space of…

Dynamical Systems · Mathematics 2016-10-26 Alexander I. Bufetov

A labelled Markov decision process is a labelled Markov chain with nondeterminism, i.e., together with a strategy a labelled MDP induces a labelled Markov chain. The model is related to interval Markov chains. Motivated by applications of…

Formal Languages and Automata Theory · Computer Science 2020-09-25 Stefan Kiefer , Qiyi Tang

As a fundamental thermodynamic principle, speed limits reveal the lower bound of entropy production (EP) required for a system to transition from a given initial state to a final state. While various speed limits have been developed for…

Statistical Mechanics · Physics 2025-07-08 Sangyun Lee , Jae Sung Lee , Jong-Min Park

We establish a connection between tagged particles and size-biased empirical processes in interacting particle systems, in analogy to classical results on the propagation of chaos. In a mean-field scaling limit, the evolution of the…

Probability · Mathematics 2026-03-03 Angeliki Koutsimpela , Stefan Grosskinsky

The goal of this work is to develop a general theory for non-local singular operators of the type $$ L^{\mathcal{B}}_{\alpha}f(x)=\lim_{\epsilon\to 0} \int_{D,\, |y-x|>\epsilon}\big(f(y)-f(x)\big) \mathcal{B}(x,y)|x-y|^{-d-\alpha}\,dy, $$…

Probability · Mathematics 2024-03-04 Soobin Cho , Panki Kim , Renming Song , Zoran Vondraček

We study normal approximations for a class of discrete-time occupancy processes, namely, Markov chains with transition kernels of product Bernoulli form. This class encompasses numerous models which appear in the complex networks…

Probability · Mathematics 2018-11-13 Liam Hodgkinson , Ross McVinish , Philip K. Pollett

We consider a discrete time semi-Markov process where the characteristics defining the process depend on a small perturbation parameter. It is assumed that the state space consists of one finite communicating class of states and, in…

Probability · Mathematics 2016-03-21 Mikael Petersson

Recently two approximate Newton methods were proposed for the optimisation of Markov Decision Processes. While these methods were shown to have desirable properties, such as a guarantee that the preconditioner is negative-semidefinite when…

Optimization and Control · Mathematics 2015-08-05 Thomas Furmston , Guy Lever

Continuous-time Mallows processes are processes of random permutations of the set $\{1, \ldots, n\}$ whose marginal at time $t$ is the Mallows distribution with parameter $t$. Recently Corsini showed that there exists a unique Markov…

Probability · Mathematics 2024-04-15 Radosław Adamczak , Michał Kotowski

Motivated by applications to COVID dynamics, we describe a branching process in random environments model $\{Z_n\}$ whose characteristics change when crossing upper and lower thresholds. This introduces a cyclical path behavior involving…

Probability · Mathematics 2026-01-14 Giacomo Francisci , Anand N. Vidyashankar

We construct marked Gibbs point processes in $\mathbb{R}^d$ under quite general assumptions. Firstly, we allow for interaction functionals that may be unbounded and whose range is not assumed to be uniformly bounded. Indeed, our typical…

Probability · Mathematics 2022-07-15 Sylvie Roelly , Alexander Zass

Occupancy processes are a broad class of discrete time Markov chains on $\{0,1\}^{n}$ encompassing models from diverse areas. This model is compared to a collection of $n$ independent Markov chains on $\{0,1\}$, which we call the…

Probability · Mathematics 2025-12-09 Ross McVinish

We give a short overview of recent results on a specific class of Markov process: the Piecewise Deterministic Markov Processes (PDMPs). We first recall the definition of these processes and give some general results. On more specific cases…

Statistics Theory · Mathematics 2013-09-25 Romain Azaïs , Jean-Baptiste Bardet , Alexandre Genadot , Nathalie Krell , Pierre-André Zitt

A simple lemma bounds $\mathrm{s.d.}(T)/\mathbb{E} T$ for hitting times $T$ in Markov chains with a certain strong monotonicity property. We show how this lemma may be applied to several increasing set-valued processes. Our main result…

Probability · Mathematics 2016-04-22 David J. Aldous

When modelling metapopulation dynamics, the influence of a single patch on the metapopulation depends on the number of individuals in the patch. Since there is usually no obvious natural upper limit on the number of individuals in a patch,…

Probability · Mathematics 2012-01-27 A. D. Barbour , M. J. Luczak

Define the scaled empirical point process on an independent and identically distributed sequence $\{Y_i: i\le n\}$ as the random point measure with masses at $a_n^{-1} Y_i$. For suitable $a_n$ we obtain the weak limit of these point…

Probability · Mathematics 2016-08-16 André Dabrowski , Gail Ivanoof , Rafal Kulik

In the investigation of limits of Markov chains, the presence of states which become instantaneous states in the limit may prevent the convergence of the chain in the Skorohod topology. We present in this article a weaker topology adapted…

Probability · Mathematics 2014-08-29 C. Landim

An infinite system of point particles placed in $\mathds{R}^d$ is studied. The particles are of two types; they perform random walks in the course of which those of distinct types repel each other. The interaction of this kind induces an…

Probability · Mathematics 2022-07-18 Yuri Kozitsky , Michael Röckner

We examine a discrete-time Markovian particle system on the quarter-plane introduced by M. Defosseux. The vertical boundary acts as a reflecting wall. The particle system lies in the Anisotropic Kardar-Parisi-Zhang with a wall universality…

Probability · Mathematics 2016-04-26 Jeffrey Kuan

We consider Markov decision processes with synchronizing objectives, which require that a probability mass of $1-\epsilon$ accumulates in a designated set of target states, either once, always, infinitely often, or always from some point…

Logic in Computer Science · Computer Science 2022-04-28 Laurent Doyen , Marie van den Bogaard
‹ Prev 1 3 4 5 6 7 10 Next ›