Zobrazeno 1 - 10
of 184
pro vyhledávání: '"Chayes, J."'
Autor:
Bailly-Bechet, M., Borgs, C., Braunstein, A., Chayes, J., Dagkessamanskaia, A., François, J. -M., Zecchina, R.
Publikováno v:
Published online before print December 27, 2010, doi: 10.1073/pnas.1004751108 PNAS January 11, 2011 vol. 108 no. 2 882-887
External information propagates in the cell mainly through signaling cascades and transcriptional activation, allowing it to react to a wide spectrum of environmental changes. High throughput experiments identify numerous molecular components of such
Externí odkaz:
http://arxiv.org/abs/1101.4573
Motivated in part by various sequences of graphs growing under random rules (like internet models), convergent sequences of dense graphs and their limits were introduced by Borgs, Chayes, Lov\'asz, S\'os and Vesztergombi and by Lov\'asz and Szegedy.
Externí odkaz:
http://arxiv.org/abs/0905.3806
Publikováno v:
Phys. Rev. Lett. 101, 037208 (2008)
The Minimum Weight Steiner Tree (MST) is an important combinatorial optimization problem over networks that has applications in a wide range of fields. Here we discuss a general technique to translate the imposed global connectivity constrain into ma
Externí odkaz:
http://arxiv.org/abs/0807.3373
Publikováno v:
J. Stat. Mech. (2008) L06001
We consider the general problem of finding the minimum weight b-matching on arbitrary graphs. We prove that, whenever the linear programming relaxation of the problem has no fractional solutions, then the cavity or belief propagation equations conver
Externí odkaz:
http://arxiv.org/abs/0807.3159
We consider sequences of graphs and define various notions of convergence related to these sequences: ``left convergence'' defined in terms of the densities of homomorphisms from small graphs into the graphs of the sequence, and ``right convergence''
Externí odkaz:
http://arxiv.org/abs/math/0702004
We consider the RIPE WHOIS Internet data as characterized by the Cooperative Association for Internet Data Analysis (CAIDA), and show that the Tempered Preferential Attachment model [1] provides an excellent fit to this data. [1] D'Souza, Borgs, Chay
Externí odkaz:
http://arxiv.org/abs/cs/0701198
We introduce a family of one-dimensional geometric growth models, constructed iteratively by locally optimizing the tradeoffs between two competing metrics, and show that this family is equivalent to a family of preferential attachment random graph m
Externí odkaz:
http://arxiv.org/abs/cond-mat/0502205
Publikováno v:
Proceedings of the 31st International Colloquium on Automata, Languages and Programming, 208-221 (2004).
Models based on preferential attachment have had much success in reproducing the power law degree distributions which seem ubiquitous in both natural and engineered systems. Here, rather than assuming preferential attachment, we give an explanation o
Externí odkaz:
http://arxiv.org/abs/cond-mat/0402268
We consider the problem of partitioning $n$ integers into two subsets of given cardinalities such that the discrepancy, the absolute value of the difference of their sums, is minimized. The integers are i.i.d. random variables chosen uniformly from t
Externí odkaz:
http://arxiv.org/abs/cond-mat/0302536
Autor:
Borgs, C., Chayes, J. T.
We consider the covariance matrix $G^{mn}(x-y)$ of the d-dimensional q-states Potts model, rewriting it in terms of the connectivity, the finite-cluster connectivity and the infinite-cluster covariance in the random cluster repre- sentation of Fortui
Externí odkaz:
http://arxiv.org/abs/adap-org/9411001