Results 1  10
of
1,675,577
Reviewed by András Gyárfás References
"... The Ramsey number of hypergraph cycles. I. (English summary) ..."
The Ramsey number for hypergraph cycles
 I, Journal of Combinatorial Theory, Ser. A
"... Abstract. Let Cn denote the 3uniform hypergraph loose cycle, that is the hypergraph with vertices v1,..., vn and edges v1v2v3, v3v4v5, v5v6v7,..., vn−1vnv1. We prove that every redblue colouring of the edges of the complete 3uniform hypergraph with N vertices contains a monochromatic copy of Cn, ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
Abstract. Let Cn denote the 3uniform hypergraph loose cycle, that is the hypergraph with vertices v1,..., vn and edges v1v2v3, v3v4v5, v5v6v7,..., vn−1vnv1. We prove that every redblue colouring of the edges of the complete 3uniform hypergraph with N vertices contains a monochromatic copy of Cn
On the sizeRamsey number of hypergraphs
, 2015
"... The sizeRamsey number of a graph G is the minimum number of edges in a graph H such that every 2edgecoloring of H yields a monochromatic copy of G. SizeRamsey numbers of graphs have been studied for almost 40 years with particular focus on the case of trees and bounded degree graphs. We initiate ..."
Abstract
 Add to MetaCart
initiate the study of sizeRamsey numbers for kuniform hypergraphs. Analogous to the graph case, we consider the sizeRamsey number of cliques, paths, trees, and bounded degree hypergraphs. Our results suggest that sizeRamsey numbers for hypergraphs are extremely difficult to determine, and many open
Indivisible labor and the business cycle
 Journal of Monetary Economics
, 1985
"... A growth model with shocks to technology is studied. Labor is indivisible, so all variability in hours worked is due to fluctuations in the number employed. We find that, unlike previous equilibrium models of the business cycle, this economy displays large fluctuations in hours worked and relatively ..."
Abstract

Cited by 793 (10 self)
 Add to MetaCart
A growth model with shocks to technology is studied. Labor is indivisible, so all variability in hours worked is due to fluctuations in the number employed. We find that, unlike previous equilibrium models of the business cycle, this economy displays large fluctuations in hours worked
Determining the Number of Factors in Approximate Factor Models
, 2000
"... In this paper we develop some statistical theory for factor models of large dimensions. The focus is the determination of the number of factors, which is an unresolved issue in the rapidly growing literature on multifactor models. We propose a panel Cp criterion and show that the number of factors c ..."
Abstract

Cited by 538 (29 self)
 Add to MetaCart
In this paper we develop some statistical theory for factor models of large dimensions. The focus is the determination of the number of factors, which is an unresolved issue in the rapidly growing literature on multifactor models. We propose a panel Cp criterion and show that the number of factors
House Prices, Borrowing Constraints, and Monetary Policy in the Business Cycle
, 2002
"... I develop a general equilibrium model with sticky prices, credit constraints, nominal loans and asset prices. Changes in asset prices modify agents ’ borrowing capacity through collateral value; changes in nominal prices affect real repayments through debt deflation. Monetary policy shocks move asse ..."
Abstract

Cited by 496 (10 self)
 Add to MetaCart
I develop a general equilibrium model with sticky prices, credit constraints, nominal loans and asset prices. Changes in asset prices modify agents ’ borrowing capacity through collateral value; changes in nominal prices affect real repayments through debt deflation. Monetary policy shocks move
Optimization Flow Control, I: Basic Algorithm and Convergence
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1999
"... We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm. In thi ..."
Abstract

Cited by 690 (64 self)
 Add to MetaCart
We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm. In this system sources select transmission rates that maximize their own benefits, utility minus bandwidth cost, and network links adjust bandwidth prices to coordinate the sources' decisions. We allow feedback delays to be different, substantial and timevarying, and links and sources to update at different times and with different frequencies. We provide asynchronous distributed algorithms and prove their convergence in a static environment. We present measurements obtained from a preliminary prototype to illustrate the convergence of the algorithm in a slowly timevarying environment.
A Critical Point For Random Graphs With A Given Degree Sequence
, 2000
"... Given a sequence of nonnegative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n vertices of degree i. Essentially, we show that if P i(i \Gamma 2) i ? 0 then such graphs almost surely have a giant component, while if P i(i \Gamma 2) i ! 0 the ..."
Abstract

Cited by 511 (8 self)
 Add to MetaCart
Given a sequence of nonnegative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n vertices of degree i. Essentially, we show that if P i(i \Gamma 2) i ? 0 then such graphs almost surely have a giant component, while if P i(i \Gamma 2) i ! 0
Results 1  10
of
1,675,577