The independence polynomial has been widely studied in algebraic graph theory, in statistical physics, and in algorithms for counting and sampling problems. Seminal results of Weitz (2006) and Sly (2010) have shown that in bounded-degree graphs the independence polynomial can be eXciently approximated if the argument is positive and below a certain threshold, whereas above that threshold the po...

The independence polynomial has been widely studied in algebraic graph theory, in statistical physics, and in algorithms for counting and sampling problems. Seminal results of Weitz (2006) and Sly (2010) have shown that in bounded-degree graphs the independence polynomial can be efficiently approximated if the argument is positive and below a certain threshold, whereas above that threshold the ...

In many applications, independence of event occurrences is assumed, even if there is evidence for dependence. Capturing dependence leads to complex models, and even if the complex models were superior, they fail to beat the simplicity and scalability of the independence assumption. Therefore, many models assume independence and apply heuristics to improve results. Theoretical explanations of th...

There is a class of theories of aging (variously termed adaptive aging, aging by design, aging selected for its own sake, or programmed death theories) that hold that an organism design that limits life span conveys benefits and was selected specifically because it limits life span. These theories have enjoyed a resurgence of popularity because of the discovery of genes that promote aging in va...

In this paper we prove that a polynomial system can be always mapped by some rational mapping into a general quadratic system. This result is useful for studies of systems with a complex dynamics. One generalization is discussed. Our approach is based on theorems on algebraic dependent polynomials. Key-Words:Polynomial, polynomial system, quadratic system, rational mapping, algebraic dependence...

There has been renewed interest in the physics of the so-called ‘crossover’ for current fluctuations in mesoscopic conductors, most recently involving the possibility of its appearance in the passage to the macroscopic limit. Shot noise is normally absent from solid-state conductors in the large, and its anomalous resurgence there has been ascribed to a rich interplay of drift, diffusion, and C...

The independence polynomial of a graph G is the function i(G, x) = ∑k≥0 ik xk , where ik is the number of independent sets of vertices in G of cardinality k. We prove that real roots of independence polynomials are dense in (−∞, 0], while complex roots are dense in C, even when restricting to well covered or comparability graphs. Throughout, we exploit the fact that independence polynomials are...