中文
相关论文

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

200 篇论文

This paper deals with the maximum value of the difference between the determining number and the metric dimension of a graph as a function of its order. Our technique requires to use locating-dominating sets, and perform an independent…

组合数学 · 数学 2014-01-16 Delia Garijo , Antonio González , Alberto Márquez

For a graph $H$, its homomorphism density in graphs naturally extends to the space of two-variable symmetric functions $W$ in $L^p$, $p\geq e(H)$, denoted by $t(H,W)$. One may then define corresponding functionals…

组合数学 · 数学 2021-11-16 Frederik Garbe , Jan Hladký , Joonkyung Lee

A sequence of $k$-uniform hypergraphs $H_1, H_2, \dots$ is convergent if the sequence of homomorphism densities $t(F, H_1), t(F, H_2), \dots$ converges for every $k$-uniform hypergraph $F$. For graphs, Lov\'asz and Szegedy showed that every…

组合数学 · 数学 2015-10-26 Yufei Zhao

A metric space (X,d) is monotone if there is a linear order < on X and a constant c>0 such that d(x,y) < c d(x,z) for all x<y<z in X. Properties of continuous functions with monotone graph (considered as a planar set) are investigated. It…

经典分析与常微分方程 · 数学 2012-10-09 Ondřej Zindulka , Michael Hrušák , Tamás Mátrai , Aleš Nekvinda , Václav Vlasák

Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical properties of transition systems. We are interested in the…

计算机科学中的逻辑 · 计算机科学 2009-04-09 Walid Belkhir , Luigi Santocanale

The discrete data encoded in the power moments of a positive measure, fast decaying at infinity on euclidean space, is incomplete for recovery, leading to the concept of moment indeterminateness. On the other hand, classical integral…

泛函分析 · 数学 2023-08-01 David P. Kimsey , Mihai Putinar

Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…

概率论 · 数学 2020-05-20 Julien Petit , Renaud Lambiotte , Timoteo Carletti

If each edge (u,v) of a graph G=(V,E) is decorated with a permutation pi_{u,v} of k objects, we say that it has a permuted k-coloring if there is a coloring sigma from V to {1,...,k} such that sigma(v) is different from pi_{u,v}(sigma(u))…

组合数学 · 数学 2011-11-16 Varsha Dani , Cristopher Moore , Anna Olson

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…

组合数学 · 数学 2020-04-07 Lochlan Brick , Pu Gao , Angus Southwell

Estimates are constructed for the deviation of the concentration functions of sums of independent random variables with finite variances from the folded normal distribution function without any assumptions concerning the existence of the…

概率论 · 数学 2016-08-11 V. Yu. Korolev , A. V. Dorofeeva

Given a convex set $C$ in a real vector space $E$ and two points $x,y\in C$, we investivate which are the possible values for the variation $f(y)-f(x)$, where $f:C\longrightarrow [m,M]$ is a bounded convex function. We then rewrite the…

最优化与控制 · 数学 2015-03-18 Joon Kwon

We obtain the scaling limits of random graphs drawn uniformly in three families of intersection graphs: permutation graphs, circle graphs, and unit interval graphs. The two first families typically generate dense graphs, in these cases we…

The transition law of every exchangeable Feller process on the space of countable graphs is determined by a $\sigma$-finite measure on the space of $\{0,1\}\times\{0,1\}$-valued arrays. In discrete-time, this characterization amounts to a…

概率论 · 数学 2015-09-23 Harry Crane

Let $Y$ be a nonnegative random variable with mean $\mu$ and finite positive variance $\sigma^2$, and let $Y^s$, defined on the same space as $Y$, have the $Y$ size biased distribution, that is, the distribution characterized by…

概率论 · 数学 2011-06-20 Subhankar Ghosh , Larry Goldstein

A limit theorem for a sequence of diffusion processes on graphs is proved in a case when vary both parameters of the processes (the drift and diffusion coefficients on every edge and the asymmetry coefficients in every vertex), and…

概率论 · 数学 2007-05-23 Alexey M. Kulik

We obtain for the Kempner series (i.e. harmonic series where certain digits are excluded from all denominators, for example the digit 9 in base 10) new representations as geometrically convergent series. The coefficients for these…

数论 · 数学 2025-12-16 Jean-François Burnol

We define direct sums and a corresponding notion of connectedness for graph limits. Every graph limit has a unique decomposition as a direct sum of connected components. As is well-known, graph limits may be represented by symmetric…

组合数学 · 数学 2008-04-10 Svante Janson

We use the link between Jacobi continued fractions and the generating functions of certain moment sequences to study some simple transformations on them. In particular, we define and study a transformation that is appropriate for the study…

组合数学 · 数学 2023-07-04 Paul Barry

Given a continuous real-valued function on [0, 1], and a closed subset E \subset [0, 1] we denote by f E the restriction of f to E, that is, the function defined only on E that takes the same values as f at every point of E >. The…

经典分析与常微分方程 · 数学 2007-11-29 Jean-Pierre Kahane , Yitzhak Katznelson

A group A acting faithfully on a set X is 2-distinguishable if there is a 2-coloring of X that is not preserved by any nonidentity element of A, equivalently, if there is a proper subset of X with trivial setwise stabilizer. The motion of…

组合数学 · 数学 2013-05-09 Wilfried Imrich , Simon M. Smith , Thomas W. Tucker , Mark E. Watkins