Related papers: Combinatorial identities using Bernoulli Graphs
We discuss the problem of extending data mining approaches to cases in which data points arise in the form of individual graphs. Being able to find the intrinsic low-dimensionality in ensembles of graphs can be useful in a variety of…
Spatial search is an important problem in quantum computation, which aims to find a marked vertex on a graph. We propose a novel approach for designing deterministic quantum search algorithms on a variety of graphs via alternating quantum…
An emerging way of tackling the dimensionality issues arising in the modeling of a multivariate process is to assume that the inherent data structure can be captured by a graph. Nevertheless, though state-of-the-art graph-based methods have…
In this paper, we derive eight basic identities of symmetry in three variables related to generalized Bernoulli polynomials and generalized power sums. All of these are new, since there have been results only about identities of symmetry in…
We introduce a new distributed algorithm for aligning graphs or finding substructures within a given graph. It is based on the cavity method and is used to study the maximum-clique and the graph-alignment problems in random graphs. The…
We develop a combinatorial model of the associated Hermite polynomials and their moments, and prove their orthogonality with a sign-reversing involution. We find combinatorial interpretations of the moments as complete matchings, connected…
A graphical model encodes conditional independence relations via the Markov properties. For an undirected graph these conditional independence relations can be represented by a simple polytope known as the graph associahedron, which can be…
In this article we obtain a general polynomial identity in $k$ variables, where $k\geq 2$ is an arbitrary positive integer. We use this identity to give a closed-form expression for the entries of the powers of a $k \times k$ matrix.…
In this paper, we establish an identity for Bernoulli's generalized polynomials. We deduce generalizations for many relations involving classical Bernoulli numbers or polynomials. In particular, we generalize a recent Gessel identity.
Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and information networks. This chapter provides an overview of graph…
In this paper, the problem of matching pairs of correlated random graphs with multi-valued edge attributes is considered. Graph matching problems of this nature arise in several settings of practical interest including social network…
Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…
Binomial random intersection graphs can be used as parsimonious statistical models of large and sparse networks, with one parameter for the average degree and another for transitivity, the tendency of neighbours of a node to be connected.…
Many systems comprising entities in interactions can be represented as graphs, whose structure gives significant insights about how these systems work. Network theory has undergone further developments, in particular in relation to…
Generalised degrees provide a natural bridge between local and global topological properties of networks. We define the generalised degree to be the number of neighbours of a node within one and two steps respectively. Tailored random graph…
An analysis is made of a moving disturbance using a directed cyclic graph. A statistical approach is used to calculate the alternative positions in space and state of the disturbance with a defined observed time. The probability for a…
In this paper, we show combinatorial identities that represent powers of positive integers using multinomial coefficients, which do not come from the multinomial theorem and the multinomial Vandermonde's convolution.
In this note we present a combinatorial proof of an identity involving poly-Bernoulli numbers and Genocchi numbers. We introduce the combinatorial objects, $m-$barred Callan sequences and show that the identity holds in a more general…
We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…
We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…