Related papers: Electrical varieties as vertex integrable statisti…
We introduce and study a class of exchangeable random graph ensembles. They can be used as statistical null models for empirical networks, and as a tool for theoretical investigations. We provide general theorems that carachterize the…
We explain the concepts of computational statistical physics which have proven very helpful in the study of Yang-Mills integrals, an ubiquitous new class of matrix models. Issues treated are: Absolute convergence versus Monte Carlo…
The probabilistic satisfiability of a logical expression is a fundamental concept known as the partition function in statistical physics and field theory, an evaluation of a related graph's Tutte polynomial in mathematics, and the…
Vertex operators, being families of birational transformations of infinite-dimensional algebraic ``varieties'' M, act on appropriate line bundles on M. However, they act on (meromorphic) sections only as_partial operators_: they are defined…
A method of resummation of infinite series of perturbation theory diagrams is applied for studying the properties of random band matrices. The topological classification of Feynman diagrams, which was actively used in last years for matrix…
We prove that the class of cluster integrable systems constructed by Goncharov and Kenyon out of the dimer model on a torus coincides with the one defined by Gekhtman, Shapiro, Tabachnikov, and Vainshtein using Postnikov's perfect networks.…
We analyze a new spectral graph matching algorithm, GRAph Matching by Pairwise eigen-Alignments (GRAMPA), for recovering the latent vertex correspondence between two unlabeled, edge-correlated weighted graphs. Extending the exact recovery…
Inference and optimization of real-value edge variables in sparse graphs are studied using the Bethe approximation and replica method of statistical physics. Equilibrium states of general energy functions involving a large set of real…
Lov\'asz and Cherkassky discovered in the 1970s independently that if $ G $ is a finite graph with a given set $ T $ of terminal vertices such that $ G $ is inner Eulerian, then the maximal number of edge-disjoint paths connecting distinct…
Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…
We present a method to estimate the number of irreducible components of the Fermi varieties of periodic Schr\"odinger operators on graphs in terms of suitable asymptotics. Our main theorem is an abstract bound for the number of irreducible…
In infinite graph theory, the notion of ends, first introduced by Freudenthal and Jung for locally finite graphs, plays an important role when generalizing statements from finite graphs to infinite ones. Nash-Willian's Tree-Packing Theorem…
All tree-level amplitudes in Einstein-Yang-Mills (EYM) theory and gravity (GR) can be expanded in terms of color ordered Yang-Mills (YM) ones whose coefficients are polynomial functions of Lorentz inner products and are constructed by a…
Statistical solutions of incompressible Euler describe turbulent dynamics as time-parameterized laws on $L^2$ whose multi-point correlations satisfy an infinite hierarchy of weak identities. Modern generative samplers for PDE forecasting…
Classical spectral graph theory relies on the symmetry of the adjacency and Laplacian operators, which guarantees orthogonal eigenbases and energy-preserving Fourier transforms. However, real-world networks are intrinsically directed and…
We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
We show that the celebrated six-vertex model of statistical mechanics (along with its multistate generalizations) can be reformulated as an Ising-type model with only a two-spin interaction. Such a reformulation unravels remarkable…
Boltzmann-Gibbs statistical mechanics applies satisfactorily to a plethora of systems. It fails however for complex systems generically involving strong space-time entanglement. Its generalization based on nonadditive $q$-entropies…
Effective resistance (ER) is an attractive way to interrogate the structure of graphs. It is an alternative to computing the eigen-vectors of the graph Laplacian. Graph laplacians are used to find low dimensional structures in high…