Related papers: Invariance property for extended means

A criterion of joint ergodicity of several sequences of transformations of a probability measure space $X$ of the form $T_{i}^{\phi_{i}(n)}$ is given for the case where $T_{i}$ are commuting measure preserving transformations of $X$ and…

We study an inverse problem on a finite connected graph G = (X, E), on whose vertices a conductivity {\gamma} is defined. Our data consists in a sequence of partial observations of a fractional random walk on G. The observations are partial…

We prove quantum ergodicity for a family of graphs that are obtained from ergodic one-dimensional maps of an interval using a procedure introduced by Pakonski et al (J. Phys. A, v. 34, 9303-9317 (2001)). As observables we take the L^2…

A mid-point theorem is proved in an elementary way for the U type shape of functions that arise out of exponential quadratic functions. These results are inspired from epidemic patterns and growth over a time period. Key words: natural…

Denote by $\mathcal{H}_k (n,p)$ the random $k$-graph in which each $k$-subset of $\{1... n\}$ is present with probability $p$, independent of other choices. More or less answering a question of Balogh, Bohman and Mubayi, we show: there is a…

Let $f\colon X\to Y$ be a perfect map between finite-dimensional metrizable spaces and $p\geq 1$. It is shown that the space $C^*(X,\R^p)$ of all bounded maps from $X$ into $\R^p$ with the source limitation topology contains a dense…

A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…

We introduce a class of discrete random walk model driven by global memory effects. At any time the right-left transitions depend on the whole previous history of the walker, being defined by an urn-like memory mechanism. The characteristic…

For data living in a manifold $M\subseteq \mathbb{R}^m$ and a point $p\in M$ we consider a statistic $U_{k,n}$ which estimates the variance of the angle between pairs of vectors $X_i-p$ and $X_j-p$, for data points $X_i$, $X_j$, near $p$,…

Given integers $m$ and $f$, let $S_n(m,f)$ consist of all integers $e$ such that every $n$-vertex graph with $e$ edges contains an $m$-vertex induced subgraph with $f$ edges, and let $\sigma(m,f)=\limsup_{n\rightarrow\infty}…

We consider homogenization of random surfaces and study the variational principle for graph homomorphisms from subsets of $\mathbb{Z}^m$ into $\mathbb{Z}$, where the underlying uniform measure is perturbed by a random field. Motivated by…

For a distribution $p:=\{p_k\}_{k=1}^\infty$ on the positive integers, there are two natural ways to construct a random permutation in $S_n$ or of $\mathbb{N}$ from IID samples from $p$--the $p$-biased construction and the $p$-shifted…

Let $p$ be a real number greater than one and let $G$ be a connected graph of bounded degree. In this paper we introduce the $p$-harmonic boundary of $G$. We use this boundary to characterize the graphs $G$ for which the constant functions…

Let $A_i$ and $B_i$ be positive definite matrices for all $i=1,\cdots,m.$ It is shown that $$\left|\left|\sum_{i=1}^m(A_i^2\sharp…

For ${1/2}<\alpha<1$, we propose the MDP analysis for family $$ S^\alpha_n=\frac{1}{n^\alpha}\sum_{i=1}^nH(X_{i-1}), n\ge 1, $$ where $(X_n)_{n\ge 0}$ be a homogeneous ergodic Markov chain, $X_n\in \mathbb{R}^d$, when the spectrum of…

Consider the inhomogeneous Erd\H{o}s-R\'enyi random graph (ERRG) on $n$ vertices for which each pair $i,j\in\{1,\ldots,n\}$, $i\neq j$ is connected independently by an edge with probability $r_n(\frac{i-1}{n},\frac{j-1}{n})$, where…

We introduce a very general model of an inhomogenous random graph with independence between the edges, which scales so that the number of edges is linear in the number of vertices. This scaling corresponds to the p=c/n scaling for G(n,p)…

We show that, for a countable discrete group $\Gamma$, property $(\mathrm{T}_{L^p})$ of Bader, Furman, Gelander and Monod is equivalent to the property that, whenever an $L^p$-representation of $\Gamma$ admits a net of almost invariant unit…

The main aim of this article is to show that maps with specification property have invariant distributionally scrambled sets and that this kind of scrambled set can be transferred from factor to extension under finite-to-one factor maps.…

A major difficulty in studying the Bak-Sneppen model is in effectively comparing it with well-understood models. This stems from the use of two geometries: complete graph geometry to locate the global fitness minimizer, and graph geometry…