Reichenbachian Common Cause Systems
|
|
- Priscilla Andrews
- 6 years ago
- Views:
Transcription
1 Reichenbachian Common Cause Systems G. Hofer-Szabó Department of Phiosophy Technica University of Budapest e-mai: Mikós Rédei Department of History and Phiosophy of Science Eötvös University, Budapest e-mai: Forthcoming in Internationa Journa of Theoretica Physics Abstract A partition {C i } i I of a Booean agebra S in a probabiity measure space (S, p) is caed a Reichenbachian common cause system for the correated pair A, B of events in S if any two eements in the partition behave ike a Reichenbachian common cause and its compement, the cardinaity of the index set I is caed the size of the common cause system. It is shown that given any correation in (S, p), and given any finite size n > 2, the probabiity space (S, p) can be embedded into a arger probabiity space in such a manner that the arger space contains a Reichenbachian common cause system of size n for the correation. It aso is shown that every totay ordered subset in the partiay ordered set of a partitions of S contains ony one Reichenbachian common cause system. Some open probems concerning Reichenbachian common cause systems are formuated. 1 Reichenbach s notion of common cause Let (S, p) be a cassica probabiity space with Booean agebra S of random events and probabiity measure p on S. If the oint probabiity p(a B) of A and B is greater than the product of the singe probabiities, i.e. if p(a B) > p(a)p(b) (1) then the events A and B are said to be (positivey) correated and the quantity Corr(A, B) p(a B) p(a)p(b) (2) is caed the correation of A and B. According to Reichenbach [13], Section 19, a probabiistic common cause of a correation such as (1) is an event C (common cause) that satisfies the four conditions specified in the next definition. Definition 1 C is a Reichenbachian common cause of the correation (1) if the foowing (independent) conditions hod: p(a B C) = p(a C)p(B C) (3) p(a B C ) = p(a C )p(b C ) (4) p(a C) > p(a C ) (5) p(b C) > p(b C ) (6) where p(x Y ) = p(x Y )/p(y ) denotes the conditiona probabiity of X on condition Y, C denotes the compement of C and it is assumed that none of the probabiities p(x), (X = A, B, C, C ) is equa to zero. 1
2 We sha occasionay refer to conditions (3)-(6) as Reichenbach(ian) conditions. It is standard terminoogy to ca (3)-(4) screening-off conditions and to say that C (and aso C ) screens off the correation between A and B. To excude trivia common causes we ca a common cause C proper if it differs from both A and B by more than a measure zero event. In what foows common cause wi aways mean a proper common cause. Reichenbach prooves the foowing proposition. Proposition 1 If the events A, B, C satisfy the Reichenbachian conditions (3)-(6) then there is a positive correation between A and B. The significance of Proposition 1 is that it shows in what sense a common cause expains a correation: from the assumption that A, B and C satisfy the Reichenbachian conditins one can derive (equivaenty: predict) that A and B are (positivey) correated this is an instance of expanation in the sense of Hempe. Reichenbach s proof of Proposition 1 is based on the foowing Lemma, which, for ater purposes, we spe out in a sighty more genera form than used by Reichenbach. Before stating the emma et us reca that the set of events {C i S i I} is a partition of S if i C i = Ω (Ω being the unit in S) and C i C = if i.) Lemma: Let {C i } i I be a partition of S and et A, B S be arbitrary eements. If p(a B C i ) = p(a C i )p(b C i ) for a i I then we have p(a B) p(a)p(b) = 1 p(c i )p(c )[p(a C i ) p(a C )][p(b C i ) p(b C )] (7) 2 i Appying Lemma (proof of which is eft to the reader) with C 1 = C and C 2 = C one obtains p(a B) p(a)p(b) = p(c)p(c )[p(a C) p(a C )][p(b C) p(b C )] (8) which is the formua Reichenbach uses in showing Proposition 1. Eq. (8) impies that Corr(A, B) is indeed positive if (5)-(6) hod. Eq. (8) aso shows, however, that for Corr(A, B) to be positive (5)-(6) are sufficient but not necessary: positivity of Corr(A, B) is impied by the positivity of the right hand side of (8); hence, what is decisive from the point of view of the expanatory power of the comon cause is that [p(a C) p(a C )] and [p(b C) p(b C )] have the same sign. It aso is cear from (8) that a common cause can expain negative correations in ust the same way as it can expain positive ones: if C and C are such that screening off conditions (3)-(4) hod and [p(a C) p(a C )] and [p(b C) p(b C )] have opposite signs, then the right hand side of (8) is negative, hence existence of such a C entais the negative correation. A what foows can be modified triviay in order to cover the case of negative correation, and a statements presented beow remain vaid in the case of negative correations; however, to simpify notation we restrict ourseves to positive correations. To sum up: the intuitive idea behind expaining by a Reichenbachian common cause a correation between A and B in a statistica ensembe is that one shoud be abe to cut the statistica ensembe by a pair of orthogona events (C and C ) into two disoint parts in such a way that (i) the correation disappears in both of the resuting subensembes (this is expressed by the two screening off conditions); and (ii) one of the subensembes shoud increase the probabiity of both A and B (which is the content of the requirement of [p(a C) p(a C )] and [p(b C) p(b C )] having the same sign). 2 The notion of a Reichenbachian common cause system It is easy to see that there exist common cause incompete probabiity spaces (S, p), i.e. probabiity spaces that contain a pair of correated events without containing a (proper) common cause of the correation. Existence of such common cause incompete probabiity spaces can be a threat to what has become caed Reichenbach s Common Cause Principe (RCCP): Given a correation Corr(A, B) > 0, either there is a direct causa infuence between A and B that can be hed responsibe for the correation, or there exists a common cause in the sense of Definition 1 that expains the correation. So if one sees a correation between A and B and has good reasons to think that the correated events A, B in (S, p) cannot infuence each other causay and yet there exists no common cause in S of the correation Corr(A, B), then the suspicion arises that RCCP might not hod. Confronted with a common cause incompete probabiity space (S, p) in which a direct causa infuence between the correated events is excuded, one can have in principe two strategies aiming at saving RCCP: One may try to argue that S is not rich enough to contain a common cause 2
3 but there might exist a arger (S, p ) that aready contains a common cause of the correation (see Definition 3 beow for what it means to enarge (S, p) into (S, p )). It was shown in a previous paper that this strategy aways works in the sense that it is aways possibe to enarge (S, p) in such a way that the enarged space aready contains an event C that satisfies the Reichenbachian conditions (see [4]). Another natura idea is to suspect that the correation between A and B is not due to a singe factor but may be the cumuative resut of a (possiby arge) number of different partia common causes, none of which can in and by itsef yied a compete common-cause-type expanation of the correation, a of which, taken together, can however account for the entire correation. Expaining a correation by such a system of partia common causes woud mean that one can partition the statistica ensembe into more than two subensembes in such a manner that (i) the correation disappears in each of the subensembes, (ii) any pair of such subensembes behaves ike the two subensembes determined by the pair C, C in the Definition 1 of common cause and (iii) the totaity of partia common causes expains the correation in the sense of entaiing it. A mathematicay expicit formuation of this idea is speed out in the next definition. Definition 2 Let (S, p) be a probabiity space and A, B two events in S. The partition {C i } i I of S is said to be a Reichenbachian common cause system (RCC system for short) for the pair A, B if the foowing two conditions are satisfied p(a B C i ) = p(a C i )p(b C i ) for a i I (9) [p(a C i) p(a C )][p(b C i) p(b C )] > 0 (i ) (10) The above definition is a natura generaization of Reichenbach s origina definition of common cause to the case when more than one singe factor contributes to a correation. The cardinaity of the index set I (i.e. the number of events in the partition) is caed the size of the RCCS. Since C, C with a Reichenbachian common cause C is a RCCS of size 2, we ca a RCCS proper if its size is greater than 2. The next proposition shows that a Reichenbachian common cause system aso has expanatory power exacty in the sense in which a singe common cause does: Proposition 2 Let the partition {C i } i I of S be a Reichenbachian common cause system for the pair A, B. Then the eements A and B are positiey correated. Proof: The statement in the proposition is an immediate coroary of Lemma and the definition of the notion of Reichenbachian common cause system. 3 Existence and uniqueness of Reichenbachian common cause systems It is not obvious that proper Reichenbachian common cause systems exist. It is not difficut however to give an exampe of a probabiity space (S, p) containing a pair of correated events A, B for which there exists no common cause in S but there exists in S a Reichenbachian common cause system of size 3 (see [8]). This exampe aso shows that the intuition mentioned in Section 2 is correct: there are cases when an expanation of a correation with the hep of a singe common cause is impossibe within the bounds of a given event structure; yet the event structure is rich enough to contain a proper RCCS that can expain the correation. It is not difficut however to find probabiity spaces that contain neither a (proper) common cause nor a proper Reichenbachian common cause system. As it was mentioned in Section 2 it is known that such common cause incompete probabiity spaces can aways be extended in such a way that the extension contains a common cause of the given correation. More is true, however: on can show that any probabiity space can be extended in such a way that the arger probabiity space contains a Reichenbachian common cause system consisting of a arge number of events. Before speing out the precise proposition et us reca the definition of an extension (S, p ) of a probabiity space (S, p): Definition 3 (S, p ) is caed an extension of (S, p) if there exists an inective attice homomorphism (embedding) h: S S (preserving aso the orthocompementation) such that p (h(x)) = p(x) for a X S (11) Proposition 3 Let (S, p) be a cassica probabiity space and n be an arbitrary finite natura number greater than 2. There exists then an extension (S, p ) of (S, p) such that (S, p ) contains a Reichenbachian common cause system of size n. 3
4 (See [8] for the ong and tedious proof of this proposition.) Proposition 3 shows that RCCS s of arbitrary finite size exist. Probem Do Reichenbachian common cause systems of countaby infinite size exist? The answer to the above question is not known; we conecture that RCCS s of infinite size aso exist. A given correation Corr(A, B) in probabiity space (S, p) can possess two or more Reichenbachian common causes. Simiary, a correation can have more than two proper Reichenbachian common cause systems (this being a consequence of Proposition 3); however, the different RCCS s cannot be arbitrariy ocated in the event structure S. To formuate the proposition constraining the ocation of RCCS s in S, consider the set P of a partitions of S. Let P 1 = {Ci 1 } i I and P 2 = {C 2 } J be two partitions in P. The partition P 1 is defined to be finer than P 2 (equivaenty: P 2 is defined to be coarser than P 1 ) (notation P 1 P 2 ) if for every Ci 2 P 2 there exist C 1 P i 1 ( i L J) such that Ci 2 = i LC1. P i 1 is caed stricty finer (coarser) than P 2 if P 1 is finer (coarser) than P 2 and P 1 P 2. The reation is a partia ordering on P, and the terminoogy (stricty) finer and (stricty) coarser ) appies to RCCS s as we since RCCS s are partitions. Proposition 4 If {C i } i=n i=1 is a Reichenbachian common cause system in (S, p) for the pair A, B, then there exists in (S, p) neither stricty finer nor stricty coarser Reichenbachian common cause system for A, B. Proof: Assume that {C 2 } =m =1 is a RCCS stricty coarser than the RCCS {C1 i } i=n i=1 (n > m). There exist then a C 2 such that for some C 1 P i 1 with i L and L having the cardinaity of at east 2, we have C 2 = i. Consider the probabiity measure space (S LC1 i C 2, p( C 2 )) where S C 2 = {X C 2 X S} (12) and where p( C 2 ) is the conditiona probabiity measure of p with respect to the conditioning event C 2. By the definition of {C 2 } =m =1 as a Reichenbachian common cause system, the events A and B are statisticay independent with respect to the probabiity measure p( C 2 ), i.e. p(a B C 2 ) = p(a C 2 )p(b C 2 ) (13) On the other hand, the events C 1 (i i L) form Reichenbachian common cause system in (S C 2, p( C 2 )) with respect to the events (A C 2 ) and (B C 2 ); hence, by Proposition 2 there is a positive correation between (A C 2 ) and (B C 2 ) in the measure p( C 2 ) i.e. we have p((a C 2 ) (B C 2 ) C 2 ) > p(a C 2 C 2 )p(b C 2 C 2 ) (14) which contradicts (13). So the assumption of existence of two, different RCCS s that are in the finer-coarser reation has ed to contradiction, so the proposition is proved. 4 Concuding remarks We can express the content of Proposition 4 in the foowing way: any totay ordered subset of partitions in (S, p) contains ony one Reichenbachian common cause system for a given fixed pair of events A, B S. So whie there may exist many RCCS s for a given correated pair, the different RCCS s provide different sorts of expanations of the correation between A and B. In particuar, different Reichenbachian common cause systems cannot be put together to form a finer RCCS that woud provide a more detaied expanation of the correation. This aso impies that the partition of (S, p) generated in the natura manner by different Reichenbachian common causes C i S does not yied a RCCS; hence the non-uniqueness of Reichenbachian common causes cannot be expained by saying that the different common causes are ust coarse-grained manifestations of a deeper, finer underying Reichenbachian common cause system. Given two correations Corr(A i, B i ) > 0 (i = 1, 2) in (S, p), the event C S is caed a common common cause of the two correations if it is a common cause of both Corr(A 1, B 1) > 0 and Corr(A 2, B 2 ) > 0. It is known that common causes are not in genera common common causes, i.e. that there exist two correations in a probabiity space that cannot have a common common cause (see [7] and [1] for resuts concerning necessary and sufficient conditions impying the existsence of common common causes). The notion of a Reichenbachian common common cause system aso is a meaningfu concept and it woud be interesting to find necessary and sufficient conditions for a set of correations to have a Reichenbachian common common cause system. 4
5 Motivated by considerations somewhat different from the one in this paper, the probem of a common cause system is raised aso in [9], where a common cause system (caed mutipe common cause ) is defined to be a finite partition possessing the screening off property (eq. (9)) ony (pus some mathematicay not expicit requirement concerning the spatiotempora ocation of the events C i (i = 1, 2,... n) and A, B, see Definition 3.3 in [9]). Thus the notion of RCCS defined in the present paper is different from the one proposed in [9]. We wish to point out in this regard that without some requirement in addition to (9) such as (10), the notion of common cause system becomes trivia: for instance, the set of atoms in any finite Booean agebra form a partition for which the screening off condition (9) hods; hence a probabiity measure spaces with a finite Booean agebra possess a common common cause system, which seems counterintuitive. A Reichenbachian common cause system as defined in the present paper is a much stronger notion. Reichenbach s notion of common cause can naturay be adapted to quantum probabiity spaces (L, p), where L is a non-distributive, orthomoduar attice and where p is an additive (generaized) bounded measure on L (see [12], [10], [11], [4], [6]; for some other attempts see [2] and [3]). The notion of Reichenbachian common cause system aso can easiy be generaized to the non-commutative case aong the ideas foowed in this paper. Probems and questions concerning non-commutative Reichenbachian common cause systems paraeing the ones treated here aso can be formuated, no resuts are known, however, on the non-commutative case. Acknowedgement: Work supported by OTKA, contract numbers: T , TS 04089, T , T and T References [1] D. Danks and C. Gymour: Linearity properties of Bayes nets with binary variabes, in J. Breese and D. Koer (eds.), Uncertainty in Artificia Inteigence: Proceedings of the 17th Conference (UAI-2001), Morgan Kaufmann, San Francisco, 2001, [2] G. Hofer-Szabó: The forma existence and uniqueness of the Reichenbachian common cause on Hibert attices Internationa Journa of Theoretica Physics 36 (1997) [3] G. Hofer-Szabó: Reichenbach s common cause definition on Hibert attices Internationa Journa of Theoretica Physics 37 (1998) [4] G. Hofer-Szabó, M. Rédei and L.E. Szabó: On Reichenbach s common cause principe and Reichenbach s notion of common cause The British Journa for the Phiosophy of Science 50 (1999) [5] G. Hofer-Szabó, M. Rédei and L.E. Szabó: Common cause competabiity of cassica and quantum probabiity spaces Internationa Journa of Theoretica Physics 39 (2000) [6] G. Hofer-Szabó, M. Rédei and L.E. Szabó: Reichenbach s Common Cause Principe: Recent resuts and open probems Reports on Phiosophy Nr. 20, (2000) [7] G. Hofer-Szabó, M. Rédei and Szabó, L.E. Common-causes are not common common-causes manuscript, submitted, preprint: [8] G. Hofer-Szabó and M. Rédei: Reichenbachian common cause systems of arbitrary finite size exist manuscript, submitted [9] T. Pacek: Is Nature Deetrministic?, Jageonian University Press, Cracow, 2000 [10] M. Rédei: Reichenbach s Common Cause Principe and quantum fied theory Foundations of Physics 27 (1997) [11] M. Rédei: Quantum Logic in Agebraic Approach, Dordrecht: Kuwer Academic Pubishers, 1998 [12] M. Rédei and S.J. Summers: Loca primitive causaity and the common cause principe in quantum fied theory Foundations of Physics 32 (2002) [13] H. Reichenbach: The Direction of Time, Los Angees: University of Caifornia Press,
The Group Structure on a Smooth Tropical Cubic
The Group Structure on a Smooth Tropica Cubic Ethan Lake Apri 20, 2015 Abstract Just as in in cassica agebraic geometry, it is possibe to define a group aw on a smooth tropica cubic curve. In this note,
More informationProblem set 6 The Perron Frobenius theorem.
Probem set 6 The Perron Frobenius theorem. Math 22a4 Oct 2 204, Due Oct.28 In a future probem set I want to discuss some criteria which aow us to concude that that the ground state of a sef-adjoint operator
More informationCS229 Lecture notes. Andrew Ng
CS229 Lecture notes Andrew Ng Part IX The EM agorithm In the previous set of notes, we taked about the EM agorithm as appied to fitting a mixture of Gaussians. In this set of notes, we give a broader view
More informationGeneralized Bell polynomials and the combinatorics of Poisson central moments
Generaized Be poynomias and the combinatorics of Poisson centra moments Nicoas Privaut Division of Mathematica Sciences Schoo of Physica and Mathematica Sciences Nanyang Technoogica University SPMS-MAS-05-43,
More informationXSAT of linear CNF formulas
XSAT of inear CN formuas Bernd R. Schuh Dr. Bernd Schuh, D-50968 Kön, Germany; bernd.schuh@netcoogne.de eywords: compexity, XSAT, exact inear formua, -reguarity, -uniformity, NPcompeteness Abstract. Open
More informationCausal completeness of probability theories results and open problems
Causal completeness of probability theories results and open problems Miklós Rédei Department of Philosophy, Logic and Scientific Method London School of Economics and Political Science Houghton Street
More informationOn the Goal Value of a Boolean Function
On the Goa Vaue of a Booean Function Eric Bach Dept. of CS University of Wisconsin 1210 W. Dayton St. Madison, WI 53706 Lisa Heerstein Dept of CSE NYU Schoo of Engineering 2 Metrotech Center, 10th Foor
More information(f) is called a nearly holomorphic modular form of weight k + 2r as in [5].
PRODUCTS OF NEARLY HOLOMORPHIC EIGENFORMS JEFFREY BEYERL, KEVIN JAMES, CATHERINE TRENTACOSTE, AND HUI XUE Abstract. We prove that the product of two neary hoomorphic Hece eigenforms is again a Hece eigenform
More informationSTABLE GRAPHS BENJAMIN OYE
STABLE GRAPHS BENJAMIN OYE Abstract. In Reguarity Lemmas for Stabe Graphs [1] Maiaris and Sheah appy toos from mode theory to obtain stronger forms of Ramsey's theorem and Szemeredi's reguarity emma for
More informationMARKOV CHAINS AND MARKOV DECISION THEORY. Contents
MARKOV CHAINS AND MARKOV DECISION THEORY ARINDRIMA DATTA Abstract. In this paper, we begin with a forma introduction to probabiity and expain the concept of random variabes and stochastic processes. After
More informationA Brief Introduction to Markov Chains and Hidden Markov Models
A Brief Introduction to Markov Chains and Hidden Markov Modes Aen B MacKenzie Notes for December 1, 3, &8, 2015 Discrete-Time Markov Chains You may reca that when we first introduced random processes,
More informationOn colorings of the Boolean lattice avoiding a rainbow copy of a poset arxiv: v1 [math.co] 21 Dec 2018
On coorings of the Booean attice avoiding a rainbow copy of a poset arxiv:1812.09058v1 [math.co] 21 Dec 2018 Baázs Patkós Afréd Rényi Institute of Mathematics, Hungarian Academy of Scinces H-1053, Budapest,
More informationSeparation of Variables and a Spherical Shell with Surface Charge
Separation of Variabes and a Spherica She with Surface Charge In cass we worked out the eectrostatic potentia due to a spherica she of radius R with a surface charge density σθ = σ cos θ. This cacuation
More informationAST 418/518 Instrumentation and Statistics
AST 418/518 Instrumentation and Statistics Cass Website: http://ircamera.as.arizona.edu/astr_518 Cass Texts: Practica Statistics for Astronomers, J.V. Wa, and C.R. Jenkins, Second Edition. Measuring the
More informationPeriods and Borders of Random Words
Periods and Borders of Random Words Štěpán Houb and Jeffrey Shait 2 Department of Agebra, Facuty of Mathematics and Physics, Chares University, Prague, Czech Repubic houb@karin.mff.cuni.cz 2 Schoo of Computer
More informationBayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with?
Bayesian Learning A powerfu and growing approach in machine earning We use it in our own decision making a the time You hear a which which coud equay be Thanks or Tanks, which woud you go with? Combine
More informationPricing Multiple Products with the Multinomial Logit and Nested Logit Models: Concavity and Implications
Pricing Mutipe Products with the Mutinomia Logit and Nested Logit Modes: Concavity and Impications Hongmin Li Woonghee Tim Huh WP Carey Schoo of Business Arizona State University Tempe Arizona 85287 USA
More informationTHE REACHABILITY CONES OF ESSENTIALLY NONNEGATIVE MATRICES
THE REACHABILITY CONES OF ESSENTIALLY NONNEGATIVE MATRICES by Michae Neumann Department of Mathematics, University of Connecticut, Storrs, CT 06269 3009 and Ronad J. Stern Department of Mathematics, Concordia
More informationADELIC ANALYSIS AND FUNCTIONAL ANALYSIS ON THE FINITE ADELE RING. Ilwoo Cho
Opuscua Math. 38, no. 2 208, 39 85 https://doi.org/0.7494/opmath.208.38.2.39 Opuscua Mathematica ADELIC ANALYSIS AND FUNCTIONAL ANALYSIS ON THE FINITE ADELE RING Iwoo Cho Communicated by.a. Cojuhari Abstract.
More informationMIXING AUTOMORPHISMS OF COMPACT GROUPS AND A THEOREM OF SCHLICKEWEI
MIXING AUTOMORPHISMS OF COMPACT GROUPS AND A THEOREM OF SCHLICKEWEI KLAUS SCHMIDT AND TOM WARD Abstract. We prove that every mixing Z d -action by automorphisms of a compact, connected, abeian group is
More information4 Separation of Variables
4 Separation of Variabes In this chapter we describe a cassica technique for constructing forma soutions to inear boundary vaue probems. The soution of three cassica (paraboic, hyperboic and eiptic) PDE
More informationFRIEZE GROUPS IN R 2
FRIEZE GROUPS IN R 2 MAXWELL STOLARSKI Abstract. Focusing on the Eucidean pane under the Pythagorean Metric, our goa is to cassify the frieze groups, discrete subgroups of the set of isometries of the
More informationarxiv:quant-ph/ v3 6 Jan 1995
arxiv:quant-ph/9501001v3 6 Jan 1995 Critique of proposed imit to space time measurement, based on Wigner s cocks and mirrors L. Diósi and B. Lukács KFKI Research Institute for Partice and Nucear Physics
More informationSUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS
ISEE 1 SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS By Yingying Fan and Jinchi Lv University of Southern Caifornia This Suppementary Materia
More informationThe ordered set of principal congruences of a countable lattice
The ordered set of principa congruences of a countabe attice Gábor Czédi To the memory of András P. Huhn Abstract. For a attice L, et Princ(L) denote the ordered set of principa congruences of L. In a
More informationORTHOGONAL MULTI-WAVELETS FROM MATRIX FACTORIZATION
J. Korean Math. Soc. 46 2009, No. 2, pp. 281 294 ORHOGONAL MLI-WAVELES FROM MARIX FACORIZAION Hongying Xiao Abstract. Accuracy of the scaing function is very crucia in waveet theory, or correspondingy,
More informationVolume 13, MAIN ARTICLES
Voume 13, 2009 1 MAIN ARTICLES THE BASIC BVPs OF THE THEORY OF ELASTIC BINARY MIXTURES FOR A HALF-PLANE WITH CURVILINEAR CUTS Bitsadze L. I. Vekua Institute of Appied Mathematics of Iv. Javakhishvii Tbiisi
More informationAlberto Maydeu Olivares Instituto de Empresa Marketing Dept. C/Maria de Molina Madrid Spain
CORRECTIONS TO CLASSICAL PROCEDURES FOR ESTIMATING THURSTONE S CASE V MODEL FOR RANKING DATA Aberto Maydeu Oivares Instituto de Empresa Marketing Dept. C/Maria de Moina -5 28006 Madrid Spain Aberto.Maydeu@ie.edu
More informationA CLUSTERING LAW FOR SOME DISCRETE ORDER STATISTICS
J App Prob 40, 226 241 (2003) Printed in Israe Appied Probabiity Trust 2003 A CLUSTERING LAW FOR SOME DISCRETE ORDER STATISTICS SUNDER SETHURAMAN, Iowa State University Abstract Let X 1,X 2,,X n be a sequence
More informationPartial permutation decoding for MacDonald codes
Partia permutation decoding for MacDonad codes J.D. Key Department of Mathematics and Appied Mathematics University of the Western Cape 7535 Bevie, South Africa P. Seneviratne Department of Mathematics
More informationPowers of Ideals: Primary Decompositions, Artin-Rees Lemma and Regularity
Powers of Ideas: Primary Decompositions, Artin-Rees Lemma and Reguarity Irena Swanson Department of Mathematica Sciences, New Mexico State University, Las Cruces, NM 88003-8001 (e-mai: iswanson@nmsu.edu)
More informationFOURIER SERIES ON ANY INTERVAL
FOURIER SERIES ON ANY INTERVAL Overview We have spent considerabe time earning how to compute Fourier series for functions that have a period of 2p on the interva (-p,p). We have aso seen how Fourier series
More informationK a,k minors in graphs of bounded tree-width *
K a,k minors in graphs of bounded tree-width * Thomas Böhme Institut für Mathematik Technische Universität Imenau Imenau, Germany E-mai: tboehme@theoinf.tu-imenau.de and John Maharry Department of Mathematics
More informationMat 1501 lecture notes, penultimate installment
Mat 1501 ecture notes, penutimate instament 1. bounded variation: functions of a singe variabe optiona) I beieve that we wi not actuay use the materia in this section the point is mainy to motivate the
More informationOn nil-mccoy rings relative to a monoid
PURE MATHEMATICS RESEARCH ARTICLE On ni-mccoy rings reative to a monoid Vahid Aghapouramin 1 * and Mohammad Javad Nikmehr 2 Received: 24 October 2017 Accepted: 29 December 2017 First Pubished: 25 January
More informationarxiv:math/ v2 [math.ag] 12 Jul 2006
GRASSMANNIANS AND REPRESENTATIONS arxiv:math/0507482v2 [math.ag] 12 Ju 2006 DAN EDIDIN AND CHRISTOPHER A. FRANCISCO Abstract. In this note we use Bott-Bore-Wei theory to compute cohomoogy of interesting
More informationarxiv: v1 [math.co] 12 May 2013
EMBEDDING CYCLES IN FINITE PLANES FELIX LAZEBNIK, KEITH E. MELLINGER, AND SCAR VEGA arxiv:1305.2646v1 [math.c] 12 May 2013 Abstract. We define and study embeddings of cyces in finite affine and projective
More informationC. Fourier Sine Series Overview
12 PHILIP D. LOEWEN C. Fourier Sine Series Overview Let some constant > be given. The symboic form of the FSS Eigenvaue probem combines an ordinary differentia equation (ODE) on the interva (, ) with a
More informationJENSEN S OPERATOR INEQUALITY FOR FUNCTIONS OF SEVERAL VARIABLES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Voume 128, Number 7, Pages 2075 2084 S 0002-99390005371-5 Artice eectronicay pubished on February 16, 2000 JENSEN S OPERATOR INEQUALITY FOR FUNCTIONS OF
More informationPREPUBLICACIONES DEL DEPARTAMENTO DE ÁLGEBRA DE LA UNIVERSIDAD DE SEVILLA
EUBLICACIONES DEL DEATAMENTO DE ÁLGEBA DE LA UNIVESIDAD DE SEVILLA Impicit ideas of a vauation centered in a oca domain F. J. Herrera Govantes, M. A. Oaa Acosta, M. Spivakovsky, B. Teissier repubicación
More informationu(x) s.t. px w x 0 Denote the solution to this problem by ˆx(p, x). In order to obtain ˆx we may simply solve the standard problem max x 0
Bocconi University PhD in Economics - Microeconomics I Prof M Messner Probem Set 4 - Soution Probem : If an individua has an endowment instead of a monetary income his weath depends on price eves In particuar,
More informationOn Non-Optimally Expanding Sets in Grassmann Graphs
ectronic Cooquium on Computationa Compexity, Report No. 94 (07) On Non-Optimay xpanding Sets in Grassmann Graphs Irit Dinur Subhash Khot Guy Kinder Dor Minzer Mui Safra Abstract The paper investigates
More information#A48 INTEGERS 12 (2012) ON A COMBINATORIAL CONJECTURE OF TU AND DENG
#A48 INTEGERS 12 (2012) ON A COMBINATORIAL CONJECTURE OF TU AND DENG Guixin Deng Schoo of Mathematica Sciences, Guangxi Teachers Education University, Nanning, P.R.China dengguixin@ive.com Pingzhi Yuan
More informationIntegrating Factor Methods as Exponential Integrators
Integrating Factor Methods as Exponentia Integrators Borisav V. Minchev Department of Mathematica Science, NTNU, 7491 Trondheim, Norway Borko.Minchev@ii.uib.no Abstract. Recenty a ot of effort has been
More informationEfficiently Generating Random Bits from Finite State Markov Chains
1 Efficienty Generating Random Bits from Finite State Markov Chains Hongchao Zhou and Jehoshua Bruck, Feow, IEEE Abstract The probem of random number generation from an uncorreated random source (of unknown
More informationAn explicit Jordan Decomposition of Companion matrices
An expicit Jordan Decomposition of Companion matrices Fermín S V Bazán Departamento de Matemática CFM UFSC 88040-900 Forianópois SC E-mai: fermin@mtmufscbr S Gratton CERFACS 42 Av Gaspard Coriois 31057
More information14 Separation of Variables Method
14 Separation of Variabes Method Consider, for exampe, the Dirichet probem u t = Du xx < x u(x, ) = f(x) < x < u(, t) = = u(, t) t > Let u(x, t) = T (t)φ(x); now substitute into the equation: dt
More informationPattern Frequency Sequences and Internal Zeros
Advances in Appied Mathematics 28, 395 420 (2002 doi:10.1006/aama.2001.0789, avaiabe onine at http://www.ideaibrary.com on Pattern Frequency Sequences and Interna Zeros Mikós Bóna Department of Mathematics,
More informationOn the construction of bivariate exponential distributions with an arbitrary correlation coefficient
Downoaded from orbit.dtu.d on: Sep 23, 208 On the construction of bivariate exponentia distributions with an arbitrary correation coefficient Badt, Mogens; Niesen, Bo Friis Pubication date: 2008 Document
More informationA NOTE ON QUASI-STATIONARY DISTRIBUTIONS OF BIRTH-DEATH PROCESSES AND THE SIS LOGISTIC EPIDEMIC
(January 8, 2003) A NOTE ON QUASI-STATIONARY DISTRIBUTIONS OF BIRTH-DEATH PROCESSES AND THE SIS LOGISTIC EPIDEMIC DAMIAN CLANCY, University of Liverpoo PHILIP K. POLLETT, University of Queensand Abstract
More informationarxiv: v1 [math.co] 17 Dec 2018
On the Extrema Maximum Agreement Subtree Probem arxiv:1812.06951v1 [math.o] 17 Dec 2018 Aexey Markin Department of omputer Science, Iowa State University, USA amarkin@iastate.edu Abstract Given two phyogenetic
More informationSupplementary Appendix (not for publication) for: The Value of Network Information
Suppementary Appendix not for pubication for: The Vaue of Network Information Itay P. Fainmesser and Andrea Gaeotti September 6, 03 This appendix incudes the proof of Proposition from the paper "The Vaue
More informationCausal completeness in general probability theories
Causal completeness in general probability theories B. Gyenis (gyepi@pitt.edu) Department of History and Philosophy of Science University of Pittsburgh M. Rédei (redei@ludens.elte.hu) Department of Philosophy,
More information4 1-D Boundary Value Problems Heat Equation
4 -D Boundary Vaue Probems Heat Equation The main purpose of this chapter is to study boundary vaue probems for the heat equation on a finite rod a x b. u t (x, t = ku xx (x, t, a < x < b, t > u(x, = ϕ(x
More informationAppendix of the Paper The Role of No-Arbitrage on Forecasting: Lessons from a Parametric Term Structure Model
Appendix of the Paper The Roe of No-Arbitrage on Forecasting: Lessons from a Parametric Term Structure Mode Caio Ameida cameida@fgv.br José Vicente jose.vaentim@bcb.gov.br June 008 1 Introduction In this
More informationCoupling of LWR and phase transition models at boundary
Couping of LW and phase transition modes at boundary Mauro Garaveo Dipartimento di Matematica e Appicazioni, Università di Miano Bicocca, via. Cozzi 53, 20125 Miano Itay. Benedetto Piccoi Department of
More informationSelmer groups and Euler systems
Semer groups and Euer systems S. M.-C. 21 February 2018 1 Introduction Semer groups are a construction in Gaois cohomoogy that are cosey reated to many objects of arithmetic importance, such as cass groups
More informationHomogeneity properties of subadditive functions
Annaes Mathematicae et Informaticae 32 2005 pp. 89 20. Homogeneity properties of subadditive functions Pá Burai and Árpád Száz Institute of Mathematics, University of Debrecen e-mai: buraip@math.kte.hu
More informationResearch Article On the Lower Bound for the Number of Real Roots of a Random Algebraic Equation
Appied Mathematics and Stochastic Anaysis Voume 007, Artice ID 74191, 8 pages doi:10.1155/007/74191 Research Artice On the Lower Bound for the Number of Rea Roots of a Random Agebraic Equation Takashi
More informationUniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly conp-complete
Uniprocessor Feasibiity of Sporadic Tasks with Constrained Deadines is Strongy conp-compete Pontus Ekberg and Wang Yi Uppsaa University, Sweden Emai: {pontus.ekberg yi}@it.uu.se Abstract Deciding the feasibiity
More informationCollapse of the quantum wavefunction and Welcher-Weg (WW) experiments
Coapse of the quantum wavefunction Wecher-Weg (WW) experiments Y.Ben-Aryeh Physics Department, Technion-Israe Institute of Technoogy, Haifa, 3000 Israe e-mai: phr65yb@ph.technion.ac.i Absstract The 'coapse'
More information6 Wave Equation on an Interval: Separation of Variables
6 Wave Equation on an Interva: Separation of Variabes 6.1 Dirichet Boundary Conditions Ref: Strauss, Chapter 4 We now use the separation of variabes technique to study the wave equation on a finite interva.
More informationProblem Set 6: Solutions
University of Aabama Department of Physics and Astronomy PH 102 / LeCair Summer II 2010 Probem Set 6: Soutions 1. A conducting rectanguar oop of mass M, resistance R, and dimensions w by fas from rest
More informationEfficient Generation of Random Bits from Finite State Markov Chains
Efficient Generation of Random Bits from Finite State Markov Chains Hongchao Zhou and Jehoshua Bruck, Feow, IEEE Abstract The probem of random number generation from an uncorreated random source (of unknown
More informationMATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES
MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES Separation of variabes is a method to sove certain PDEs which have a warped product structure. First, on R n, a inear PDE of order m is
More informationGeneralised colouring sums of graphs
PURE MATHEMATICS RESEARCH ARTICLE Generaised coouring sums of graphs Johan Kok 1, NK Sudev * and KP Chithra 3 Received: 19 October 015 Accepted: 05 January 016 First Pubished: 09 January 016 Corresponding
More informationSupersaturation for Ramsey-Turán problems
Supersaturation for Ramsey-Turán probems Dhruv Mubayi Vojtĕch Röd Apri 8, 005 Abstract For an -graph G, the Turán number ex(n, G is the maximum number of edges in an n-vertex -graph H containing no copy
More informationMONTE CARLO SIMULATIONS
MONTE CARLO SIMULATIONS Current physics research 1) Theoretica 2) Experimenta 3) Computationa Monte Caro (MC) Method (1953) used to study 1) Discrete spin systems 2) Fuids 3) Poymers, membranes, soft matter
More informationSymbolic models for nonlinear control systems using approximate bisimulation
Symboic modes for noninear contro systems using approximate bisimuation Giordano Poa, Antoine Girard and Pauo Tabuada Abstract Contro systems are usuay modeed by differentia equations describing how physica
More informationTHE THREE POINT STEINER PROBLEM ON THE FLAT TORUS: THE MINIMAL LUNE CASE
THE THREE POINT STEINER PROBLEM ON THE FLAT TORUS: THE MINIMAL LUNE CASE KATIE L. MAY AND MELISSA A. MITCHELL Abstract. We show how to identify the minima path network connecting three fixed points on
More informationDavid Eigen. MA112 Final Paper. May 10, 2002
David Eigen MA112 Fina Paper May 1, 22 The Schrodinger equation describes the position of an eectron as a wave. The wave function Ψ(t, x is interpreted as a probabiity density for the position of the eectron.
More informationImproved Decoding of Reed-Solomon and Algebraic-Geometric Codes
Improved Decoding of Reed-Soomon and Agebraic-Geometric Codes Venkatesan Guruswami Madhu Sudan Abstract Given an error-correcting code over strings of ength n and an arbitrary input string aso of ength
More informationSome Measures for Asymmetry of Distributions
Some Measures for Asymmetry of Distributions Georgi N. Boshnakov First version: 31 January 2006 Research Report No. 5, 2006, Probabiity and Statistics Group Schoo of Mathematics, The University of Manchester
More information2M2. Fourier Series Prof Bill Lionheart
M. Fourier Series Prof Bi Lionheart 1. The Fourier series of the periodic function f(x) with period has the form f(x) = a 0 + ( a n cos πnx + b n sin πnx ). Here the rea numbers a n, b n are caed the Fourier
More informationStatistical Learning Theory: A Primer
Internationa Journa of Computer Vision 38(), 9 3, 2000 c 2000 uwer Academic Pubishers. Manufactured in The Netherands. Statistica Learning Theory: A Primer THEODOROS EVGENIOU, MASSIMILIANO PONTIL AND TOMASO
More informationarxiv:hep-ph/ v1 15 Jan 2001
BOSE-EINSTEIN CORRELATIONS IN CASCADE PROCESSES AND NON-EXTENSIVE STATISTICS O.V.UTYUZH AND G.WILK The Andrzej So tan Institute for Nucear Studies; Hoża 69; 00-689 Warsaw, Poand E-mai: utyuzh@fuw.edu.p
More informationExplicit overall risk minimization transductive bound
1 Expicit overa risk minimization transductive bound Sergio Decherchi, Paoo Gastado, Sandro Ridea, Rodofo Zunino Dept. of Biophysica and Eectronic Engineering (DIBE), Genoa University Via Opera Pia 11a,
More informationUniversal Consistency of Multi-Class Support Vector Classification
Universa Consistency of Muti-Cass Support Vector Cassification Tobias Gasmachers Dae Moe Institute for rtificia Inteigence IDSI, 6928 Manno-Lugano, Switzerand tobias@idsia.ch bstract Steinwart was the
More informationNumerical methods for elliptic partial differential equations Arnold Reusken
Numerica methods for eiptic partia differentia equations Arnod Reusken Preface This is a book on the numerica approximation of partia differentia equations. On the next page we give an overview of the
More informationOn the estimation of multiple random integrals and U-statistics
Péter Major On the estimation of mutipe random integras and U-statistics Lecture Note January 9, 2014 Springer Contents 1 Introduction................................................... 1 2 Motivation
More informationJoel Broida UCSD Fall 2009 Phys 130B QM II. Homework Set 2 DO ALL WORK BY HAND IN OTHER WORDS, DON T USE MATHEMAT- ICA OR ANY CALCULATORS.
Joe Broida UCSD Fa 009 Phys 30B QM II Homework Set DO ALL WORK BY HAND IN OTHER WORDS, DON T USE MATHEMAT- ICA OR ANY CALCULATORS. You may need to use one or more of these: Y 0 0 = 4π Y 0 = 3 4π cos Y
More informationSecure Information Flow Based on Data Flow Analysis
SSN 746-7659, Engand, UK Journa of nformation and Computing Science Vo., No. 4, 007, pp. 5-60 Secure nformation Fow Based on Data Fow Anaysis Jianbo Yao Center of nformation and computer, Zunyi Norma Coege,
More informationAFormula for N-Row Macdonald Polynomials
Journa of Agebraic Combinatorics, 21, 111 13, 25 c 25 Springer Science + Business Media, Inc. Manufactured in The Netherands. AFormua for N-Row Macdonad Poynomias ELLISON-ANNE WILLIAMS North Caroina State
More informationSmall generators of function fields
Journa de Théorie des Nombres de Bordeaux 00 (XXXX), 000 000 Sma generators of function fieds par Martin Widmer Résumé. Soit K/k une extension finie d un corps goba, donc K contient un éément primitif
More informationSmoothness equivalence properties of univariate subdivision schemes and their projection analogues
Numerische Mathematik manuscript No. (wi be inserted by the editor) Smoothness equivaence properties of univariate subdivision schemes and their projection anaogues Phiipp Grohs TU Graz Institute of Geometry
More informationQUADRATIC FORMS AND FOUR PARTITION FUNCTIONS MODULO 3
QUADRATIC FORMS AND FOUR PARTITION FUNCTIONS MODULO 3 JEREMY LOVEJOY AND ROBERT OSBURN Abstract. Recenty, Andrews, Hirschhorn Seers have proven congruences moduo 3 for four types of partitions using eementary
More informationAsynchronous Control for Coupled Markov Decision Systems
INFORMATION THEORY WORKSHOP (ITW) 22 Asynchronous Contro for Couped Marov Decision Systems Michae J. Neey University of Southern Caifornia Abstract This paper considers optima contro for a coection of
More informationK p q k(x) K n(x) x X p
oc 5. Lecture 5 5.1. Quien s ocaization theorem and Boch s formua. Our next topic is a sketch of Quien s proof of Boch s formua, which is aso a a brief discussion of aspects of Quien s remarkabe paper
More informationare left and right inverses of b, respectively, then: (b b 1 and b 1 = b 1 b 1 id T = b 1 b) b 1 so they are the same! r ) = (b 1 r = id S b 1 r = b 1
Lecture 1. The Category of Sets PCMI Summer 2015 Undergraduate Lectures on Fag Varieties Lecture 1. Some basic set theory, a moment of categorica zen, and some facts about the permutation groups on n etters.
More informationPAijpam.eu SOME RESULTS ON PRIME NUMBERS B. Martin Cerna Maguiña 1, Héctor F. Cerna Maguiña 2 and Harold Blas 3
Internationa Journa of Pure and Appied Mathematics Voume 118 No. 3 018, 845-851 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-ine version) ur: http://www.ijpam.eu doi:.173/ijpam.v118i3.9 PAijpam.eu
More informationOn Some Basic Properties of Geometric Real Sequences
On Some Basic Properties of eometric Rea Sequences Khirod Boruah Research Schoar, Department of Mathematics, Rajiv andhi University Rono His, Doimukh-791112, Arunacha Pradesh, India Abstract Objective
More informationLecture 11. Fourier transform
Lecture. Fourier transform Definition and main resuts Let f L 2 (R). The Fourier transform of a function f is a function f(α) = f(x)t iαx dx () The normaized Fourier transform of f is a function R ˆf =
More informationSardinas-Patterson like algorithms in coding theory
A.I.Cuza University of Iaşi Facuty of Computer Science Sardinas-Patterson ike agorithms in coding theory Author, Bogdan Paşaniuc Supervisor, Prof. dr. Ferucio Laurenţiu Ţipea Iaşi, September 2003 Contents
More informationCS 331: Artificial Intelligence Propositional Logic 2. Review of Last Time
CS 33 Artificia Inteigence Propositiona Logic 2 Review of Last Time = means ogicay foows - i means can be derived from If your inference agorithm derives ony things that foow ogicay from the KB, the inference
More informationWeek 6 Lectures, Math 6451, Tanveer
Fourier Series Week 6 Lectures, Math 645, Tanveer In the context of separation of variabe to find soutions of PDEs, we encountered or and in other cases f(x = f(x = a 0 + f(x = a 0 + b n sin nπx { a n
More informationTAMENESS AND FRAMES REVISITED. Contents
TAENESS AND FRAES REVISITED WILL BONEY AND SEBASTIEN VASEY Abstract. We combine tameness for 1-types with the existence of a good frame to obtain some amount of tameness for n-types, where n is a natura
More informationA. Distribution of the test statistic
A. Distribution of the test statistic In the sequentia test, we first compute the test statistic from a mini-batch of size m. If a decision cannot be made with this statistic, we keep increasing the mini-batch
More informationCoded Caching for Files with Distinct File Sizes
Coded Caching for Fies with Distinct Fie Sizes Jinbei Zhang iaojun Lin Chih-Chun Wang inbing Wang Department of Eectronic Engineering Shanghai Jiao ong University China Schoo of Eectrica and Computer Engineering
More informationAALBORG UNIVERSITY. The distribution of communication cost for a mobile service scenario. Jesper Møller and Man Lung Yiu. R June 2009
AALBORG UNIVERSITY The distribution of communication cost for a mobie service scenario by Jesper Møer and Man Lung Yiu R-29-11 June 29 Department of Mathematica Sciences Aaborg University Fredrik Bajers
More informationOpen problems and recent results on causal completeness of probabilistic theories
Open problems and recent results on causal completeness of probabilistic theories p. 1/2 Open problems and recent results on causal completeness of probabilistic theories Miklos Redei LSE M.Redei@lse.ac.uk
More information