相关论文: Measure preserving homomorphisms and independent s…

A map is given showing that convolutions of independent random variables over a finite group and matrix multiplications of doubly stochastic matrices are homomorphic. As an application, a short proof is given to the theorem that the…

We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…

We study the problem of maximizing the number of independent sets in $n$-vertex $k$-chromatic $\ell$-connected graphs. First we consider maximizing the total number of independent sets in such graphs with $n$ sufficiently large, and for…

A new method is proposed to derive rigorous bounds on {\eta}, the growth rate of the logarithm of the number of independent sets on a hexagonal lattice. Specifically, we prove that 1.546440708536001 <= {\eta} <= 1.5513, which improves upon…

For a graph $G$, its $k$-th graph power $G^k$ is constructed by placing an edge between two vertices if they are within distance $k$. We consider the problem of deriving upper bounds on the Shannon capacity of graph powers by using spectral…

We study the dynamics of piecewise affine surface homeomorphisms from the point of view of their entropy. Under the assumption of positive topological entropy, we establish the existence of finitely many ergodic and invariant probability…

Recent work in graph models has found that probabilistic hyperedge replacement grammars (HRGs) can be extracted from graphs and used to generate new random graphs with graph properties and substructures close to the original. In this paper,…

We describe an approach to fix the gauge degrees of freedom in tensor networks, including those with closed loops, which allows a canonical form for arbitrary tensor networks to be realized. Additionally, a measure for the internal…

We introduce methods to count and enumerate all maximal independent, all maximum independent sets, and all independent sets in threshold graphs and k-threshold graphs. Within threshold graphs and k-threshold graphs independent sets…

In this paper we study unimodality problems for the independence polynomial of a graph, including unimodality, log-concavity and reality of zeros. We establish recurrence relations and give factorizations of independence polynomials for…

Character measure is a probability measure on irreducible representations of a semisimple Lie algebra. It appears from the decomposition into irreducibles of tensor power of a fundamental representation. In this paper we calculate the…

Neural networks that satisfy invariance with respect to input permutations have been widely studied in machine learning literature. However, in many applications, only a subset of all input permutations is of interest. For heterogeneous…

We introduce the notion of strongly independent matrices and show the existence of strongly independent matrices in $GL(n,\mathbb{Z})$ over $\mathbb{Z}^n\setminus\{0\}$ when $2n+1$ is a prime number. As an application of strong…

Consider the upper tail probability that the homomorphism count of a fixed graph $H$ within a large sparse random graph $G_n$ exceeds its expected value by a fixed factor $1+\delta$. Going beyond the Erd\H{o}s-R\'enyi model, we establish…

We give an upper bound on the largest eigenvalue of a graph of given order, size, and girth.

Settling Kahn's conjecture (2001), we prove the following upper bound on the number $i(G)$ of independent sets in a graph $G$ without isolated vertices: \[ i(G) \le \prod_{uv \in E(G)} i(K_{d_u,d_v})^{1/(d_u d_v)}, \] where $d_u$ is the…

We develop a theory of limits of finite posets in close analogy to the recent theory of graph limits. In particular, we study representations of the limits by functions of two variables on a probability space, and connections to…

This paper discusses the enumeration of independent sets in king graphs of size $m \times n$, based on the tensor network contractions algorithm given in reference~\cite{tilEnum}. We transform the problem into Wang tiling enumeration within…

This article provides sharp bounds for the maximum number of edges possible in a simple graph with restricted values of two of the three parameters, namely, maxi- mum matching size, independence number and maximum degree. We also construct…

The study of Fourier transforms of probability measures on fractal sets plays an important role in recent research. Faster decay rates are known to yield enhanced results in areas such as metric number theory. This paper focuses on…