相关论文: Topological indices in Random Spiro Chains

Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…

Transmitting structured light robustly through complex random media is crucial in many applications, from sensing to communication. Unfortunately, the spatial structure of light is distorted in such media due to refractive index…

For a martingale $(X_n)$ converging almost surely to a random variable $X$, the sequence $(X_n - X)$ is called martingale tail sum. Recently, Neininger [Random Structures Algorithms, 46 (2015), 346-361] proved a central limit theorem for…

We study the asymptotic distributions of the number of crossings and the number of simple chords in a random chord diagram. Using size-bias coupling and Stein's method, we obtain bounds on the Kolmogorov distance between the distribution of…

We characterise high-dimensional topology that arises from a random Cech complex constructed on the circle. Expected Euler characteristic curve is computed, where we observe limiting spikes. The spikes correspond to expected Betti numbers…

The real Ginibre spherical ensemble consists of random matrices of the form $A B^{-1}$, where $A,B$ are independent standard real Gaussian $N \times N$ matrices. The expected number of real eigenvalues is known to be of order $\sqrt{N}$. We…

We study the supremum of some random Dirichlet polynomials with independent coefficients and obtain sharp upper and lower bounds for supremum expectation thus extending the results from our previous work (see…

We consider "randomized" statistics constructed by using a finite number of observations a random field at randomly chosen points. We generalize the invariance principle (the functional CLT), the Glivenko--Cantelli theorem, the theorem…

The typical central limit theorems in high-frequency asymptotics for semimartingales are results on stable convergence to a mixed normal limit with an unknown conditional variance. Estimating this conditional variance usually is a hard…

The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search…

We study a class of dynamical systems generated by random substitutions, which contains both intrinsically ergodic systems and instances with several measures of maximal entropy. In this class, we show that the measures of maximal entropy…

We introduce a class of random compact metric spaces L(\alpha) indexed by \alpha \in (1,2) and which we call stable looptrees. They are made of a collection of random loops glued together along a tree structure, and can be informally be…

This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…

In this paper we study the path-regularity and martingale properties of the set-valued stochastic integrals defined in our previous work Ararat et al. (2023). Such integrals have some fundamental differences from the well-known…

We introduce the notion of topological electronic states on random lattices in non-integer dimensions. By considering a class $D$ model on critical percolation clusters embedded in two dimensions, we demonstrate that these topological…

Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is crucial for studying its random…

The study of stochastic variational principles involves the problem of constructing fixed-endpoint and adapted variations of semimartingales. We provide a detailed construction of variations of semimartingales that are not only fixed at…

We presented in \cite{bl2,bl7} an approach to derive the metastable behavior of continuous-time Markov chains. We assumed in these articles that the Markov chains visit points in the time scale in which it jumps among the metastable sets.…

Topological invariants, including the Chern numbers, can topologically classify parameterized Hamiltonians. We find that topological invariants can be properly defined and calculated even if the parameter space is discrete, which is done by…

Very recently, a bond-additive topological descriptor, known as the Mostar index, has been proposed as a measure of peripherality in graphs and networks. In this article, we compute the Mostar index of corona product, Cartesian product,…