To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We study the supermarket model and show that choosing the shortest of just a few randomly chosen queues is almost as good as JSQ. Another issue with many-server systems is specialization, with several customer and server types, and limited compatibility between them
We continue the discussion of control of transient MCQN. We formulate a fluid optimization problem that we can solve using a separated continuous linear programming (SCLP) algorithm.We then describe a method of tracking the optimal fluid solution, using virtual infinite queues and maximum pressure policy. We show that this procedure is asymptotically optimal for high-volume systems, as exemplified by semiconductor wafer fabs.
We discuss fluid and diffusion approximations to the GI/GI/1 queue by scaling time and space. We also introduce the GI/GI/1 queueing system and study it under many-server scaling. The three types of scaling, fluid, diffusion, and many-server, form the backbone for Parts IV, V, andVI of the book, where we use them to study networks of queues. These approximations allow us to obtain a much better idea of how queues evolve over time than can be obtained from an exact discrete state Markov description.
In this work we analyse bucket increasing tree families. We introduce two simple stochastic growth processes, generating random bucket increasing trees of size n, complementing the earlier result of Mahmoud and Smythe (1995, Theoret. Comput. Sci.144 221–249.) for bucket recursive trees. On the combinatorial side, we define multilabelled generalisations of the tree families d-ary increasing trees and generalised plane-oriented recursive trees. Additionally, we introduce a clustering process for ordinary increasing trees and relate it to bucket increasing trees. We discuss in detail the bucket size two and present a bijection between such bucket increasing tree families and certain families of graphs called increasing diamonds, providing an explanation for phenomena observed by Bodini et al. (2016, Lect. Notes Comput. Sci.9644 207–219.). Concerning structural properties of bucket increasing trees, we analyse the tree parameter $K_n$. It counts the initial bucket size of the node containing label n in a tree of size n and is closely related to the distribution of node types. Additionally, we analyse the parameters descendants of label j and degree of the bucket containing label j, providing distributional decompositions, complementing and extending earlier results (Kuba and Panholzer (2010), Theoret. Comput. Sci.411(34–36) 3255–3273.).
In this paper we study the existence and the analytic dependence upon domain perturbation of the solutions of a nonlinear nonautonomous transmission problem for the Laplace equation. The problem is defined in a pair of sets consisting of a perforated domain and an inclusion whose shape is determined by a suitable diffeomorphism $\phi$. First we analyse the case in which the inclusion is a fixed domain. Then we will perturb the inclusion and study the arising boundary value problem and the dependence of a specific family of solutions upon the perturbation parameter $\phi$.
We establish a straightforward estimate for the number of open sets with fundamental group constraints needed to cover the total space of fibrations. This leads to vanishing results for simplicial volume and minimal volume entropy, e.g., for certain mapping tori.
For $1< p<\infty$ we prove an $L^{p}$-version of the generalized trace-free Korn inequality for incompatible tensor fields $P$ in $W^{1,p}_0(\operatorname {Curl}; \Omega ,\mathbb {R}^{3\times 3})$. More precisely, let $\Omega \subset \mathbb {R}^{3}$ be a bounded Lipschitz domain. Then there exists a constant $c>0$ such that
\[ \lVert{ P }\rVert_{L^{p}(\Omega,\mathbb{R}^{3\times 3})}\leq c\,\left(\lVert{\operatorname{dev} \operatorname{sym} P }\rVert_{L^{p}(\Omega,\mathbb{R}^{3\times 3})} + \lVert{ \operatorname{dev} \operatorname{Curl} P }\rVert_{L^{p}(\Omega,\mathbb{R}^{3\times 3})}\right) \]
holds for all tensor fields $P\in W^{1,p}_0(\operatorname {Curl}; \Omega ,\mathbb {R}^{3\times 3})$, i.e., for all $P\in W^{1,p} (\operatorname {Curl}; \Omega ,\mathbb {R}^{3\times 3})$ with vanishing tangential trace $P\times \nu =0$ on $\partial \Omega$ where $\nu$ denotes the outward unit normal vector field to $\partial \Omega$ and $\operatorname {dev} P : = P -\frac 13 \operatorname {tr}(P) {\cdot } {\mathbb {1}}$ denotes the deviatoric (trace-free) part of $P$. We also show the norm equivalence
\begin{align*} &\lVert{ P }\rVert_{L^{p}(\Omega,\mathbb{R}^{3\times 3})}+\lVert{ \operatorname{Curl} P }\rVert_{L^{p}(\Omega,\mathbb{R}^{3\times 3})}\\ &\quad\leq c\,\left(\lVert{P}\rVert_{L^{p}(\Omega,\mathbb{R}^{3\times 3})} + \lVert{ \operatorname{dev} \operatorname{Curl} P }\rVert_{L^{p}(\Omega,\mathbb{R}^{3\times 3})}\right) \end{align*}
for tensor fields $P\in W^{1,p}(\operatorname {Curl}; \Omega ,\mathbb {R}^{3\times 3})$. These estimates also hold true for tensor fields with vanishing tangential trace only on a relatively open (non-empty) subset $\Gamma \subseteq \partial \Omega$ of the boundary.
We study the small data global well-posedness and time-decay rates of solutions to the Cauchy problem for three-dimensional compressible Navier–Stokes–Allen–Cahn equations via a refined pure energy method. In particular, the optimal decay rates of the higher-order spatial derivatives of the solution are obtained, the $\dot {H}^{-s}$($0\leq s<\frac {3}{2}$) negative Sobolev norms is shown to be preserved along time evolution and enhance the decay rates.
In this article, we give a comprehensive characterization of $L^1$-summability for the Navier-Stokes flows in the half space, which is a long-standing problem. The main difficulties are that $L^q-L^r$ estimates for the Stokes flow don't work in this end-point case: $q=r=1$; the projection operator $P: L^1\longrightarrow L^1_\sigma$ is not bounded any more; useful information on the pressure function is missing, which arises in the net force exerted by the fluid on the noncompact boundary. In order to achieve our aims, by making full use of the special structure of the half space, we decompose the pressure function into two parts. Then the knotty problem of handling the pressure term can be transformed into establishing a crucial and new weighted $L^1$-estimate, which plays a fundamental role. In addition, we overcome the unboundedness of the projection $P$ by solving an elliptic problem with homogeneous Neumann boundary condition.
In pioneering work in the 1950s, S. Karlin and J. McGregor showed that probabilistic aspects of certain Markov processes can be studied by analyzing orthogonal eigenfunctions of associated operators. In the decades since, many authors have extended and deepened this surprising connection between orthogonal polynomials and stochastic processes. This book gives a comprehensive analysis of the spectral representation of the most important one-dimensional Markov processes, namely discrete-time birth-death chains, birth-death processes and diffusion processes. It brings together the main results from the extensive literature on the topic with detailed examples and applications. Also featuring an introduction to the basic theory of orthogonal polynomials and a selection of exercises at the end of each chapter, it is suitable for graduate students with a solid background in stochastic processes as well as researchers in orthogonal polynomials and special functions who want to learn about applications of their work to probability.
We consider the component structure of the random digraph D(n,p) inside the critical window $p = n^{-1} + \lambda n^{-4/3}$. We show that the largest component $\mathcal{C}_1$ has size of order $n^{1/3}$ in this range. In particular we give explicit bounds on the tail probabilities of $|\mathcal{C}_1|n^{-1/3}$.
For $G = \mathrm {GL}_2, \mathrm {SL}_2, \mathrm {PGL}_2$ we compute the intersection E-polynomials and the intersection Poincaré polynomials of the G-character variety of a compact Riemann surface C and of the moduli space of G-Higgs bundles on C of degree zero. We derive several results concerning the P=W conjectures for these singular moduli spaces.
We define a new ribbon group action on ribbon graphs that uses a semidirect product of a permutation group and the original ribbon group of Ellis-Monaghan and Moffatt to take (partial) twists and duals, or twuals, of ribbon graphs. A ribbon graph is a fixed point of this new ribbon group action if and only if it is isomorphic to one of its (partial) twuals. This extends the original ribbon group action, which only used the canonical identification of edges, to the more natural setting of self-twuality up to isomorphism. We then show that every ribbon graph has in its orbit an orientable embedded bouquet and prove that the (partial) twuality properties of these bouquets propagate through their orbits. Thus, we can determine (partial) twualities via these one vertex graphs, for which checking isomorphism reduces simply to checking dihedral group symmetries. Finally, we apply the new ribbon group action to generate all self-trial ribbon graphs on up to seven edges, in contrast with the few, large, very high-genus, self-trial regular maps found by Wilson, and by Jones and Poultin. We also show how the automorphism group of a ribbon graph yields self-dual, -petrial or –trial graphs in its orbit, and produce an infinite family of self-trial graphs that do not arise as covers or parallel connections of regular maps, thus answering a question of Jones and Poulton.
We construct two bounded functional calculi for sectorial operators on Banach spaces, which enhance the functional calculus for analytic Besov functions, by extending the class of functions, generalising and sharpening estimates and adapting the calculus to the angle of sectoriality. The calculi are based on appropriate reproducing formulas, they are compatible with standard functional calculi and they admit appropriate convergence lemmas and spectral mapping theorems. To achieve this, we develop the theory of associated function spaces in ways that are interesting and significant. As consequences of our calculi, we derive several well-known operator norm estimates and provide generalisations of some of them.
This article is about Lehn–Lehn–Sorger–van Straten eightfolds $Z$ and their anti-symplectic involution $\iota$. When $Z$ is birational to the Hilbert scheme of points on a K3 surface, we give an explicit formula for the action of $\iota$ on the Chow group of $0$-cycles of $Z$. The formula is in agreement with the Bloch–Beilinson conjectures and has some non-trivial consequences for the Chow ring of the quotient.
We study the structure and compute the stable rank of $C^{*}$-algebras of finite higher-rank graphs. We completely determine the stable rank of the $C^{*}$-algebra when the $k$-graph either contains no cycle with an entrance or is cofinal. We also determine exactly which finite, locally convex $k$-graphs yield unital stably finite $C^{*}$-algebras. We give several examples to illustrate our results.