Related papers: On random topological Markov chains with big image…

I start by reviewing some basic properties of random graphs. I then consider the role of random walks in complex networks and show how they may be used to explain why so many long tailed distributions are found in real data sets. The key…

We apply here methods of inhomogeneous random graphs to a class of random distance graphs. This provides an example outside of the rank 1 models which is still solvable as long as the largest connected component is concerned. In particular,…

This paper generalizes the notion of stochastic order to a relation between probability measures over arbitrary measurable spaces. This generalization is motivated by the observation that for the stochastic ordering of two stationary Markov…

We study the pointwise perturbations of countable Markov maps with infinitely many inverse branches and establish the following continuity theorem: Let $T_k$ and $T$ be expanding countable Markov maps such that the inverse branches of $T_k$…

We study trace theoretic concurrent systems. This setting encompasses safe (1-bounded) Petri nets. We introduce a notion of irreducible concurrent system and we prove the equivalence between irreducibility and a "spectral property". The…

A graphon satisfies the $H$-property if graphs sampled from it contain a Hamiltonian decomposition almost surely, which in turn implies that the corresponding network topologies are, e.g., structurally stable and structurally ensemble…

We introduce a notion of vague convergence for random marked metric measure spaces. Our main result shows that convergence of the moments of order $k \ge 1$ of a random marked metric measure space is sufficient to obtain its vague…

We consider transfer operators for topological Markov shift (TMS) with countable states and with holes which are $2$-cylinders. As main results, if the closed system of the shift has finitely irreducible transition matrix and the potential…

The concept of relative sectional category expands upon classical sectional category theory by incorporating the pullback of a fibration along a map. Our paper aims not only to explore this extension but also to thoroughly investigate its…

In this paper we extend results on reconstruction of probabilistic supports of random i.i.d variables to supports of dependent stationary $\mathbb R^d$-valued random variables. All supports are assumed to be compact of positive reach in…

In this paper, we utilize the framework of Markov processes to attain a more probabilistic perspective on the theory of transfer operators. In doing so, we establish a functional central limit theorem (FLCT) for an $O(N)$ model associated…

For $1\le p \le \infty$, the Fr\'echet $p$-mean of a probability measure on a metric space is an important notion of central tendency that generalizes the usual notions in the real line of mean ($p=2$) and median ($p=1$). In this work we…

We show some level-2 large deviation principles for rational maps satisfying a strong form of non-uniform hyperbolicity, called "Topological Collet-Eckmann". More precisely, we prove a large deviation principle for the distribution of…

We prove a Perron-Frobenius-Ruelle theorem for group extensions of topological Markov chains based on a construction of $\sigma$-finite conformal measures and give applications to the construction of harmonic functions.

In previous papers, threshold probabilities for the properties of a random distance graph to contain strictly balanced graphs were found. We extend this result to arbitrary graphs and prove that the number of copies of a strictly balanced…

Computation of the probability that a random graph is connected is a challenging problem, so it is natural to turn to approximations such as Monte Carlo methods. We describe sequential importance resampling and splitting algorithms for the…

In signal detection problems, one is usually faced with the task of searching a parameter space for peaks in the likelihood function which indicate the presence of a signal. Random searches have proven to be very efficient as well as easy…

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with probability $n^{-a}$, $0 < a < 1/2$, and let $p(n) = n^{1+\epsilon}$, $0 < \epsilon < 1$. We prove that, almost surely, for every…

It is proved that the Continuum Hypothesis implies that any sequence of rapid P-points of length $<{\mathfrak c}^{+}$ which is increasing with respect to the Rudin-Keisler ordering is bounded above by a rapid P-point. This is an improvement…

We derive two sufficient conditions for a function of a Markov random field (MRF) on a given graph to be a MRF on the same graph. The first condition is information-theoretic and parallels a recent information-theoretic characterization of…