Search
Results: 239
Boundaries, Vermas and factorisation
Abstract: We revisit the factorisation of supersymmetric partition functions of 3d N = 4 gauge theories. The building blocks are hemisphere partition functions of a class of UV N = (2, 2) boundary conditions that mimic the...
Boundaries, Vermas and factorisation
Abstract: We revisit the factorisation of supersymmetric partition functions of 3d N = 4 gauge theories. The building blocks are hemisphere partition functions of a class of UV N = (2, 2) boundary conditions that mimic the...
Boundaries, Vermas and factorisation
We revisit the factorisation of supersymmetric partition functions of 3d
$\mathcal{N}=4$ gauge theories. The building blocks are hemisphere partition
functions of a class of UV $\mathcal{N}=(2,2)$ boundary conditions that...
Improving Organizational Sustainable Performance of Organizations Through Green Training
It is necessary to equip employees with green abilities as well as to develop their dedication towards green behaviour, in order to improve an organization's environmental performance. The purpose of this research is to evaluate...
Published by: IGI Global Scientific Publishing
Does Islamic Marketing Mix Affect Consumer Satisfaction?
Viju Mathew
Jan 01, 2022
Customer and customer satisfaction is considered to be the core for success. Targeting the growing Islamic customer population has given the opportunity to tap demand based on Islamic values. Apart from the standard marketing...
Published by: IGI Global Scientific Publishing
Connectivity of soft random geometric graphs
Mathew Penrose
Apr 01, 2016
Consider a graph on $n$ uniform random points in the unit square, each pair being connected by an edge with probability $p$ if the inter-point distance is at most $r$. We show that as $n \to \infty$ the probability of full...
Leaves on the line and in the plane
Mathew Penrose
May 05, 2020
The dead leaves model (DLM) provides a random tessellation of $d$-space, representing the visible portions of fallen leaves on the ground when $d=2$. For $d=1$, we establish formulae for the intensity, two-point correlations...
Evaluating Onsite and Online Internship Mode Using Consumptive Metrics
The paper aims to assess the effectiveness between onsite and online internship mode by measuring the critical components of learning through the Kirkpatrick's ‘consumptive metrics' model. The primary goal of internship is to...
Published by: IGI Global Scientific Publishing
Connectivity of soft random geometric graphs
Mathew Penrose
Apr 01, 2016
Consider a graph on $n$ uniform random points in the unit square, each pair being connected by an edge with probability $p$ if the inter-point distance is at most $r$. We show that as $n \to \infty$ the probability of full...
Leaves on the line and in the plane
Mathew Penrose
May 05, 2020
The dead leaves model (DLM) provides a random tessellation of $d$-space, representing the visible portions of fallen leaves on the ground when $d=2$. For $d=1$, we establish formulae for the intensity, two-point correlations...
Rank deficiency in sparse random GF[2] matrices
Mathew Penrose
Sep 14, 2014
Let M be a random m×n matrix with binary entries and i.i.d. rows. The weight (i.e., number of ones) of a row has a specified probability distribution, with the row chosen uniformly at random given its weight. Let N(n,m) denote...
Rank deficiency in sparse random GF[2] matrices
Mathew Penrose
Sep 14, 2014
Let M be a random m×n matrix with binary entries and i.i.d. rows. The weight (i.e., number of ones) of a row has a specified probability distribution, with the row chosen uniformly at random given its weight. Let N(n,m) denote...
The Role of CDKs and CDKIs in Murine Development.
Cyclin-dependent kinases (CDKs) and their inhibitors (CDKIs) play pivotal roles in the regulation of the cell cycle. As a result of these functions, it may be extrapolated that they are essential for appropriate embryonic...
The Role of CDKs and CDKIs in Murine Development
Cyclin-dependent kinases (CDKs) and their inhibitors (CDKIs) play pivotal roles in the regulation of the cell cycle. As a result of these functions, it may be extrapolated that they are essential for appropriate embryonic...
Local central limit theorems in stochastic geometry
We give a general local central limit theorem for the sum of two independent random variables, one of which satisfies a central limit theorem while the other satisfies a local central limit theorem with the same order variance....
Optimal Cheeger cuts and bisections of random geometric graphs
Let d ≥ 2. The Cheeger constant of a graph is the minimum surfaceto- volume ratio of all subsets of the vertex set with relative volume at most 1/2. There are several ways to define surface and volume here: The simplest...
Local central limit theorems in stochastic geometry
We give a general local central limit theorem for the sum of two independent random variables, one of which satisfies a central limit theorem while the other satisfies a local central limit theorem with the same order variance....
Optimal Cheeger cuts and bisections of random geometric graphs
Let d ≥ 2. The Cheeger constant of a graph is the minimum surfaceto- volume ratio of all subsets of the vertex set with relative volume at most 1/2. There are several ways to define surface and volume here: The simplest...
A Framework for Relationships in eCommerce Websites
Consumers are increasingly shifting their purchase patterns from in-store to online. Consequently, retailers have had to go online to remain competitive. Research pundits argued the success of going online lies in the website's...
Published by: IGI Global Scientific Publishing
Inhomogeneous random graphs, isolated vertices, and Poisson approximation
Mathew D. Penrose
Mar 01, 2018
Consider a graph on randomly scattered points in an arbitrary space, with any two points x, y connected with probability φ(x, y). Suppose the number of points is large but the mean number of isolated points is O(1). We give...
Inhomogeneous random graph Poisson approximation Stein's method U-statistic latent variable model random connection model Random geometric graph stochastic block model /dk/atira/pure/subjectarea/asjc/2600/2613 name=Statistics and Probability /dk/atira/pure/subjectarea/asjc/2600/2600 name=General Mathematics /dk/atira/pure/subjectarea/asjc/1800/1804 name=Statistics, Probability and Uncertainty
Limit theory of combinatorial optimization for random geometric graphs
In the random geometric graph G(n, rn), n vertices are placed randomly in Euclidean d-space and edges are added between any pair of vertices distant at most rn from each other. We establish strong laws...
Clique-covering number Dense limit Domination number Independence number Minimum-weight matching Random geometric graph Sphere packing Subadditivity thermodynamic limit Traveling salesman problem /dk/atira/pure/subjectarea/asjc/2600/2613 name=Statistics and Probability /dk/atira/pure/subjectarea/asjc/1800/1804 name=Statistics, Probability and Uncertainty
Corrections
We fix a major gap in our 2017 paper, along with related issues.
On the critical threshold for continuum AB percolation
Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in d-space, with distance parameter r and intensities λ,μ. For any λ>0 we consider the percolation threshold...
|
|< |
< |
1 |