Related papers: Moments of Two-Variable Functions and the Uniquene…
The metric dimension of a graph is the size of the smallest set of vertices whose distances distinguish all pairs of vertices in the graph. We show that this graph invariant may be calculated by an algorithm whose running time is linear in…
Associativity of a two-place function $T: [0,1]^2\rightarrow [0,1]$ defined by $T(x,y)=f^{(-1)}(T^*(f(x),f(y)))$ where $T^*:[0,1]^2\rightarrow[0,1]$ is an associative function with neutral element in $[0,1]$, $f: [0,1]\rightarrow [0,1]$ is…
A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. We establish tight lower bounds on the maximum size of a uniquely restricted matching in terms of order, size, and maximum degree.
Modeling functions that are sequentially observed as functional time series is becoming increasingly common. In such models, it is often crucial to ensure data homogeneity. We investigate the sensitivity of graph-based change point…
An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is the minimal degree of its automorphism group, i.e., the minimum number of elements…
We construct a H\"older continuous function on the unit interval which coincides in uncountably (in fact continuum) many points with every function of total variation smaller than 1 passing through the origin. We say that a function with…
The distinguishing number $\operatorname D(G)$ of a graph $G$ is the least cardinal $d$ such that $G$ has a labeling with $d$ labels which is only preserved by the trivial automorphism. We show that the distinguishing number of infinite,…
We study the Banach space $D([0,1]^m)$ of functions of several variables that are (in a certain sense) right-continuous with left limits, and extend several results previously known for the standard case $m=1$. We give, for example, a…
We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…
The walk distances in graphs are defined as the result of appropriate transformations of the $\sum_{k=0}^\infty(tA)^k$ proximity measures, where $A$ is the weighted adjacency matrix of a graph and $t$ is a sufficiently small positive…
We introduce a persistence-type invariant for finite weighted graphs based on combinatorial multivector dynamics. For each threshold parameter, a relation matrix determines a graph multivector field, whose induced directed dynamics admits a…
We prove a sequence of limiting results about weakly dependent stationary and regularly varying stochastic processes in discrete time. After deducing the limiting distribution for individual clusters of extremes, we present a new type of…
We show that in a metric space, any continuous function with compact sublevel sets and finite metric slope is uniquely determined by the slope and its critical values.
This paper deals with Poisson processes on an arbitrary measurable space. Using a direct approach, we derive formulae for moments and cumulants of a vector of multiple Wiener-It\^o integrals with respect to the compensated Poisson process.…
The \textit{node reliability} of a graph $G$ is the probability that at least one node is operational and that the operational nodes can all communicate in the subgraph that they induce, given that the edges are perfectly reliable but each…
We study the dynamics of the metrics generated by measure preserving transformations. We consider a sequence of average metrics and define the corresponding sequence of $\epsilon$-entropies ({\it scaling sequence}) of the measure with…
Let ${\cal G}=(G,w)$ be a weighted simple finite connected graph, that is, let $G$ be a simple finite connected graph endowed with a function $w$ from the set of the edges of $G$ to the set of real numbers. For any subgraph $G'$ of $G$, we…
We give a bound for the graph energy with given maximal degree in terms of the second and fourth moments of a graph. In the case in which the graph is $d$-regular we obtain the bound that is given in Van Dam, E. et al. (2014). through…
The well-known von Bahr--Esseen bound on the absolute $p$th moments of martingales with $p\in(1,2]$ is extended to a large class of moment functions, and now with a best possible constant factor (which depends on the moment function). This…
This paper studies the second moment boundedness of solutions of linear stochastic delay differential equations. First, we give a framework, for general $\mathrm{N}$-dimensional linear stochastic differential equations with a single…