Search results for "Bounded function"
showing 10 items of 508 documents
THE MINIMIZING TOTAL VARIATION FLOW WITH MEASURE INITIAL CONDITIONS
2004
In this paper we obtain existence and uniqueness of solutions for the Cauchy problem for the minimizing total variation flow when the initial condition is a Radon measure in ℝN. We study limit solutions obtained by weakly approximating the initial measure μ by functions in L1(ℝN). We are able to characterize limit solutions when the initial condition μ=h+μs, where h∈L1(ℝN)∩L∞(ℝN), and μs=αℋk⌊ S,α≥0,k is an integer and S is a k-dimensional manifold with bounded curvatures. In case k<N-1 we prove that the singular part of the solution does not move, it remains equal to μs for all t≥0. In particular, u(t)=δ0 when u(0)=δ0. In case k=N-1 we prove that the singular part of the limit solution …
On modal mu-calculus over finite graphs with bounded strongly connected components.
2010
For every positive integer k we consider the class SCCk of all finite graphs whose strongly connected components have size at most k. We show that for every k, the Modal mu-Calculus fixpoint hierarchy on SCCk collapses to the level Delta2, but not to Comp(Sigma1,Pi1) (compositions of formulas of level Sigma1 and Pi1). This contrasts with the class of all graphs, where Delta2=Comp(Sigma1,Pi1).
Maximal Operators with Respect to the Numerical Range
2018
Let $\mathfrak{n}$ be a nonempty, proper, convex subset of $\mathbb{C}$. The $\mathfrak{n}$-maximal operators are defined as the operators having numerical ranges in $\mathfrak{n}$ and are maximal with this property. Typical examples of these are the maximal symmetric (or accretive or dissipative) operators, the associated to some sesquilinear forms (for instance, to closed sectorial forms), and the generators of some strongly continuous semi-groups of bounded operators. In this paper the $\mathfrak{n}$-maximal operators are studied and some characterizations of these in terms of the resolvent set are given.
Symmetry of minimizers with a level surface parallel to the boundary
2015
We consider the functional $$I_\Omega(v) = \int_\Omega [f(|Dv|) - v] dx,$$ where $\Omega$ is a bounded domain and $f$ is a convex function. Under general assumptions on $f$, G. Crasta [Cr1] has shown that if $I_\Omega$ admits a minimizer in $W_0^{1,1}(\Omega)$ depending only on the distance from the boundary of $\Omega$, then $\Omega$ must be a ball. With some restrictions on $f$, we prove that spherical symmetry can be obtained only by assuming that the minimizer has one level surface parallel to the boundary (i.e. it has only a level surface in common with the distance). We then discuss how these results extend to more general settings, in particular to functionals that are not differenti…
Challenging aspects in Consensus protocols for networks
2008
Results on consensus protocols for networks are presented. The basic tools and the main contribution available in the literature are considered, together with some of the related challenging aspects: estimation in networks and how to deal with disturbances is considered. Motivated by applications to sensor, peer-to- peer, and ad hoc networks, many papers have considered the problem of estimation in a consensus fashion. Here, the unknown but bounded (UBB) noise affecting the network is addressed in details. Because of the presence of UBB disturbances convergence to equilibria with all equal components is, in general, not possible. The solution of the epsiv-consensus problem, where the states…
Optimal Resource Discovery Paths of Gnutella2
2008
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal query paths for the peer-to-peer resource discovery problem. Global knowledge of the topology and the resources from the peer-to-peer network are required as an input to the algorithm. The algorithm provides an objective measure for defining how good local search algorithms are. The performance is evaluated in simulated peer-to-peer scenarios and in the measured Gnutella2 P2P network topology with four local search algorithms: breadth-first search, self-avoiding random walker, highest degree search and Dynamic Query …
Bounded Computational Capacity Equilibrium
2010
We study repeated games played by players with bounded computational power, where, in contrast to Abreu and Rubisntein (1988), the memory is costly. We prove a folk theorem: the limit set of equilibrium payoffs in mixed strategies, as the cost of memory goes to 0, includes the set of feasible and individually rational payoffs. This result stands in sharp contrast to Abreu and Rubisntein (1988), who proved that when memory is free, the set of equilibrium payoffs in repeated games played by players with bounded computational power is a strict subset of the set of feasible and individually rational payoffs. Our result emphasizes the role of memory cost and of mixing when players have bounded c…
Local maximal operators on fractional Sobolev spaces
2016
In this note we establish the boundedness properties of local maximal operators MG on the fractional Sobolev spaces Ws;p(G) whenever G is an open set in Rn, 0 < s < 1 and 1 < p < 1. As an application, we characterize the fractional (s;p)-Hardy inequality on a bounded open set by a Maz'ya-type testing condition localized to Whitney cubes. pq(G) whenever G is an open set in R n , 0 < s < 1 and 1 < p;q <1. Our main focus lies in the mapping properties of MG on a fractional Sobolev space W s;p (G) with 0 < s < 1 and 1 < p < 1, see Section 2 for the denition or (3) for a survey of this space. The intrinsically dened function space W s;p (G) on a given domain G coincides with the trace space F s …
Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm
2020
In 1996, Bodlaender showed the celebrated result that an optimal tree decomposition of a graph of bounded treewidth can be found in linear time. The algorithm is based on an algorithm of Bodlaender and Kloks that computes an optimal tree decomposition given a non-optimal tree decomposition of bounded width. Both algorithms, in particular the second, are hardly accessible. We present the second algorithm in a much simpler way in this paper and refer to an extended version for the first. In our description of the second algorithm, we start by explaining how all tree decompositions of subtrees defined by the nodes of the given tree decomposition can be enumerated. We group tree decompositions …
Unbounded derivations and *-automorphisms groups of Banach quasi *-algebras
2018
This paper is devoted to the study of unbounded derivations on Banach quasi *-algebras with a particular emphasis to the case when they are infinitesimal generators of one parameter automorphisms groups. Both of them, derivations and automorphisms are considered in a weak sense; i.e., with the use of a certain families of bounded sesquilinear forms. Conditions for a weak *-derivation to be the generator of a *-automorphisms group are given.