Related papers: Intersection local times for interlacements

In this note we explain two transitions known for moment generating functions of local times by means of properties of the renewal measure of a related renewal equation. The arguments simplify and strengthen results on the asymptotic…

In [Phys. Rev. A 69, 022316 (2004)] we presented a description of the action of local Clifford operations on graph states in terms of a graph transformation rule, known in graph theory as \emph{local complementation}. It was shown that two…

We develop the methodology of positioning graph vertices relative to each other to solve the problem of determining isomorphism of two undirected graphs. Based on the position of the vertex in one of the graphs, it is determined the…

We find the total variation mixing time of the interchange process on the dumbbell graph (two complete graphs, $K_n$ and $K_m$, connected by a single edge), and show that this sequence of chains exhibits the cutoff phenomenon precisely when…

Let $\mathcal{V}$ and $\mathcal{U}$ be the point sets of two independent homogeneous Poisson processes on $\mathbb{R}^d$. A graph $\mathcal{G}_\mathcal{V}$ with vertex set $\mathcal{V}$ is constructed by first connecting pairs of points…

Non-idempotent intersection types are used in order to give a bound of the length of the normalization beta-reduction sequence of a lambda term: namely, the bound is expressed as a function of the size of the term.

The subject of this paper is to prove a functional weak invariance principle for the local time of a process generated by a Gibbs-Markov map. More precisely, let $\left(X,\mathcal{B},m,T,\alpha\right)$ is a mixing, probability preserving…

The numerical properties of algorithms for finding the intersection of sets depend to some extent on the regularity of the sets, but even more importantly on the regularity of the intersection. The alternating projection algorithm of von…

An asymmetric variant of the contact process where the activity spreads with different and independent random rates to the left and to the right is introduced. A real space renormalization scheme is formulated for model by means of which it…

New bispectral polynomials orthogonal on a quadratic bi-lattice are obtained from a truncation of Wilson polynomials. Recurrence relation and difference equation are provided. The recurrence coefficients can be encoded in a perturbed…

Consider the interchange process on a connected graph $G=(V,E)$ on $n$ vertices. I.e.\ shuffle a deck of cards by first placing one card at each vertex of $G$ in a fixed order and then at each tick of the clock, picking an edge uniformly at…

We face the problem of characterizing the periodic cases in parametric families of (real or complex) rational diffeomorphisms having a fixed point. Our approach relies on the Normal Form Theory, to obtain necessary conditions for the…

Circular-arc graphs are intersection graphs of arcs on the circle. The aim of our work is to present a polynomial time algorithm testing whether two circular-arc graphs are isomorphic. To accomplish our task we construct decomposition…

This is a survey on renormalisation in the locality setup highlighting the role that locality morphisms can play for renormalisation purposes. Having set up a general framework to build regularisation maps, we illustrate renormalisation by…

We consider the popular and classical method of alternating projections for finding a point in the intersection of two closed sets. By situating the algorithm in a metric space, equipped only with well-behaved geodesics and angles (in the…

We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…

We study the asymptotic behaviour of the number of self-intersections of a trajectory of a periodic planar Lorentz process with strictly convex obstacles and finite horizon. We give precise estimates for its expectation and its variance. As…

In this paper we show that the random degree constrained process (a time-evolving random graph model with degree constraints) has a local weak limit, provided that the underlying host graphs are high degree almost regular. We, moreover,…

Consider a stochastic process $\mathfrak{X}$, regenerative at a state $x$ which is instantaneous and regular. Let $L$ be a regenerative local time for $\mathfrak{X}$ at $x$. Suppose furthermore that $\mathfrak{X}$ can be approximated by…

In this paper we consider a simple Markov chain for bipartite graphs with given degree sequence on $n$ vertices. We show that the mixing time of this Markov chain is bounded above by a polynomial in $n$ in case of {\em semi-regular} degree…