Related papers: Multiple Partition Structures and Harmonic Functio…
We investigate a class of random graph ensembles based on the Feynman graphs of multidimensional integrals, representing statistical-mechanical partition functions. We show that the resulting ensembles of random graphs strongly resemble…
The distinguishing result of this paper is a $\mathbf{P}$-time enumerable partition of all the potential perfect matchings in a bipartite graph. This partition is a set of equivalence classes induced by the missing edges in the potential…
We characterize metrologically useful multipartite entanglement by representing partitions with Young diagrams. We derive entanglement witnesses that are sensitive to the shape of Young diagrams and show that Dyson's rank acts as a resource…
The paper introduces the concept of a cluster structure to define a joint distribution of the sample size and its exchangeable random partitions. The cluster structure allows the probability distribution of the random partitions of a subset…
This article offers a simplified approach to the distribution theory of randomly weighted averages or $P$-means $M_P(X):= \sum_{j} X_j P_j$, for a sequence of i.i.d.random variables $X, X_1, X_2, \ldots$, and independent random weights $P:=…
We consider Markov chains on the space of (countable) partitions of the interval $[0,1]$, obtained first by size biased sampling twice (allowing repetitions) and then merging the parts with probability $\beta_m$ (if the sampled parts are…
Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…
We learn the structure of a Markov Network between two groups of random variables from joint observations. Since modelling and learning the full MN structure may be hard, learning the links between two groups directly may be a preferable…
The Riemannian geometry of covariance matrices has been essential to several successful applications, in computer vision, biomedical signal and image processing, and radar data processing. For these applications, an important ongoing…
A covariance graph is an undirected graph associated with a multivariate probability distribution of a given random vector where each vertex represents each of the different components of the random vector and where the absence of an edge…
We study the partition function from random matrix theory using a well known connection to orthogonal polynomials, and a recently developed Riemann-Hilbert approach to the computation of detailed asymptotics for these orthogonal…
This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…
Consider a population evolving as a critical continuous-time Galton-Watson (GW) tree. Conditional on the population surviving until a large time $T$, sample $k$ individuals uniformly at random (without replacement) from amongst those alive…
The collective interference of partially distinguishable bosons in multi-mode networks is studied via double-sided Feynman diagrams. The probability for many-body scattering events becomes a multi-dimensional tensor-permanent, which…
We study some combinatorial statistics defined on the set $NC^{(mton)}(n)$ of monotonically ordered non-crossing partitions of {1,...,n}, and on the set $NC_2^{(mton)}(2n)$ of monotonically ordered non-crossing pair-partitions of…
Matchings and coverings are central topics in graph theory. The close relationship between these two has been key to many fundamental algorithmic and polyhedral results. For mixed graphs, the notion of matching forest was proposed as a…
This work focuses on clustering populations with a hierarchical dependency structure that can be described by a tree. A particular example that is the focus of our work is the phylogenetic tree, with nodes often representing biological…
A new combinatorial object is introduced, the part-frequency matrix sequence of a partition, which is elementary to describe and is naturally motivated by Glaisher's bijection. We prove results that suggest surprising usefulness for such a…
This paper investigates Hamiltonian properties of the algebro-geometric discretization of KP hierarchy introduced in \cite{Gie1}. A Poisson bracket is introduced. The system is related to the periodic band matrix system of \cite{vM-M}. It…
Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…