Related papers: Lecture notes on "Combinatorial Criteria for Uniqu…
Graphlet analysis is an approach to network analysis that is particularly popular in bioinformatics. We show how to set up a system of linear equations that relate the orbit counts and can be used in an algorithm that is significantly…
This book introduces the mathematical foundations and techniques that lead to the development and analysis of many of the algorithms that are used in machine learning. It starts with an introductory chapter that describes notation used…
In this document, we aim to gather various results related to a compositional/categorical approach to rigorous Statistical Mechanics. Rigorous Statistical Mechanics is centered on the mathematical study of statistical systems. Central…
We establish a one-to-one correspondence between one-sided and two-sided regular systems of conditional probabilities on the half-line that preserves the associated chains and Gibbs measures. As an application, we determine uniqueness and…
This paper draws distinctions among various concepts related to tipping points, robustness, path dependence, and other properties of system dynamics. For each concept a formal definition is provided that utilizes Markov model…
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…
Many quantities that characterize network elements are defined in an explicit form and calculated directly from the network structure; examples of include several centrality measures like degree, closeness, or betweenness. However, there…
This is an exposition of some recent developments related to the object in the title, particularly the combinatorial computation of the (genus 0) Gromov-Witten invariants of the flag manifold and the quadratic algebra approach. The notes…
The question of how to combine experimental results that `appear' to be in mutual disagreement, treated in detail years ago in a previous paper, is revisited. The first novelty of the present note is the explicit use of graphical models, in…
In this article, we generalize some frequently used metrical notions such as: completeness, closedness, continuity, g-continuity and compatibility to relation-theoretic setting and utilize these relatively weaker notions to prove results on…
This is a detailed survey -- with rigorous and self-contained proofs -- of some of the basics of elementary combinatorics and algebra, including the properties of finite sums, binomial coefficients, permutations and determinants. It is…
These notes deal with metric spaces, Hausdorff measures and dimensions, Lipschitz mappings, and related topics. The reader is assumed to have some familiarity with basic analysis, which is also reviewed.
High-order phenomena play crucial roles in many systems of interest, but their analysis is often highly nontrivial. There is a rich literature providing a number of alternative information-theoretic quantities capturing high-order…
A new ansatz for quark and lepton mass matrices is proposed in the context of supersymmetric grand unified theories. The 13 parameters describing fermion masses and mixings are determined in terms of only 6 free parameters, allowing 7…
A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…
These are the lecture notes for quantum and statistical mechanics courses that are given by DC at Ben-Gurion University. They are complementary to "Lecture Notes in Quantum Mechanics" [arXiv: quant-ph/0605180]. Some additional topics are…
We consider discrete-time Markov chains and study large deviations of the pair empirical occupation measure, which is useful to compute fluctuations of pure-additive and jump-type observables. We provide an exact expression for the…
We study properties that allow first-order theories to be disjointly combined, including stable infiniteness, shininess, strong politeness, and gentleness. Specifically, we describe a Galois connection between sets of decidable theories,…
Markov chains are a class of probabilistic models that have achieved widespread application in the quantitative sciences. This is in part due to their versatility, but is compounded by the ease with which they can be probed analytically.…
We give a detailed and refined proof of the Dobrushin-Pechersky uniqueness criterion extended to the case of Gibbs fields on general graphs and single-spin spaces, which in particular need not be locally compact. The exponential decay of…