Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | Springer Nature Link |
|---|---|
| Author | Rama Murthy, Kavi Rajput, Balram S. |
| Copyright Year | 2007 |
| Abstract | Let ( $$\mathbb{B}$$ , $$\|\cdot\|$$ ) be a separable Banach space and let $$\mathcal{M}$$ be a class of probability measures on $$\mathbb{B}$$ , and let $$\bar{\mu}$$ denote the symmetrization of $$\mu\in\mathcal{M}$$ . We provide two sufficient conditions (one in terms of certain quantiles and the other in terms of certain moments of $$\|\cdot\|$$ relative to μ and $$\bar{\mu}$$ , $$\mu\in\mathcal{M}$$ ) for the “uniform comparison” of the μ and $$\bar{\mu}$$ measure of the complements of the closed balls of $$\mathbb{B}$$ centered at zero, for every $$\mu\in\mathcal{M}$$ . As a corollary to these “tail comparison inequalities,” we show that three classical results (the Lévy-type Inequalities, the Kwapień-Contraction Inequality, and a part of the Itô–Nisio Theorem) that are valid for the symmetric (but not for the general non-symmetric) independent $$\mathbb{B}$$ -valued random vectors do indeed hold for the independent random vectors whose laws belong to any $$\mathcal{M}$$ which satisfies one of the two noted conditions and which is closed under convolution. We further point out that these three results (respectively, the tail comparison inequalities) are valid for the centered log-concave, as well as, for the strictly α-stable (or the more general strictly (r, α) -semistable) α ≠ 1 random vectors (respectively, probability measures). We also present several examples which we believe form a valuable part of the paper. |
| Ending Page | 105 |
| Page Count | 19 |
| Starting Page | 87 |
| File Format | |
| ISSN | 08949840 |
| e-ISSN | 15729230 |
| Journal | Journal of Theoretical Probability |
| Issue Number | 1 |
| Volume Number | 20 |
| Language | English |
| Publisher | Kluwer Academic Publishers-Plenum Publishers |
| Publisher Date | 2007-02-06 |
| Publisher Place | New York |
| Access Restriction | One Nation One Subscription (ONOS) |
| Subject Keyword | semistable Tail probability stable Stationary processes Prediction theory Probability Theory and Stochastic Processes Infinitely divisible distributions; stable distributions log concave probability measures Prediction; filtering Statistics |
| Content Type | Text |
| Resource Type | Article |
| Subject | Statistics and Probability Statistics, Probability and Uncertainty |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|