相关论文: Topological indices in Random Spiro Chains

We consider the ensemble of N-dimensional random symmetric matrices A that have, in average, p non-zero elements per row. We study the asymptotic behavior of the norm of A in the limit of infinitely increasing N and p. We prove that the…

In this paper we extend the notion of a continuous bundle random dynamical system to the setting where the action of $\R$ or $\N$ is replaced by the action of an infinite countable discrete amenable group. Given such a system, and a…

A class of random graphs is introduced and studied. The graphs are constructed in an algorithmic way from five motifs which were found in [Milo R., Shen-Orr S., Itzkovitz S., Kashtan N., Chklovskii D., Alon U., Science, 2002, 298, 824-827].…

We refine the classical Lindeberg-Feller central limit theorem by obtaining asymptotic bounds on the Kolmogorov distance, the Wasserstein distance, and the parametrized Prokhorov distances in terms of a Lindeberg index. We thus obtain more…

The notion of Laplacian of a graph can be generalized to simplicial complexes and hypergraphs, and contains information on the topology of these structures. Even for a graph, the consideration of associated simplicial complexes is…

As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a stochastic maximal inequality derived by using the Taylor expansion, is…

In this note, we investigate the behaviour of suprema for band-limited spherical random fields. We prove upper and lower bound for the expected values of these suprema, by means of metric entropy arguments and discrete approximations; we…

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…

The local minima (inherent structures) of a system and their associated transition links give rise to a network. Here we consider the topological and distance properties of such a network in the context of spin glasses. We use steepest…

Summary statistics play an important role in network data analysis. They can provide us with meaningful insight into the structure of a network. The Randi\'{c} index is one of the most popular network statistics that has been widely used…

Given $0<\alpha\leq\pi$, ${\epsilon}>0$ and $n$, we define random graphs on the $d$-dimensional sphere by drawing $n$ i.i.d. uniform random points for the vertices, and edges $u {\sim} v$ whenever the geodesic distance between $u$ and $v$…

We prove a non-asymptotic central limit theorem for vector-valued martingale differences using Stein's method, and use Poisson's equation to extend the result to functions of Markov Chains. We then show that these results can be applied to…

For a spatial characteristic, there exist commonly fat-tail frequency distributions of fragment-size and -mass of glass, areas enclosed by city roads, and pore size/volume in random packings. In order to give a new analytical approach for…

In this paper, degree-based topological indices play a key role in the structural analysis of graphs in this paper and have significant uses in chemical graph theory. We investigate the connections between three such tree indices: the…

We introduce the \emph{Topological Stability Index} (TSI), a variance-based scalar measure for persistence barcodes that quantifies the dispersion of persistence lifetimes. Unlike persistent entropy, which depends only on normalized…

Link prediction systems (e.g. recommender systems) typically use graph topology as one of their main sources of information. However, automorphisms and related properties of graphs beget inherent limits in predictability. We calculate hard…

Let $T\_n$ denote the set of unrooted labeled trees of size $n$ and let $T\_n$ be a particular (finite, unlabeled) tree. Assuming that every tree of $T\_n$ is equally likely, it is shown that the limiting distribution as $n$ goes to…

Topological measurements are increasingly being accepted as an important tool for quantifying complex structures. In many applications, these structures can be expressed as nodal domains of real-valued functions and are obtained only…

Using martingale methods, we provide bounds for the entropy of a probability measure on $\mathbb {R}^d$ with the right-hand side given in a certain integral form. As a corollary, in the one-dimensional case, we obtain a weighted log-Sobolev…

We investigate some topological and spectral properties of Erd\H{o}s-R\'{e}nyi (ER) random digraphs $D(n,p)$. In terms of topological properties, our primary focus lies in analyzing the number of non-isolated vertices $V_x(D)$ as well as…