| 1. |
- Andersson, Fredrik K., et al.
(författare)
-
The mathematics of internet search engines
- 2008
-
Ingår i: Acta Applicandae Mathematicae - An International Survey Journal on Applying Mathematics and Mathematical Applications. - : Springer. - 0167-8019 .- 1572-9036. ; 104:2, s. 211-242
-
Tidskriftsartikel (refereegranskat)abstract
- This article presents a survey of techniques for ranking results in search engines, with emphasis on link-based ranking methods and the PageRank algorithm. The problem of selecting, in relation to a user search query, the most relevant documents from an unstructured source such as the WWW is discussed in detail. The need for extending classical information retrieval techniques such as boolean searching and vector space models with link-based ranking methods is demonstrated. The PageRank algorithm is introduced, and its numerical and spectral properties are discussed. The article concludes with an alternative means of computing PageRank, along with some example applications of this new method.
|
|
| 2. |
- Laksman, Efraim, 1983, et al.
(författare)
-
The stochastic opportunistic replacement problem, part III: improved bounding procedures
- 2020
-
Ingår i: Annals of Operations Research. - : Springer Science and Business Media LLC. - 1572-9338 .- 0254-5330. ; 292:2, s. 711-733
-
Tidskriftsartikel (refereegranskat)abstract
- We consider the problem to find a schedule for component replacement in a multi-component system, whose components possess stochastic lives and economic dependencies, such that the expected costs for maintenance during a pre-defined time period are minimized. The problem was considered in Patriksson et al. (Ann Oper Res 224:51–75, 2015), in which a two-stage approximation of the problem was optimized through decomposition (denoted the optimization policy). The current paper improves the effectiveness of the decomposition approach by establishing a tighter bound on the value of the recourse function (i.e., the second stage in the approximation). A general lower bound on the expected maintenance cost is also established. Numerical experiments with 100 simulation scenarios for each of four test instances show that the tighter bound yields a decomposition generating fewer optimality cuts. They also illustrate the quality of the lower bound. Contrary to results presented earlier, an age-based policy performs on par with the optimization policy, although most simple policies perform worse than the optimization policy.
|
|
| 3. |
- Casarino, V., et al.
(författare)
-
On the variation operator for the Ornstein-Uhlenbeck semigroup in dimension one
- 2024
-
Ingår i: Annali Di Matematica Pura Ed Applicata. - 0373-3114 .- 1618-1891. ; 203:1, s. 205-219
-
Tidskriftsartikel (refereegranskat)abstract
- Consider the variation seminorm of the Ornstein-Uhlenbeck semigroup Ht in dimension one, taken with respect to t. We show that this seminorm defines an operator of weak type (1, 1) for the relevant Gaussian measure. The analogous Lp estimates for 1 < p < 8 were already known.
|
|
| 4. |
- Balkanova, Olga, 1988, et al.
(författare)
-
Prime geodesic theorem in the 3-dimensional hyperbolic space
- 2019
-
Ingår i: Transactions of the American Mathematical Society. - : American Mathematical Society (AMS). - 0002-9947 .- 1088-6850. ; 372:8, s. 5355-5374
-
Tidskriftsartikel (refereegranskat)abstract
- For Γ a cofinite Kleinian group acting on H3, we study the prime geodesic theorem on M = Γ\H3, which asks about the asymptotic behavior of lengths of primitive closed geodesics (prime geodesics) on M. Let EΓ(X) be the error in the counting of prime geodesics with length at most log X. For the Picard manifold, Γ = PSL(2, Z[i]), we improve the classical bound of Sarnak, EΓ(X) = O(X5/3+e), to EΓ(X) = O(X13/8+e). In the process we obtain a mean subconvexity estimate for the Rankin-Selberg L-function attached to Maass-Hecke cusp forms. We also investigate the second moment of EΓ(X) for a general cofinite group Γ, and we show that it is bounded by O(X16/5+e).
|
|
| 5. |
- Björnberg, Jakob, 1983, et al.
(författare)
-
STABLE SHREDDED SPHERES AND CAUSAL RANDOM MAPS WITH LARGE FACES
- 2022
-
Ingår i: Annals of Probability. - 2168-894X .- 0091-1798. ; 50:5, s. 2056-2084
-
Tidskriftsartikel (refereegranskat)abstract
- We introduce a new familiy of random compact metric spaces Sα for α ∈ (1, 2), which we call stable shredded spheres. They are constructed from excursions of α-stable Lévy processes on [0, 1] possessing no negative jumps. Informally, viewing the graph of the Lévy excursion in the plane, each jump of the process is “cut open” and replaced by a circle, and then all points on the graph at equal height, which are not separated by a jump, are identified. We show that the shredded spheres arise as scaling limits of models of causal random planar maps with large faces introduced by Di Francesco and Guitter. We also establish that their Hausdorff dimension is almost surely equal to α. Point identification in the shredded spheres is intimately connected to the presence of decrease points in stable spectrally positive Lévy processes, as studied by Bertoin in the 1990s.
|
|
| 6. |
- Brubaker, B., et al.
(författare)
-
Colored five-vertex models and Demazure atoms
- 2021
-
Ingår i: Journal of Combinatorial Theory Series A. - : Elsevier BV. - 0097-3165 .- 1096-0899. ; 178
-
Tidskriftsartikel (refereegranskat)abstract
- Type A Demazure atoms are pieces of Schur functions, or sets of tableaux whose weights sum to such functions. Inspired by colored vertex models of Borodin and Wheeler, we will construct solvable lattice models whose partition functions are Demazure atoms; the proof of this makes use of a Yang-Baxter equation for a colored five-vertex model. As a byproduct, we will construct Demazure atoms on Kashiwara's B-infinity crystal and give new algorithms for computing Lascoux-Schutzenberger keys. (C) 2020 Elsevier Inc. All rights reserved.
|
|
| 7. |
- Nyagahakwa, Venuste, et al.
(författare)
-
Sets with the Baire property in topologies formed from a given topology and ideals of sets
- 2017
-
Ingår i: Questions and answers in General Topology. - Osaka : Symposium of General Topology / Iso Shinpojumu. - 0918-4732. ; 35:1, s. 59-76
-
Tidskriftsartikel (refereegranskat)abstract
- Let X be a set, τ1, τ2 topologies on X and Bp(X, τi) the family of all subsets of X possessing the Baire property in (X, τi), i = 1, 2. In this paper we study conditions on τ1 and τ2 that imply a relationship (for example, inclusion or equality) between the families Bp(X, τ1) and Bp(X, τ2). We are mostly interested in the case where the topology τ2 is formed with the help of a local function defined by the topology τ1 and an ideal of sets I on X. We also consider several applications of the local function defined by the usual topology on the reals and the ideal of all meager sets there, for proving some known facts.
|
|
| 8. |
- Hellström, Fredrik, 1993, et al.
(författare)
-
Generalization Bounds via Information Density and Conditional Information Density
- 2020
-
Ingår i: IEEE Journal on Selected Areas in Information Theory. - 2641-8770. ; 1:3, s. 824-839
-
Tidskriftsartikel (refereegranskat)abstract
- We present a general approach, based on an exponential inequality, to derive bounds on the generalization error of randomized learning algorithms. Using this approach, we provide bounds on the average generalization error as well as bounds on its tail probability, for both the PAC-Bayesian and single-draw scenarios. Specifically, for the case of sub-Gaussian loss functions, we obtain novel bounds that depend on the information density between the training data and the output hypothesis. When suitably weakened, these bounds recover many of the information-theoretic bounds available in the literature. We also extend the proposed exponential-inequality approach to the setting recently introduced by Steinke and Zakynthinou (2020), where the learning algorithm depends on a randomly selected subset of the available training data. For this setup, we present bounds for bounded loss functions in terms of the conditional information density between the output hypothesis and the random variable determining the subset choice, given all training data. Through our approach, we recover the average generalization bound presented by Steinke and Zakynthinou (2020) and extend it to the PAC-Bayesian and singledraw scenarios. For the single-draw scenario, we also obtain novel bounds in terms of the conditional α-mutual information and the conditional maximal leakage.
|
|
| 9. |
- Holroyd, Alexander E., et al.
(författare)
-
Minimal matchings of point processes
- 2022
-
Ingår i: Probability Theory and Related Fields. - : Springer Science and Business Media LLC. - 0178-8051 .- 1432-2064. ; 184:1-2, s. 571-611
-
Tidskriftsartikel (refereegranskat)abstract
- Suppose that red and blue points form independent homogeneous Poisson processes of equal intensity in R-d. For a positive (respectively, negative) parameter gamma we consider red-blue matchings that locally minimize (respectively, maximize) the sum of gamma th powers of the edge lengths, subject to locally minimizing the number of unmatched points. The parameter can be viewed as a measure of fairness. The limit gamma -> -infinity is equivalent to Gale-Shapley stable matching. We also consider limits as gamma approaches 0, 1-, 1+ and infinity. We focus on dimension d = 1. We prove that almost surely no such matching has unmatched points. (This question is open for higher d). For each gamma < 1 we establish that there is almost surely a unique such matching, and that it can be expressed as a finitary factor of the points. Moreover, its typical edge length has finite rth moment if and only if r < 1 /2. In contrast, for gamma = 1 there are uncountably many matchings, while for gamma > 1 there are countably many, but it is impossible to choose one in a translation-invariant way. We obtain existence results in higher dimensions (covering many but not all cases). We address analogous questions for one-colour matchings also.
|
|
| 10. |
- Albin, Patrik, 1960
(författare)
-
ON EXTREME VALUE THEORY FOR GROUP STATIONARY GAUSSIAN PROCESSES
- 2018
-
Ingår i: Esaim-Probability and Statistics. - : EDP Sciences. - 1292-8100 .- 1262-3318. ; 22, s. 1-18
-
Tidskriftsartikel (refereegranskat)abstract
- We study extreme value theory of right stationary Gaussian processes with parameters in open subsets with compact closure of (not necessarily Abelian) locally compact topological groups. Even when specialized to Euclidian space our result extend results on extremes of stationary Gaussian processes and fields in the literature by means of requiring weaker technical conditions as well as by means of the fact that group stationary processes need not be stationary in the usual sense (that is, with respect to addition as group operation).
|
|
