Related papers: Topological indices in Random Spiro Chains
By means of a binary visibility graph, we present a novel method to study random binary sequences. The behavior of the some topological properties of the binary visibility graph, such as the degree distribution, the clustering coefficient,…
The first Zagreb index of a graph $G$ is the sum of squares of the vertex degrees in a graph and the second Zagreb index of $G$ is the sum of products of degrees of adjacent vertices in $G$. The imbalance of an edge in $G$ is the numerical…
We study mesoscopic signatures of the topological Anderson transitions in topological disordered chains. To this end we introduce an integer-valued sample-specific definition of the topological index in finite size systems. Its phase…
The central limit theorem of martingales is the fundamental tool for studying the convergence of stochastic processes. The central limit theorem and functional central limit theorem are obtained for martingale like random variables under…
In this paper, we consider a class of stochastic optimal control problems with risk constraints that are expressed as bounded probabilities of failure for particular initial states. We present here a martingale approach that diffuses a risk…
For a graph $G$, the Mostar index of $G$ is the sum of $|n_u(e)$ - $n_v(e)|$ over all edges $e=uv$ of $G$, where $n_u(e)$ denotes the number of vertices of $G$ that have a smaller distance in $G$ to $u$ than to $v$, and analogously for…
Topological invariants, rigorously defined only in the thermodynamic limit, have been generalized to topological indicators applicable to finite-size disordered systems. However, in many experimentally relevant situations, such as…
In this paper we obtain the central limit theorem for triangular arrays of non-homogeneous Markov chains under a condition imposed to the maximal coefficient of correlation. The proofs are based on martingale techniques and a sharp lower…
One of the fundamental invariants connecting algebra and geometry is the degree of an ideal. In this paper we derive the probabilistic behavior of degree with respect to the versatile Erd\H{o}s-R\'enyi-type model for random monomial ideals…
This work addresses a modification of the random geometric graph (RGG) model by considering a set of points uniformly and independently distributed on the surface of a $(d-1)$-sphere with radius $r$ in a $d-$dimensional Euclidean space,…
In this paper we prove that the limiting distribution of the Chromatic number of a random graph $\mathcal{G}_{n,p}$, with fixed edge-probability $p$, after appropriate centering and scaling is Normal, when the number of vertices $n$, goes…
By means of filters, minimal R_1 and minimal regular topologies are characterized on suitable intervals consisting of non-trivial R_0 topologies.
We present a statistical analysis of different metrics characterizing the topological properties of Internet maps, collected at two different resolution scales: the router and the autonomous system level. The metrics we consider allow us to…
We derive an algorithm to determine recursively the lap number (minimal number of monotone pieces) of the iterates of unimodal maps of an interval with free end-points. The algorithm is obtained by the sign analysis of the itineraries of…
An infinite system of point particles placed in $\mathds{R}^d$ is studied. Its constituents perform random jumps with mutual repulsion described by a translation-invariant jump kernel and interaction potential, respectively. The pure states…
We present a new approach to the bootstrap for chains of infinite order taking values on a finite alphabet. It is based on a sequential Bootstrap Central Limit Theorem for the sequence of canonical Markov approximations of the chain of…
In this paper non-asymptotic exponential estimates are derived for tail of maximum martingale distribution by naturally norming in the spirit of the classical Law of Iterated Logarithm. Key words: Martingales, exponential estimations,…
The focus of this work is the asymptotic analysis of the tail distribution of Google's PageRank algorithm on large scale-free directed networks. In particular, the main theorem provides the convergence, in the Kantorovich-Rubinstein metric,…
In this paper, we investigate temporal clusters of extremes defined as subsequent exceedances of high thresholds in a stationary time series. Two meaningful features of these clusters are the probability distribution of the cluster size and…
We generalise the martingale-coboundary representation of discrete time stochastic processes to the non-stationary case and to random variables in Orlicz spaces. Related limit theorems (CLT, invariance principle, log log law, probabilities…