相关论文: Moments of Two-Variable Functions and the Uniquene…

We consider sequences of graphs and define various notions of convergence related to these sequences: ``left convergence'' defined in terms of the densities of homomorphisms from small graphs into the graphs of the sequence, and ``right…

A graph $G = (V, E)$ of bounded degree has an adjacency operator~$A$ which acts on the Hilbert space $\ell^2(V)$. There are different kinds of measures of interest on the spectrum $\Sigma (A)$ of $A$. In particular, each vector $\xi \in…

In measure theory several results are known how measure spaces are transformed into each other. But since moment functionals are represented by a measure we investigate in this study the effects and implications of these measure…

Edgeworth-type expansions for convolutions of probability densities and powers of the characteristic functions with non-uniform error terms are established for i.i.d. random variables with finite (fractional) moments of order $s \geq 2$,…

The sequence of moments of a vector-valued random variable can characterize its law. We study the analogous problem for path-valued random variables, that is stochastic processes, by using so-called robust signature moments. This allows us…

It is shown that a set in product of $n$ metrizable spaces is the discontinuity points set of some separately continuous function if and only if this set can be represented as the union of a sequence of $F_{\sigma}$-sets which are locally…

We develop two notions of time-restricted sensitivity to initial conditions for measurable dynamical systems, where the time before divergence of a pair of paths is at most an asymptotically logarithmic function of a measure of their…

In this paper we consider a discrete-time dynamical system on the real line by random iteration of two functions. These functions are assumed to satisfy appropriate monotonicity conditions; optionally, a symmetry condition may be imposed.…

The problem of what moments can exist for the coding radius of a finitary map between two i.i.d. processes, has been extensively studied in the case of $\mathbb{Z}$-processes. Here we treat this problem for factor maps between…

Call a colouring of a graph distinguishing, if the only colour preserving automorphism is the identity. A conjecture of Tucker states that if every automorphism of a graph $G$ moves infinitely many vertices, then there is a distinguishing…

Inspired by Franks' classification of irreducible shifts of finite type we provide a short list of allowed moves on graphs that preserves the stable isomorphism class of the associated C*-algebras. We show that if two graphs have stably…

This paper focuses on the time constant for last passage percolation on complete graph. Let $G_n=([n],E_n)$ be the complete graph on vertex set $[n]=\{1,2,\ldots,n\}$, and i.i.d. sequence $\{X_e:e\in E_n\}$ be the passage times of edges.…

We prove that certain sequences of finite continued fractions associated with a 2-periodic continued fraction with period a,b>0 are moment sequences of discrete signed measures supported in the interval [-1,1], and we give necessary and…

We define a characteristic function for probability measures on the signatures of geometric rough paths. We determine sufficient conditions under which a random variable is uniquely determined by its expected signature, thus partially…

A dynamical system of points moving along the edges of a graph could be considered as a geometrical discrete dynamical system or as a discrete version of a quantum graph with localized wave packets. We study the set of such systems over…

In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…

W-transforms are introduced as uniformity-preserving univariate transformations on the unit interval induced by distribution functions and piecewise strictly monotone functions, and their properties are investigated. When applied…

We develop a novel numerical bootstrap for unitary, crossing-symmetric conformal field theories, focusing on moment observables defined as weighted averages over conformal data. Providing a global and coarse-grained probe of the operator…

We consider diffusion on discrete measure spaces as encoded by Markovian semigroups arising from weighted graphs. We study whether the graph is uniquely determined if the diffusion is given up to order isomorphism. If the graph is recurrent…

Temporal graphs are graphs where the presence or properties of their vertices and edges change over time. When time is discrete, a temporal graph can be defined as a sequence of static graphs over a discrete time span, called lifetime, or…