Random-Walk Laplacian for Frequency Analysis in Periodic Graphs

This paper presents the benefits of using the random-walk normalized Laplacian matrix as a graph-shift operator and defines the frequencies of a graph by the eigenvalues of this matrix. A criterion to order these frequencies is proposed based on the Euclidean distance between a graph signal and its shifted version with the transition matrix as shift operator. Further, the frequencies of a periodic graph built through the repeated concatenation of a basic graph are studied. We show that when a graph is replicated, the graph frequency domain is interpolated by an upsampling factor equal to the number of replicas of the basic graph, similarly to the effect of zero-padding in digital signal processing.

Homogenization of an elastic material reinforced by very strong fibres arranged along a periodic lattice

We provide in this paper homogenization results for the L 2 -topology leading to complete strain-gradient models and generalized continua. Actually, we extend to the L 2 -topology the results obtained in (Abdoul-Anziz & Seppecher, 2018 Homogenization of periodic graph-based elastic structures. Journal de l’Ecole polytechnique–Mathématiques 5 , 259–288) using a topology adapted to minimization problems set in varying domains. Contrary to (Abdoul-Anziz & Seppecher, 2018 Homogenization of periodic graph-based elastic structures. Journal de l’Ecole polytechnique–Mathématiques 5 , 259–288) we consider elastic lattices embedded in a soft elastic matrix. Thus our study is placed in the usual framework of homogenization. The contrast between the elastic stiffnesses of the matrix and the reinforcement zone is assumed to be very large. We prove that a suitable choice of the stiffness on the weak part ensures the compactness of minimizing sequences while the energy contained in the matrix disappears at the limit: the Γ-limit energies we obtain are identical to those obtained in (Abdoul-Anziz & Seppecher, 2018 Homogenization of periodic graph-based elastic structures. Journal de l’Ecole polytechnique–Mathématiques 5 , 259–288).

Zeta Functions with Respect to General Coined Quantum Walk of Periodic Graphs

We define a zeta function of a graph by using the time evolution matrix of a general coined quantum walk on it, and give a determinant expression for the zeta function of a finite graph. Furthermore, we present a determinant expression for the zeta function of an (inifinite) periodic graph.

Mean curvature self-shrinkers of high genus: Non-compact examples

We give the first rigorous construction of complete, embedded self-shrinking hypersurfaces under mean curvature flow, since Angenent’s torus in 1989. The surfaces exist for any sufficiently large prescribed genus g, and are non-compact with one end. Each has {4g+4} symmetries and comes from desingularizing the intersection of the plane and sphere through a great circle, a configuration with very high symmetry. Each is at infinity asymptotic to the cone in {\mathbb{R}^{3}} over a {2\pi/(g+1)} -periodic graph on an equator of the unit sphere {\mathbb{S}^{2}\subseteq\mathbb{R}^{3}} , with the shape of a periodically “wobbling sheet”. This is a dramatic instability phenomenon, with changes of asymptotics that break much more symmetry than seen in minimal surface constructions. The core of the proof is a detailed understanding of the linearized problem in a setting with severely unbounded geometry, leading to special PDEs of Ornstein–Uhlenbeck type with fast growth on coefficients of the gradient terms. This involves identifying new, adequate weighted Hölder spaces of asymptotically conical functions in which the operators invert, via a Liouville-type result with precise asymptotics.

PERIODIC -GRAPH ALGEBRAS REVISITED

Let $P$ be a finitely generated cancellative abelian monoid. A $P$-graph ${\rm\Lambda}$ is a natural generalization of a $k$-graph. A pullback of ${\rm\Lambda}$ is constructed by pulling it back over a given monoid morphism to $P$, while a pushout of ${\rm\Lambda}$ is obtained by modding out its periodicity, which is deduced from a natural equivalence relation on ${\rm\Lambda}$. One of our main results in this paper shows that, for some $k$-graphs ${\rm\Lambda}$, ${\rm\Lambda}$ is isomorphic to the pullback of its pushout via a natural quotient map, and that its graph $\text{C}^{\ast }$-algebra can be embedded into the tensor product of the graph $\text{C}^{\ast }$-algebra of its pushout and $\text{C}^{\ast }(\text{Per}\,{\rm\Lambda})$. As a consequence, in this case, the cycline algebra generated by the standard generators corresponding to equivalent pairs is a maximal abelian subalgebra, and there is a faithful conditional expectation from the graph $\text{C}^{\ast }$-algebra onto it.

Periodic Rigidity on a Variable Torus Using Inductive Constructions

In this paper we prove a recursive characterisation of generic rigidity for frameworks periodic with respect to a partially variable lattice. We follow the approach of modelling periodic frameworks as frameworks on a torus and use the language of gain graphs for the finite counterpart of a periodic graph. In this setting we employ variants of the Henneberg operations used frequently in rigidity theory.