* uschian groups of the first kind * Automorphic forms and functions * Hecke operators and the zeta-functions associated with modular forms * Elliptic curves * Abelian extensions of imaginary quadratic fields and complex multiplication of elliptic curves * Modular functions of higher level * Zeta-functions of algebraic curves and abelian varieties * The cohomology group assoicated with cusp forms * Arithmetic Fuschian groups

Introduction to the arithmetic theory of automorphic functions

The whole frame of interconnections in complex networks hinges on a specific set of structural nodes, much smaller than the total size, which, if activated, would cause the spread of information to the whole network, or, if immunized, would prevent the diffusion of a large scale epidemic. Localizing this optimal, that is, minimal, set of structural nodes, called influencers, is one of the most important problems in network science. Despite the vast use of heuristic strategies to identify influential spreaders, the problem remains unsolved. Here we map the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network. Big data analyses reveal that the set of optimal influencers is much smaller than the one predicted by previous heuristic centralities. Remarkably, a large number of previously neglected weakly connected nodes emerges among the optimal influencers. These are topologically tagged as low-degree nodes surrounded by hierarchical coronas of hubs, and are uncovered only through the optimal collective interplay of all the influencers in the network. The present theoretical framework may hold a larger degree of universality, being applicable to other hard optimization problems exhibiting a continuous transition from a known phase.

Influence maximization in complex networks through optimal percolation

Groupes et algébres de lie

Spectral algorithms are classic approaches to clustering and community detection in networks. However, for sparse networks the standard versions of these algorithms are suboptimal, in some cases completely failing to detect communities even when other algorithms such as belief propagation can do so. Here, we present a class of spectral algorithms based on a nonbacktracking walk on the directed edges of the graph. The spectrum of this operator is much better-behaved than that of the adjacency matrix or other commonly used matrices, maintaining a strong separation between the bulk eigenvalues and the eigenvalues relevant to community structure even in the sparse case. We show that our algorithm is optimal for graphs generated by the stochastic block model, detecting communities all of the way down to the theoretical limit. We also show the spectrum of the nonbacktracking operator for some real-world networks, illustrating its advantages over traditional spectral clustering.

/pdf/spectral-redemption-in-clustering-sparse-networks-13u67nq4cd.pdf

Spectral redemption in clustering sparse networks

Publisher Summary This chapter focuses on zeta functions of finite graphs and representations of p-adic groups. It discusses two different subjects: first is a combinatorial problem in algebraic graph theory, and the other is arithmetic of discrete subgroups of p-adic groups and their representations. The chapter presents the notation and basic definitions in graph theory. It also presents a generalization of the definition of zeta function. Spectrum of a finite multigraph is analyzed in the chapter. Moreover, the chapter also describes harmonic functions and the Hodge decomposition. The chapter also presents the computation of zeta functions Zx(u) for some well known families of graphs. These computations give many examples of graphs that are not Ramanujan graphs.

/pdf/zeta-functions-of-finite-graphs-and-representations-of-p-55gtlx2ix6.pdf

Zeta Functions of Finite Graphs and Representations of $p$-Adic Groups

On zeta and l-functions of finite graphs

Artin type l-functions and the density theorem for prime cycles on finite graphs

/pdf/shimura-curves-as-intersections-of-humbert-surfaces-and-17oa05h6nd.pdf

Shimura curves as intersections of Humbert surfaces and defining equations of {QM}-curves of genus two

We reconstruct Brumer's family with 3-parameters of curves of genus two whose jacobian varieties admit a real multiplication of discriminant 5. Our method is based on the descent theory in geometric Galois theory which can be compared with a classical problem of Noether. Namely, we first construct a 3-parameter family of polynomials $f(X)$ of degree 6 whose Galois group is isomorphic to the alternating group $A_5$. Then we study the family of curves defined by $Y^2=f(X)$, showing that they are equivalent to Brumer's family. The real multiplication will be described in three distinct ways, i.e., by Humbert's modular equation, by Poncelet's pentagon, and by algebraic correspondences.

https://projecteuclid.org/download/pdf_1/euclid.tmj/1178207751

Ki Ichiro Hashimoto

Papers

Zeta Functions of Finite Graphs and Representations of $p$-Adic Groups

On zeta and l-functions of finite graphs

Artin type l-functions and the density theorem for prime cycles on finite graphs

Shimura curves as intersections of Humbert surfaces and defining equations of {QM}-curves of genus two

On Brumer's family of {RM}-curves of genus two