Graphing a function

CULTURE AND THE EFECTIVENESS OF SUPPLIER DIVERSITY PROGRAMS: A TEST OF PREDICTORS Panels A and B of Figure 1.1 graph the equilibrium allocations of effectiveness ( j μ ) and district desirability ( x jδ +μ j ) as functions of family income when parents have no concern for peer group (δ = 0 , Panel A) and when concern for peer group is moderate (δ = 1.5 , Panel B).

84p mualan_mualan 25-02-2013 49 6   Download

We study random surfaces which arise as height functions of random perfect matchings (a.k.a. dimer configurations) on a weighted, bipartite, doubly periodic graph G embedded in the plane. We derive explicit formulas for the surface tension and local Gibbs measure probabilities of these models. The answers involve a certain plane algebraic curve, which is the spectral curve of the Kasteleyn operator of the graph. For example, the surface tension is the Legendre dual of the Ronkin function of the spectral curve. The amoeba of the spectral curve represents the phase diagram of the dimer model.

39p noel_noel 17-01-2013 51 7   Download

Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học tạp chí Department of Mathematic dành cho các bạn yêu thích môn toán học đề tài: Sharp threshold functions for random intersection graphs via a coupling method...

12p thulanh7 04-10-2011 41 4   Download

Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học tạp chí toán học quốc tế đề tài:Properties determined by the Ihara zeta function of a Graph...

14p thulanh8 19-09-2011 54 4   Download

Let G be a graph with vertex set V (G) = {1, . . . , n} and edge set E(G). We are interested in studying the functions of the graph G whose values belong to the interval [(G), (G)]. Here (G) is the size of the largest stable set in G and (G) is the smallest number of cliques that cover the vertices of G. It is well known (see, for example, [1]) that for some  0 it is impossible to approximate in polynomial time (G) and (G) within a factor of n, assuming P 6= NP. We suppose that better approximation could...

5p thulanh5 12-09-2011 66 4   Download

An arc-representation of a graph is a function mapping each vertex in the graph to an arc on the unit circle in such a way that adjacent vertices are mapped to intersecting arcs. The width of such a representation is the maximum number of arcs passing through a single point. The arc-width of a graph is defined to be the minimum width over all of its arc-representations. We extend the work of Bar´at and Hajnal on this subject and develop a generalization we call restricted arcwidth.

18p thulanh5 12-09-2011 56 4   Download