scientific article; zbMATH DE number 1246230
From MaRDI portal
zbMath0927.60027MaRDI QIDQ4226453
Publication date: 13 December 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Joint Alignment from Pairwise Differences with a Noisy Oracle, On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles, Distribution of tree parameters by martingale approach, Packing spanning graphs from separable families, Performing work in broadcast networks, Swarming on random graphs, Independent transversals in locally sparse graphs, Shannon sampling and function reconstruction from point values, Measuring the unmeasurable: an application of uncertainty quantification to Treasury bond portfolios, Spectral properties of the Möbius function and a random Möbius model, Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE, Multiplayer Bandits Without Observing Collision Information, The Effect of Time-Varying Jamming Interference on Networked Stabilization, Random walk on sparse random digraphs, On the Push&Pull Protocol for Rumor Spreading, Rumors Spread Slowly in a Small-World Spatial Network, Counting colorings of triangle-free graphs, Singularity of the \(k\)-core of a random graph, Local limit theorems for occupancy models, The Cramér-Lundberg model with a fluctuating number of clients, Successive minimum spanning trees, The jump of the clique chromatic number of random graphs, Regular and General Resolution: An Improved Separation, Moderate deviations for shortest-path lengths on random segment processes, Asymptotically good edge correspondence colourings, A variant of the Erdős–Rényi random graph process, The number of \(n\)-queens configurations, The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘), User-friendly Introduction to PAC-Bayes Bounds, Transience and anchored isoperimetric dimension of supercritical percolation clusters, Secure networked control under jamming attacks: an SINR-based approach, Fixed-Parameter Algorithms for the Kneser and Schrijver Problems, A Simple SVD Algorithm for Finding Hidden Partitions, Rankings in directed configuration models with heavy tailed in-degrees, Classical and almost sure local limit theorems, Loose Hamilton Cycles in Regular Hypergraphs, On the Method of Typical Bounded Differences, Planting Colourings Silently, Following the Perturbed Leader to Gamble at Multi-armed Bandits, BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING, Packing Loose Hamilton Cycles, Unnamed Item, Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization, The replica symmetric solution for Potts models on \(d\)-regular graphs, An Improved Multi-set Algorithm for the Dense Subset Sum Problem, Competition in growth and urns, Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝), Asymptotic Behaviour of Gossip Processes and Small-World Networks, An exponential inequality for autoregressive processes in adaptive tracking, Small trees in supercritical random forests, A Geometric Preferential Attachment Model of Networks II, Local tail bounds for functions of independent random variables, Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation, On Mesoscopic Equilibrium for Linear Statistics in Dyson’s Brownian Motion, On the number of iterations required by Von Neumann addition, Broadcast in the rendezvous model, On the maximum queue length in the supermarket model, On an online random k‐SAT model, Adaptive sampling schemes for density estimation, Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number, An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs, The condensation phase transition in random graph coloring, Choice under aggregate uncertainty, Theory of Classification: a Survey of Some Recent Advances, Concentration inequalities for dependent random variables via the martingale method, Anticoncentration for subgraph statistics, A unified approach to tail estimates for randomized incremental construction, Concentration and Moment Inequalities for Polynomials of Independent Random Variables, Optimal Re-centering Bounds, with Applications to Rosenthal-type Concentration of Measure Inequalities, Independent dominating sets in graphs of girth five, Subgraph counts for dense random graphs with specified degrees, Concentration for self-bounding functions and an inequality of Talagrand, Structure and complexity of extreme Nash equilibria, On the power of two choices: balls and bins in continuous time, On the Chromatic Index of Random Uniform Hypergraphs, Concentration of the hypergeometric distribution, The Restricted Isometry Property of Subsampled Fourier Matrices, Unnamed Item, Unnamed Item, Shannon sampling. II: Connections to learning theory, Local Rademacher complexities, Phase Transitions for Random Geometric Preferential Attachment Graphs, Phase transition for the vacant set left by random walk on the giant component of a random graph, Coloring Graphs with Minimal Edge Load, Faster 3-Coloring of Small-Diameter Graphs, Percolation on Random Graphs with a Fixed Degree Sequence, Annealed and quenched limit theorems for random expanding dynamical systems, Entropy and Concentration, Direct Sum Testing, The average number of spanning trees in sparse graphs with given degrees, Concentration inequalities, large and moderate deviations for self-normalized empirical processes, The symmetry in the martingale inequality, Tight multiple twins in permutations, Counting Steiner triple systems, The KLS isoperimetric conjecture for generalized Orlicz balls, Bounded memory folk theorem, On scaling limits of random trees and maps with a prescribed degree sequence, The list chromatic number of graphs with small clique number, A positive temperature phase transition in random hypergraph 2-coloring, Concentration of first hitting times under additive drift, Fluctuations of the front in a one-dimensional model for the spread of an infection, Local limit theorem and equivalence of dynamic and static points of view for certain ballistic random walks in i.i.d. environments, Asymptotic behavior of the quadratic knapsack problem, Condensation phenomena in preferential attachment trees with neighbourhood influence, A phase transition regarding the evolution of bootstrap processes in inhomogeneous random graphs, On the stabbing number of a random Delaunay triangulation, Frameworks and results in distributionally robust optimization, Long-term concentration of measure and cut-off, Convergence rates for empirical measures of Markov chains in dual and Wasserstein distances, Uniform concentration bounds for frequencies of rare events, Tightened exponential bounds for discrete-time conditionally symmetric martingales with bounded jumps, Packing nearly optimal Ramsey \(R(3,t)\) graphs, A large sample property in approximating the superposition of i.i.d. finite point processes, How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models, Dimension reduction for finite trees in \(\ell_1\), Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles, Time-uniform Chernoff bounds via nonnegative supermartingales, A quantization framework for smoothed analysis of Euclidean optimization problems, Random perturbation of low rank matrices: improving classical bounds, Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs, Packing tree factors in random and pseudo-random graphs, Connecting deterministic and stochastic metapopulation models, Thermodynamics and concentration, Normal approximations for discrete-time occupancy processes, The asymmetry number of finite tournaments, and some related results, Uniform accuracy of the maximum likelihood estimates for probabilistic models of biological sequences, Joint convergence of random quadrangulations and their cores, Detecting local network motifs, Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees, Is distribution-free inference possible for binary regression?, Aggregate risk and the Pareto principle, Transfer bounds for linear feature learning, Concentration of measure and cluster analysis., Randomly colouring graphs (a combinatorial view), An approximate version of Sumner's universal tournament conjecture, Upper bound on the decay of correlations in a general class of \(\mathrm{O}(N)\)-symmetric models, Book review of: D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms., The cook-book approach to the differential equation method, Talagrand's inductive method and isoperimetric inequalities involving random sets, Concentration inequalities using the entropy method, Cutting down trees with a Markov chainsaw, Concentration of the Kirchhoff index for Erdős-Rényi graphs, Local approximation of a metapopulation's equilibrium, A Bernstein-type inequality for functions of bounded interaction, Unsupervised slow subspace-learning from stationary processes, Scaling limits for some random trees constructed inhomogeneously, Near-critical SIR epidemic on a random graph with given degrees, Exponential inequalities for self-normalized martingales with applications, Large cliques in sparse random intersection graphs, Dominated concentration, On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography, Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits, Average-case analysis for the MAX-2SAT problem, User-friendly tail bounds for sums of random matrices, Intersecting families of discrete structures are typically trivial, The clustering coefficient of a scale-free random graph, Efficient randomized test-and-set implementations, A randomized embedding algorithm for trees, Spectra of lifted Ramanujan graphs, Moment inequalities for functions of independent random variables, Is the critical percolation probability local?, On the size of a finite vacant cluster of random interlacements with small intensity, Choice-memory tradeoff in allocations, Towards a scalable and robust DHT, Time-uniform, nonparametric, nonasymptotic confidence sequences, Robust random number generation for peer-to-peer systems, Universality of high-dimensional spanning forests and sandpiles, Geometry of the minimal spanning tree of a random 3-regular graph, QuickXsort: a fast sorting scheme in theory and practice, On index policies for stochastic minsum scheduling, Principal component analysis for multivariate extremes, A randomised approximation algorithm for the hitting set problem, Variations on twins in permutations, A constructive proof of a concentration bound for real-valued random variables, Rate of relaxation for a mean-field zero-range process, Expected worst-case partial match in random quadtries, Adaptive transfer learning, A random graph of moderate density, Scaling limit of random forests with prescribed degree sequences, Random regular graphs of non-constant degree: concentration of the chromatic number, Genealogy and spatial distribution of the \(N\)-particle branching random walk with polynomial tails, Genealogies in bistable waves, Sandwiching dense random regular graphs between binomial random graphs, Stopping criteria for, and strong convergence of, stochastic gradient descent on Bottou-Curtis-Nocedal functions, Mixed random-quasiperiodic cocycles, Approximation of the integrated density of states on sofic groups, Graph imperfection. II, Swarming on random graphs. II, Balanced routing of random calls, Laws of large numbers and tail inequalities for random tries and PATRICIA trees
