scholarly journals Identities and Inequalities for Tree Entropy

2009 ◽  
Vol 19 (2) ◽  
pp. 303-313 ◽  
Author(s):  
RUSSELL LYONS

The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses Fuglede–Kadison determinants, while another uses effective resistance. We use the latter to prove that tree entropy respects stochastic domination. We also prove that tree entropy is non-negative in the unweighted case, a special case of which establishes Lück's Determinant Conjecture for Cayley-graph Laplacians. We use techniques from the theory of operators affiliated to von Neumann algebras.

1985 ◽  
Vol 37 (5) ◽  
pp. 769-784 ◽  
Author(s):  
John C. Quigg

In the duality for locally compact groups, much use is made of a version of the Hopf algebra technique in the context of von Neumann algebras, culminating in the theory of Kac algebras [6], [14]. It seems natural to ask whether something like a Hopf algebraic structure can be defined on the pre-dual of a Kac algebra. This leads to the question of whether the multiplication on a von Neumann algebra M, viewed as a linear map m from M ⊙ M (the algebraic tensor product) to M, can be pre-transposed to give a co-multiplication on the pre-dual M*, i.e., a linear map m* from M* to the completion of M* ⊙ M* with respect to some cross-norm. A related question is whether the multiplication on a C*-algebra A can be transposed to give a co-multiplication on the dual A*. Of course, this can be regarded as a special case of the preceding question by taking M = A**, where the double dual A** is identified with the enveloping von Neumann algebra of A.


2009 ◽  
Vol 01 (02) ◽  
pp. 153-175 ◽  
Author(s):  
RUSSELL LYONS

Uniform spanning trees on finite graphs and their analogues on infinite graphs are a well-studied area. On a Cayley graph of a group, we show that they are related to the first ℓ2-Betti number of the group. Our main aim, however, is to present the basic elements of a higher-dimensional analogue on finite and infinite CW-complexes, which relate to the higher ℓ2-Betti numbers. One consequence is a uniform isoperimetric inequality extending work of Lyons, Pichot, and Vassout. We also present an enumeration similar to recent work of Duval, Klivans and Martin.


2019 ◽  
Author(s):  
Serban-Valentin Stratila ◽  
Laszlo Zsido

Author(s):  
D. E. Edmunds ◽  
W. D. Evans

This chapter is concerned with closable and closed operators in Hilbert spaces, especially with the special classes of symmetric, J-symmetric, accretive and sectorial operators. The Stone–von Neumann theory of extensions of symmetric operators is treated as a special case of results for compatible adjoint pairs of closed operators. Also discussed in detail is the stability of closedness and self-adjointness under perturbations. The abstract results are applied to operators defined by second-order differential expressions, and Sims’ generalization of the Weyl limit-point, limit-circle characterization for symmetric expressions to J-symmetric expressions is proved.


2009 ◽  
Vol 08 (05) ◽  
pp. 601-615
Author(s):  
JOHN D. LAGRANGE

If {Ri}i ∈ I is a family of rings, then it is well-known that Q(Ri) = Q(Q(Ri)) and Q(∏i∈I Ri) = ∏i∈I Q(Ri), where Q(R) denotes the maximal ring of quotients of R. This paper contains an investigation of how these results generalize to the rings of quotients Qα(R) defined by ideals generated by dense subsets of cardinality less than ℵα. The special case of von Neumann regular rings is studied. Furthermore, a generalization of a theorem regarding orthogonal completions is established. Illustrative example are presented.


Author(s):  
J.M BUDD ◽  
Y. VAN GENNIP

An emerging technique in image segmentation, semi-supervised learning and general classification problems concerns the use of phase-separating flows defined on finite graphs. This technique was pioneered in Bertozzi and Flenner (2012, Multiscale Modeling and Simulation10(3), 1090–1118), which used the Allen–Cahn flow on a graph, and was then extended in Merkurjev et al. (2013, SIAM J. Imaging Sci.6(4), 1903–1930) using instead the Merriman–Bence–Osher (MBO) scheme on a graph. In previous work by the authors, Budd and Van Gennip (2020, SIAM J. Math. Anal.52(5), 4101–4139), we gave a theoretical justification for this use of the MBO scheme in place of Allen–Cahn flow, showing that the MBO scheme is a special case of a ‘semi-discrete’ numerical scheme for Allen–Cahn flow. In this paper, we extend this earlier work, showing that this link via the semi-discrete scheme is robust to passing to the mass-conserving case. Inspired by Rubinstein and Sternberg (1992, IMA J. Appl. Math.48, 249–264), we define a mass-conserving Allen–Cahn equation on a graph. Then, with the help of the tools of convex optimisation, we show that our earlier machinery can be applied to derive the mass-conserving MBO scheme on a graph as a special case of a semi-discrete scheme for mass-conserving Allen–Cahn. We give a theoretical analysis of this flow and scheme, proving various desired properties like existence and uniqueness of the flow and convergence of the scheme, and also show that the semi-discrete scheme yields a choice function for solutions to the mass-conserving MBO scheme.


Sign in / Sign up

Export Citation Format

Share Document