相关论文: Uniqueness thresholds on trees versus graphs
We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an…
In the study of topological indices two negative correlations are well known: that between the number of subtrees and the Wiener index (sum of distances), and that between the Merrifield-Simmons index (number of independent vertex subsets)…
An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$. These codes have been widely studied for over two decades. We give an improvement…
We obtain large and moderate deviation estimates, as well as concentration inequalities, for a class of nonuniformly expanding maps with stretched exponential decay of correlations. In the large deviation regime, we also exhibit examples…
The class of two-spin systems contains several important models, including random independent sets and the Ising model of statistical physics. We show that for both the hard-core (independent set) model and the anti-ferromagnetic Ising…
We consider nonregular graphs having precisely three distinct eigenvalues. The focus is mainly on the case of graphs having two distinct valencies and our results include constructions of new examples, structure theorems, valency…
We study discrete time linear constrained switching systems with additive disturbances, in which the switching may be on the system matrices, the disturbance sets, the state constraint sets or a combination of the above. In our general…
In the last decade it became apparent that a large number of the most interesting structures and phenomena of the world can be described by networks: separable elements, with connections (or interactions) between certain pairs of them.…
Robertson and Seymour proved two fundamental theorems about tangles in graphs: the tree-of-tangles theorem, which says that every graph has a tree-decomposition such that distinguishable tangles live in different nodes of the tree, and the…
The monogamous nature of entanglement has been illustrated by the derivation of entanglement sharing inequalities - bounds on the amount of entanglement that can be shared amongst the various parts of a multipartite system. Motivated by…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
A graph $G=(V,E)$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree $T$ and two non-negative real numbers $d_{min}$ and $d_{max}$, $d_{min} \leq d_{max}$, such that each node $u \in V$ is uniquely associated to a…
We classify different theories of self-intersecting random surfaces assigning special weights to intersections. When self-intersection coupling constant $\kappa$ tends to zero, then the surface can freely inetrsect and it is completely…
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…
Consider a graph on the non-singular matrices over a finite field, in which two distinct non-singular matrices are joined by an edge whenever their sum is singular. We prove an upper bound for the independence number of this graph. As a…
We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…
While finite graphs have tree-decompositions that efficiently distinguish all their tangles, locally finite graphs with thick ends need not have such tree-decompositions. We show that every locally finite graph without thick ends admits…
In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…
It is known that every graph with n vertices embeds stochastically into trees with distortion $O(\log n)$. In this paper, we show that this upper bound is sharp for a large class of graphs. As this class of graphs contains diamond graphs,…
We analyze the coherent dynamics of excitons in three dimensional topologically disordered networks with traps. If the interactions between the nodes of the network are long ranged, i.e., algebraically decaying as a function of the distance…