Related papers: Moments of Two-Variable Functions and the Uniquene…
We identify a natural analytic continuation in four dimensions from Minkowski signature to a signature with two time-like momentum components. For two, three and four-point diagrams at fixed external momenta, this continuation can be…
In this paper we introduce the theory of derivatives of moments and (moment) functionals to represent moment functionals by Gaussian mixtures, characteristic functions of polytopes, and simple functions of polytopes. We study, among other…
Let $G$ be a connected graph with vertex set $V$ and a {\em weight function} $\rho$ that assigns a nonnegative number to each of its vertices. Then, the {\em $\rho$-moment} of $G$ at vertex $u$ is defined to be $M_G^{\rho}(u)=\sum_{v\in V}…
We consider point clouds obtained as random samples of a measure on a Euclidean domain. A graph representing the point cloud is obtained by assigning weights to edges based on the distance between the points they connect. Our goal is to…
This paper concerns discrete-time occupancy processes on a finite graph. Our results can be formulated in two theorems, which are stated for vertex processes, but also applied to edge process (e.g., dynamic random graphs). The first theorem…
The theory of convergent graph sequences has been worked out in two extreme cases, dense graphs and bounded degree graphs. One can define convergence in terms of counting homomorphisms from fixed graphs into members of the sequence…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
Functionality is a graph complexity measure that extends a variety of parameters, such as vertex degree, degeneracy, clique-width, or twin-width. In the present paper, we show that functionality is bounded for box intersection graphs in…
Let $(X,T)$ be a topological dynamical system with metric $d$. We define a new function $\overline{F}(x,y)=\limsup\limits_{n \to +\infty} \inf\limits_{\sigma \in S_n} \frac 1n \sum\limits_{k=1}^n d(T^k x,T^{\sigma(k)} y)$ by using…
In this paper, we consider discrete time quantum walks on graphs with coin focusing on the decentralized model, where the coin operation is allowed to change with the vertex of the graph. When the coin operations can be modified at every…
Colouring the vertices of a graph $G$ according to certain conditions can be considered as a random experiment and a discrete random variable $X$ can be defined as the number of vertices having a particular colour in the proper colouring of…
Consider $n$ points distributed uniformly in $[0,1]^d$. Form a graph by connecting two points if their mutual distance is no greater than $r(n)$. This gives a random geometric graph, $\gnrn$, which is connected for appropriate $r(n)$. We…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
The moment problem in probability theory asks for criteria for when there exists a unique measure with a given tuple of moments. We study a variant of this problem for random objects in a category, where a moment is given by the average…
The metric dimension of a graph $G$ is the minimum number of vertices in a subset $S$ of the vertex set of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $S$. In this paper we investigate the…
In this paper we study the existence and uniqueness of fixed points of a class of mappings defined on complete, (sequentially compact) cone metric spaces, without continuity conditions and depending on another function.
For functions $f$ whose Taylor coefficients at the origin form a Hausdorff moment sequence we study the behaviour of $w(y):=|f(\gamma+iy)|$ for $y>0$ ($\gamma\leq1$ fixed).
We study sequences of functions of the form F_p^n -> {0,1} for varying n, and define a notion of convergence based on the induced distributions from restricting the functions to a random affine subspace. Using a decomposition theorem and a…
In this paper, we analyze the limiting spectral distribution of the adjacency matrix of a random graph ensemble, proposed by Chung and Lu, in which a given expected degree sequence $\overline{w}_n^{^{T}} = (w^{(n)}_1,\ldots,w^{(n)}_n)$ is…
We prove two limit laws for functionals of one dimensional symmetric 1-stable process using the method of moments, and give a remark on Rosen's paper \cite{Rosen}.