Esteban Bautista
email: esteban.bautista-ruiz@ens-lyon.fr

Patrice Abry

Paulo Gonçalves

L γ -PageRank for Semi-Supervised Learning

Keywords: Semi-Supervised Learning, PageRank, Laplacian powers, Diffusion on graphs, Signed graphs, Optimal tuning, MNIST

published or not. The documents may come

Introduction

Context

Graph-based Semi-Supervised Learning (G-SSL) is a modern important tool for classification. While Unsupervised Learning fully relies on the data structure and Supervised Learning demands extensive labeled examples, G-SSL combines limited tagged examples and the data structure to provide satisfactory results. This makes the field of G-SSL of utmost importance as nowadays large and structured datasets can be readily accessed in comparison to expert data which may be hard to obtain. Examples where G-SSL provide state of the art results are vast, ranging from classification of BitTorrent contents and users [START_REF] Avrachenkov | Classification of Content and Users in BitTorrent by Semi-supervised Learning Methods[END_REF], text categorization [START_REF] Subramanya | Soft-supervised learning for text classification[END_REF], medical diagnosis [START_REF] Zhao | Compact graph based semi-supervised learning for medical diagnosis in alzheimer's disease[END_REF], or zombie hunting under BGP protocol [START_REF] Fontugne | BGP Zombies: an Analysis of Beacons Stuck Routes[END_REF]. Algorithmically, PageRank constitutes the reference tool in G-SSL. It has spurred a deluge of theory [START_REF] Chung | Pagerank as a discrete green's function[END_REF][START_REF] Avrachenkov | Mean Field Analysis of Personalized PageRank with Implications for Local Graph Clustering[END_REF][START_REF] Litvak | Characterization of tail dependence for in-degree and pagerank[END_REF][START_REF] Chung | Four cheeger-type inequalities for graph partitioning algorithms[END_REF], applications [START_REF] Avrachenkov | Pagerank based clustering of hypertext document collections[END_REF][START_REF] Graham | Distributing antidote using pagerank vectors[END_REF][START_REF] Avrachenkov | Classification of Content and Users in BitTorrent by Semi-supervised Learning Methods[END_REF][START_REF] Fontugne | BGP Zombies: an Analysis of Beacons Stuck Routes[END_REF] and implementations [START_REF] Andersen | Using pagerank to locally partition a graph[END_REF][START_REF] Andersen | Detecting sharp drops in pagerank and a simplified local partitioning algorithm[END_REF]. Despite successes, the performance of G-SSL can still be improved, particularly for fuzzy graphs or imbalance of labeled datasets, two situations that we aim to address in this work.

Related works

In graphs, a ground truth class is represented by a subset of graph nodes, denoted S gt . Thus, in graphs, the classification challenge corresponds to finding the binary partition of the graph vertices: V = S gt ∪S c gt . If the data is structured, then S gt forms a cluster, i.e., a densely and strongly connected graph region that is weakly connected to the rest of the graph. This is exploited by G-SSL methods that essentially amount to diffuse information placed on the tagged nodes of S gt , through the graph, expecting a concentration of information in S gt that reveals its members. Among the family of G-SSL propositions obeying this rationale [START_REF] Zhou | Learning with local and global consistency[END_REF][START_REF] Zhou | Spectral clustering and transductive learning with multiple views[END_REF][START_REF] Avrachenkov | Generalized Optimization Framework for Graph-based Semi-supervised Learning[END_REF], PageRank is considered the state of the art approach in terms of performance, algorithms and theoretical understanding. The PageRank algorithm can be interpreted as random walkers that start from the labeled points and, at each step, diffuse to an adjacent node with probability α or restart to the starting point with probability (1α).

In the limit (of infinite steps), each node is endowed a score proportional to the number of visits to it. Thus, vertices of S gt are expected to get larger scores as walkers get trapped for a long time by the connected structure of S gt . The capacity of PageRank to confine the random walks within S gt depends on a topological parameter of S gt known as the Cheeger ratio, or conductance, counting the ratio of external and internal connections of S gt . More precisely, it is shown in [START_REF] Andersen | Using pagerank to locally partition a graph[END_REF] that the probability of a PageRank random walker leaving S gt is upper bounded by the Cheeger ratio of S gt . In other terms, a small Cheeger ratio designates a strongly disconnected cluster that PageRank can eventually easily detect. Based on the scores, a binary partitioning via a sweep-cut procedure allows to retrieve an estimate Ŝgt . This procedure is granted to obtain an estimate Ŝgt with a small Cheeger ratio if a sharp drop in magnitude appears on the sorted scores, then Ŝgt is potentially a good estimation of the ground truth S gt [START_REF] Andersen | Detecting sharp drops in pagerank and a simplified local partitioning algorithm[END_REF]. In [START_REF] Zhou | Semi-supervised learning by higher order regularization[END_REF], an issue affecting G-SSL methods, coined as the 'curse of flatness', was highlighted. Such work proposes to extend PageRank by iterating the random walk Laplacian in the PageRank solution, as a mean to enforce Sobolev regularity to the vertex scores and amend the aforementioned problem. However, with this approach, guarantees that a sweep-cut still leads to a meaningful clustering remains unproven and it can be given neither diffusion nor topological interpretations. Thus, preventing insights on the properties and qualities of partitions it retrieves. This makes it hard to build upon and to address the issues listed above.

Goals, contributions and outline

In this work, we revisit Laplacian powers as a way to improve G-SSL and to address the issues listed above. We propose a generalization of PageRank by using (non necessarily integers) powers of the combinatorial Laplacian matrix L γ (γ > 0). In contradistinction to [START_REF] Zhou | Semi-supervised learning by higher order regularization[END_REF], our approach (i) enables us to have an explicit closed form expression of the underlying optimization problem (see Eq. 7); (ii) permits a diffusion and a topological interpretation. In our approach, we show that, for each γ, a new graph is generated. These new graphs, which we refer to as L γ -graphs, reweight the links of the original structure and create edges, which can be positive or negative, between initially far-distant nodes. This topological change has the potential to improve classification as the signed edges introduce what can be seen as agreements (positive edges) or disagreements (negative edges) between nodes, allowing to revamp clusters as groups of nodes agreeing between them and disagreeing with the rest of the graph. This paper investigates the potential of these L γ -graphs to better delineate a targeted S gt , compared to PageRank. The theoretical analysis of our proposition permits to extend the Cheeger ratio to L γ -graphs and to prove that if there is a L γ -graph in which S gt has a smaller Cheeger ratio, then we can more accurately identify it with our generalized L γ -PageRank procedure using the sweep-cut technique. Then, by means of numerical investigations, we point the existence of an optimal γ value that maximizes performance. Finally, we propose an algorithm that allows to estimate the optimal γ directly from the graph and the labeled points.

The paper is organized as follows: Section 2 sets definitions and recalls classical results on G-SSL. Section 3 presents the main contributions of the paper: Section 3.1 introduces L γ -graphs; Section 3.2 defines L γ -PageRank and its theoretical analysis; Section 3.3 discusses the existence of an optimal γ and its estimation. Section 4 shows the improvements in classification performance permitted by L γ -PageRank on several real world datasets commonly used in classification, as well as the relevance of the estimation procedure for the optimal tuning.

State of the art

Preliminaries

Let G(V, E, w) denote a weighted undirected graph with no self-loops in which: V refers to the set of vertices of cardinality V = N ; E denotes the set of edges, where a connected pair u, v ∈ V, denoted u ∼ v, implies (u, v), (v, u) ∈ E; and w ∶ E → R + is a weight function. The graph adjacency matrix is denoted by W in which W uv = w(u, v) if u ∼ v and W uv = 0 otherwise. For a vertex u ∈ V we let d u = ∑ v W uv denote the degree of u and D = diag(d 1 , . . . , d N ) be the diagonal matrix of degrees. Let ∆ uv denote the geodesic distance between u and v. Given a set of nodes S ⊆ V, we denote by 1 S the indicator function of such set, meaning that (1 S ) u = 1 if u ∈ S and (1 S ) u = 0 otherwise. The volume of S is defined to be vol(S) = ∑ u∈S d u . We refer to the volume of the entire graph by vol(G). Let f ∶ V → R be a signal lying on the graph vertices. Graph signals are represented as column vectors, where f u refers to the signal value at node u. The sum of signal values in the set S is denoted by f (S) = ∑ u∈S f u . We denote by L = D -W the combinatorial graph Laplacian which, by construction, is a real symmetric matrix with eigendecomposition of the form L = QΛQ T . The positivity of the Dirichlet form

f T Lf = ∑ u∼v W uv (f i -f j ) 2 ≥ 0 implies that L has real non-negative eigenvalues.
A random walk on a graph is a Markov chain where the nodes form the state space. Thus, when a walker is located at a node u at a specific time t, at time step t + 1 the walker moves to a neighbor v with probability P uv , where P = D -1 W . If the graph signal χ represents the distribution for the random walk starting point, then the signal x T = χ T P t denotes the distribution of the walker position at time t. Independently of the starting distribution, if the graph is connected and not bipartite, the random walk converges to a stationary distribution π T = π T P , where

π u = d u vol(G).
Clustering is the search of groups of nodes that are strongly connected between them and weakly connected to the rest of the graph. The Cheeger ratio is a metric that counts the ratio of external and internal connections of a group of nodes, thus assessing its pertinence as a cluster, while penalizing uninteresting solutions that may fit the cluster criteria, like isolated nodes linked by a few edges. It is defined as follows.

Definition 1 For a set of nodes S ⊆ V, the Cheeger ratio, or conductance, of S is defined as:

h S ∶= ∑ u∈S ∑ v∈S c W uv min{vol(S), vol(S c )} . (1)
Thus, we define clustering as finding the binary partition of the graph vertices: V = S ∪ S c such that S has low h S .

PageRank-based Semi-Supervised Learning

Let V Sgt ⊆ S gt denote the set of nodes tagged to belong to the ground truth S gt and y be indicator function of V Sgt , i.e. y u = 1 if node u ∈ V Sgt and y u = 0 otherwise. The PageRank G-SSL is defined as the solution to the optimization problem [START_REF] Avrachenkov | Generalized Optimization Framework for Graph-based Semi-supervised Learning[END_REF]:

arg min f f T D -1 LD -1 f + µ (f -y) T D -1 (f -y) . (2)
Optimization problem (2) can be seen as the search of a smooth graph signal in the sense that strongly connected nodes should have similar values (left term), while the labeled data is respected (right term), and a regularization parameter µ tunes the trade off between both terms. Notably, problem (2) is convex with closed form solution given by [START_REF] Avrachenkov | Generalized Optimization Framework for Graph-based Semi-supervised Learning[END_REF]:

f = µ LD -1 + µI -1 y. (3)
We present the PageRank solution in this form as it will simplify derivations in the reminder of the paper, but it is not hard to rewrite (3) to its more popular version:

f T = (1 -α) ∑ ∞ k=0 α k y T P k where α = 1 (1 + µ)
. This latter helps to expose the connection between PageRank and diffusion processes. Namely, it corresponds to the equilibrium state of a random walk that decides either to continue with probability α, or to restart to the starting distribution y with probability (1α). As y = ∑ u∈V S gt δ u is the combination of different starting distributions, it is clear that the PageRank score at a particular node is proportional to the probability of finding a walker, at equilibrium, at this node. PageRank diffusion satisfies the following properties [START_REF] Tsiatas | Diffusion and clustering on large graphs[END_REF]: (i ) mass preservation: ∑ u∈V f u = ∑ u∈V y u ; (ii ) stationarity: f = π if y = π; and (iii ) limit behavior: f → π as µ → 0 and f → y as µ → ∞.

In [START_REF] Andersen | Using pagerank to locally partition a graph[END_REF], it is shown that the behavior of this type of random walks is tightly related to the cluster structure of graphs. This connection between PageRank and clustering is quantified in the following result.

Lemma 1 [START_REF] Andersen | Using pagerank to locally partition a graph[END_REF] Let S ⊂ V be an arbitrary set with vol(S) ≤ vol(G) 2. For a labeled point placed at a node u ∈ S selected with probability proportional to its degree in S, i.e. d u vol(S), the PageRank satisfies

E[f (S c )] ≤ h S µ . (4)
This lemma implies that if we apply PageRank diffusion to the labels of S gt and it has a small h Sgt , then the probability of finding a walker outside S gt is small and the nodes with largest PageRank value should index S gt . This is formalized in [START_REF] Andersen | Using pagerank to locally partition a graph[END_REF] and [START_REF] Andersen | Detecting sharp drops in pagerank and a simplified local partitioning algorithm[END_REF]. The former shows that a proxy Ŝgt that has small h Ŝgt can be found by looking for regions of high concentration of PageRank mass. The latter improves that result, showing that Ŝgt can be found more easily by looking for a sharp drop in the PageRank scores. To state their result, we first introduce the sweep-cut technique.

Definition 2 A sweep-cut is a procedure to retrieve a partition V = Ŝgt ∪ Ŝc gt from the PageRank vector. The procedure is as follows:

• Let v 1 , . . . , v N be a rearrangement of the vertices in descending order, so that the permutation vector q satisfies q vi = f vi d vi ≥ q vi+1 = f vi+1 d vi+1 • Let S j = {v 1 , . . . , v j } be the set of vertices indexed by the first j elements of q.

• Let τ (f ) = min j h Sj • Retrieve Ŝgt = S j for the set S j achieving τ (f ) Now, we state the result of [START_REF] Andersen | Detecting sharp drops in pagerank and a simplified local partitioning algorithm[END_REF], showing that if there is a sharp drop in rank at S j , then the set S j has small Cheeger ratio.

Lemma 2 [START_REF] Andersen | Detecting sharp drops in pagerank and a simplified local partitioning algorithm[END_REF] Let h ∈ (0, 1), j be any index in [1, N ] and α ∈ (0, 1] denote the PageRank restarting probability. Let C(S j , S c j ) = ∑ u∈Sj ∑ v∈S c j W uv be the numerator of the Cheeger ratio. Then, S j satisfies one of the following: (a) C(S j , S c j ) < 2hvol(S j ); or (b) there is some index k > j such that vol(S k ) ≥ vol(S j )(1 + h) and q k ≥ q jα hvol(S j )

In other words, this lemma implies that either S j has a small Cheeger ratio, or there is no sharp drop at q j .

Generalization to multiple classes

PageRank G-SSL can be readily generalized to a multi-class setting in which labeled points of K classes are used to find a partition V = S 1 ∪ S 2 ∪ ⋅ ⋅ ⋅ ∪ S K . Let V S k denote the labeled points of class k and the indicator function of V S k be placed as the k-th column of a matrix Y . Then, the multi-class PageRank is computed in matrix form as [START_REF] Sokol | Graph-based semi-supervised learning methods and quick detection of central nodes[END_REF]: min

F {F T D -1 LD -1 F + µ (F -Y ) T D -1 (F -Y )}, with classification matrix given in closed form by F = µ LD -1 + µI -1 Y .
This leads a node u to have K associated scores and it is assigned to the cluster k satisfying arg max k F uk . In [START_REF] Sokol | Graph-based semi-supervised learning methods and quick detection of central nodes[END_REF], the following rule explaining the classification is provided: let pr uv denote the probability that a random walk reaches node v before restarting to node u, then v is assigned to the class k that satisfies the inequality

u∈V k pr uv ≥ w∈V k ′ pr wv , ∀k ′ ≠ k. (5)
This inequality highlights an important issue of the multi-class approach as the sums depend on the cardinality of the sets of labeled points. Thus, cases of unbalanced number of labeled points can potentially bias the classification. 3 L γ -PageRank for Semi-Supervised Learning

3.1 The L γ -graphs
In this work, we propose to change the graph topology in which the problem is solved as a means to improve classification. We evoke such change by considering powers of the Laplacian matrix, noting that the L γ operator, for γ > 0, generates a new graph for every fixed γ value. More precisely, the Laplacian definition indicates that

L γ = V Λ γ V T = D γ -W γ codes for a new graph, where [D γ ] uu = [L γ ] uu refers to a generalized degree matrix and [W γ ] uv = -[L γ ] uv , with u ≠ v, to a generalized adjacency matrix that satisfies the Laplacian property [D γ ] uu = ∑ v [W γ ] uv since L γ 1 = 0.
We refer to such graphs as L γ -graphs.

The L γ -graphs reweight the edges of the original structure and creates links between originally far-distant nodes. Indeed, for γ ∈ Z the new edges can be related to paths of different lengths. To have a grasp on this, let us take the topology from γ = 2 as an example: for

L 2 = (D -W ) 2 = D 2 + W 2 -(DW + W D), the ele- ments of the emanating graph are given as [D 2 ] uu = [L 2 ] uu = D 2 uu + ∑ v W 2 uv and [W 2 ] uv = -[L 2 ] uv = (D uu + D vv )W uv -W 2 uv -∑ l≠u,v W ul W lv ,
showing that, in W 2 , nodes originally connected get their link reweighted (still, remaining positive) while those at a 2-hop distance become linked by a negatively weighted edge. This change in the topology has the potential to impact clustering, as the emergence of positive and negative edges opens the door for an interpretation in terms of an agreement (positive edge) or a disagreement (negative edge) between datapoints. Hence, clustering can be revamped to assume that nodes agreeing should belong to the same cluster and nodes disagreeing should belong to different ones. From this perspective, a revisit to the case of γ = 2 shows that this is indeed a potentially good topology since, for several graphs, it is more likely that vertices having a 2-hop distance lie in different clusters than in the same one, thus creating a considerable amount of disagreements between clusters, that may enhance their separability. This idea is illustrated in Figure 1, where for a realization of the planted partition model we show that with γ = 2 a big amount of negative edges appear between clusters. Thus, in the reminder of the paper we investigate if for a target set of nodes S gt , the detection of S gt can be enhanced by solving the clustering problem in some of these new graphs.

Remark 1 The graphs emerging in the regime 0 < γ < 1 have already been studied in [START_REF] Pérez Riascos | Fractional dynamics on networks: Emergence of anomalous diffusion and lévy flights[END_REF][START_REF] De Nigris | Fractional graph-based semi-supervised learning[END_REF][START_REF] Bautista | Lévy Flights for Graph Based Semi-Supervised Classification[END_REF], where it is shown that such graphs remain within the class of graphs with only positive edges, hence preserving the random walk framework. In these works, the graphs were shown to embed the so-called Lévy flight, permitting random walkers to perform long-distant jumps in a single step.

The L γ -PageRank method

The signed graphs emerging from L γ preclude the employment of the random walkbased approaches to find clusters, as 'negative transitions' appear. Thus, the L γgraphs call for a technique to find clusters in such graphs. In this subsection, we introduce L γ -PageRank, a generalization of PageRank to finds clusters on the L γgraphs. Further, we analyze the L γ -PageRank theoretical properties and clustering capabilities.

For our analysis, it is useful to first extend some of the graph topological definitions to the L γ -graphs. Let vol γ (S) = ∑ u∈S [D γ ] uu denote the generalized volume of S. Let π γ denote a generalized stationary distribution with entries given by (π

γ ) u = [D γ ] uu vol γ (G). It is important to stress that [D γ ] uu = ∑ k λ γ k Q 2 uk ≥ 0.
Thus, for all γ > 0, the generalized volume and the generalized stationary distribution are non-negative quantities.

The Cheeger ratio metric, lacking the ability to account for the sign of edges, cannot be employed to assess the presence of clusters in the L γ -graphs. Thus, we generalize the Cheeger ratio definition to the new graphs as follows.

Definition 3 For a set of nodes S ⊆ V , the generalized Cheeger ratio, or generalized conductance, of S is defined as

h (γ) S = ∑ u∈S ∑ v∈S c [W γ ] uv min (vol γ (S), vol γ (S c )) (6)
This generalization of the Cheeger ratio is mathematically sound. First, it is a non-negative quantity since

∑ u∈S ∑ v∈S c [W γ ] uv = 1 T S L γ 1 S ≥ 0. Second,
the set S attaining the minimum value coincides with a sensible clustering.

To show the latter, let the edges in W γ be split according to their sign as

W γ = W γ + + W γ -. Let A in (S) = ∑ u∈S ∑ w∈S W + γ uw be the sum of agree- ments within S, A out (S) = ∑ u∈S ∑ v∈S c W +
γ uv the agreements between S and S c , D in (S) = ∑ u∈S ∑ w∈S W - γ uw the disagreements within S, and D out (S) = ∑ u∈S ∑ v∈S c W - γ uv the disagreements between S and S c . Then we state the following lemma. The proof is provided in Appendix A.1.

Lemma 3 shows that, for clustering in the L γ -graphs, it is good to search for sets with small generalized Cheeger ratio as those sets have strong between-cluster disagreements and strong within-cluster agreements. Now, we introduce the L γ -PageRank formulation. Departing from the optimization problem in (2), we revamp PageRank to operate on the L γ -topology as follows.

Definition 4 The L γ -PageRank G-SSL is defined as the solution to the optimization problem:

arg min f f T D -1 γ L γ D -1 γ f + µ(f -y) T D -1 γ (f -y) (7)
The two following Lemmas show that, for any γ > 0, the L γ -PageRank solution exists in closed form and such solution preserves the PageRank properties.

Lemma 4 Let γ > 0. Then, problem ( 7) is convex with closed form solution given by

f = µ L γ D -1 γ + µI -1 y ( 8
)
The proof is provided in Appendix A.2.

Remark 2 Eq. ( 8) emphasizes the difference between our approach and the one in [START_REF] Zhou | Semi-supervised learning by higher order regularization[END_REF]: they propose to iterate the operator in the G-SSL solution as

f = µ LD -1 m + µI -1
y, for m ∈ Z >0 , for which the formulation of the optimization problem having this expression as solution remains unknown.

Remark 3

The solution of L γ -PageRank in Eq. ( 8) can be easily cast as a lowpass graph filter, allowing a fast and distributed approximation via Chebyshev polynomials [START_REF] Shuman | Distributed signal processing via chebyshev polynomial approximation[END_REF].

Lemma 5 Let γ > 0. The L γ -PageRank solution in (8) satisfies the following properties: (i) mass preservation: ∑ u∈V f u = ∑ u∈V y u ; (ii) stationarity: f = π γ if y = π γ ; and (iii) limit behavior: f → π γ as µ → 0 and f → y as µ → ∞.

The proof is provided in Appendix A. [START_REF] Zhao | Compact graph based semi-supervised learning for medical diagnosis in alzheimer's disease[END_REF].

The previous Lemmas are important because they show that our generalization, for any γ > 0, is a well-posed problem. Indeed, the properties of Lemma 5 imply that, while not necessarily modeled by random walkers, L γ -PageRank remains a diffusion process having π γ as stationary state and diffusion rate controlled by the µ parameter.

Our next results shows that it is hard for such diffusion process to escape clusters in the L γ -graphs.

Lemma 6 Let γ > 0 and let S ⊂ V be an arbitrary set with vol γ (S) ≤ vol γ (G) 2. For a labeled point placed at node u ∈ S with probability proportional to its generalized degree in S, i.e.

[Dγ ]uu volγ (S) , L γ -PageRank satisfies

E [f (S c )] ≤ h (γ) S µ ( 9
)
The proof is provided in Appendix A.4.

Lemma 6 admits a similar interpretation as Lemma 1. Namely, if L γ -PageRank is applied to the labeled points of some set S with small h (γ) S , then diffusion is confined to S and the score values outside of S are expected to be small. Thus, by looking at the nodes with largest score values we should be able to retrieve a good estimation of S. If such score concentration phenomenon takes place, then a sharp drop must appear after sorting the L γ -PageRank scores in descending order. We will use the following lemma to show that if a sharp drop is present, then the sweep cut procedure applied on the L γ -PageRank vector retrieves a partition Ŝ that has small h (γ) Ŝ .

Lemma 7 Let q denote the permutation vector and S j denote the set associated to q j obtained by applying the sweep-cut procedure on the L γ -PageRank vector. Then, the partition V = S j ∪ S c j satisfies the inequality:

A out (S j ) 2 - (q j -q j+1 ) (q 1 -q N ) -D out (S j ) 2 (q j -q j+1 ) (q 1 -q N ) -1 ≥ µ (y(S j ) -f (S j )) (q 1 -q n ) ≥ A out (S j ) 2 (q j -q j+1 ) (q 1 -q N ) -1 -D out (S j ) 2 - (q j -q j+1 ) (q 1 -q N ) ( 10
)
The proof is provided in Appendix A. [START_REF] Chung | Pagerank as a discrete green's function[END_REF].

We have that ∑ u∈Sj ∑ v∈S c j [W γ ] uv = A out (S j )-D out (S j ) ≥ 0. Thus, the generalized Cheeger ratio of S j is small if A out (S j ) is not much larger than D out (S j ). In the inequality above, we have two cases in which (q jq j+1 ) (q 1q N ) ≈ 1: (a) q is approximately constant; and (b) q has a drop that satisfies q j ≈ q 1 and q j+1 ≈ q N . The former can only occur if f → π γ and clearly no cluster can be retrieved from that vector, as confirmed by the inequality growing unbounded. The latter case is what we coin as having a sharp drop between q j and q j+1 . In such case, the inequality is controlled by the difference y(S j )f (S j ) which, due to the mass preserving property and the assumption that q j+1 ≈ q N , should be small. Thus, granting that A out (S j ) is not much larger than D out (S j ) and S j has a small h (γ) Sj . Discussion. The previous results show that L γ -PageRank is a sensible tool to find clusters in the L γ -graphs, i.e. groups of nodes with small generalized Cheeger ratio. Thus, revisiting the classification case in which we target group of nodes S gt , we have that the smaller the value of h (γ) Sgt , the better the L γ -PageRank method can recover it. This observation, in addition to noting that standard PageRank emerges as the particular case of γ = 1, indicate that we should be able to enhance the performance of G-SSL in the detection of S gt by finding the graph, i.e. the γ value, in which h

(γ) Sgt < h (1)
Sgt .

3.3

The selection of γ 3.3.1 Case of γ = 2: analytic study In Section 3.1, it was argued that the topology emerging from L 2 places a negatively weighted link between nodes at a 2-hop distance, thus carrying the potential to place a big amount of disagreements between clusters that may enhance their separability. Our next result formalizes this claim, demonstrating that on graphs from the Planted Partition model it is expected that the L 2 -graph improves the generalized Cheeger ratio. (2)

Sgt = 2E h (1) Sgt 2 , (11)
where E h

(1)

Sgt = p out (p in + p out ).
The proof is provided in Appendix A. [START_REF] Avrachenkov | Mean Field Analysis of Personalized PageRank with Implications for Local Graph Clustering[END_REF].

Corollary 1 If p in ≥ p out , then E h (2) Sgt ≤ E h (1)
Sgt , with equality occurring in the case p in = p out .

The proof is provided in Appendix A. [START_REF] Litvak | Characterization of tail dependence for in-degree and pagerank[END_REF].

Theorem 1 and Corollary 1 open the door to investigate, on arbitrary graphs, in which cases the L 2 -graph improves the generalized Cheeger ratio of a set. In the next Proposition, we provide a sufficient condition in which the L 2 -graph improves the generalized Cheeger ratio a set.

Proposition 1 Let ⟨D Sgt ⟩ denote the mean degree of S gt . A sufficient condition on S gt so that h

(2)

Sgt ≤ h (1) Sgt is ⟨D Sgt ⟩ ≥ max u∈Sgt v∈S c gt W uv + max w∈S c gt ∈Sgt W w , (12)
The proof is provided in Appendix A.8. This proposition points in the same direction as Theorem 1, saying that graphs having a cluster structure are bound to benefit from L 2 . Concretely, the first term on the right hand side of the inequality searches, among all the nodes of S gt , the one that has the maximum number of connections towards S c gt . The second term does the reverse for the nodes of S c gt . Hence, asking for the nodes of S gt to have, on average, more connections than the maximum possible boundary implies that S gt should have a cluster structure.

An algorithm for the estimation of the optimal γ

Numerical experiments show that increasing γ can further decrease the generalized Cheeger ratio up to a point where it starts increasing. We show an example of this phenomenon in Figure 2a, displaying the evolution of h (γ) Sgt as a function of γ when S gt corresponds to a digit of the MNIST dataset. From the figure, it is evident that an optimal value appears, denoted γ * = arg min γ h (γ) Sgt , raising the question of how to find such value. Since the behavior of h (γ) Sgt depends on S gt , in practice, the derivative or a greedy search to find γ * cannot be employed since S gt is unknown. A second question that arises is whether the optimal value changes drastically or smoothly with changes in S gt . We perform the following test: for a given S gt (same MNIST digit), we remove some percentage of the nodes in S gt and record the optimal value on subsets of S gt . More precisely, recall that h

(γ) Sgt = 1 T Sgt L γ 1 Sgt 1 T Sgt D γ 1
Sgt , hence we randomly select some percentage of the entries indexing S gt in 1 Sgt , set them to

v 1 , ⋯, v N , so that xv i ≥ xv i+1 for i = 1 ∶ N do if ∑ i j=1 xv j < 0.7 then Set (1 Ŝ )v i = 1 else Set (1 Ŝ )v i = 0 end if end for Compute h (γ) Ŝ = 1 T Ŝ L γ 1 Ŝ 1 T Ŝ Dγ 1 Ŝ ∀ γ Return γ = arg min γ h (γ) Ŝ .
zero and obtain a new indicator function indexing a subset of S gt . Mean results are evaluated in the original curve and displayed in Figure 2b. The figure suggest that it is not necessary to know S gt to find a proxy γ of γ * , it suffices to know a subset of S gt . Based on the last observation, we propose Algorithm 1 for the estimation of γ * . The rationale of the algorithm is to exploit the labeled points and the graph to find a proxy Ŝ of S gt on which we can compute the estimate. The procedure consists in letting walkers started from the label points, run for a number of steps that is determined by the maximum geodesic distance between the labels. This allows walkers to explore S gt without escaping too far from it. After running the walk, we list the nodes in descending order according to the probability of finding a walk at a node. We take the first element on the list (the one where it is more likely to find a walker), add it to Ŝ and remove it from the list, so that the former second element becomes the first in the listing. We repeat the procedure until the probability of finding a walker in the nodes conforming Ŝ is 0.7.

In Table 1, we evaluate the performance of Algorithm 1 on the estimation of γ * for all the digits of the MNIST. The first row displays, as γ * , the value of γ (from the input range) attaining the minimum generalized Cheeger ratio. The second row displays the performance of the algorithm when estimating such value. The last three rows show the value of the generalized Cheeger ratio evaluated at γ * , γ and 4 L γ -PageRank in practice

Planted Partition

Experimental setup and goals. In the following experiment, we show that L γ -PageRank can increase the performance of G-SSL as the graph approaches the Planted Partition detectability transition. More precisely, it is shown in [START_REF] Mossel | Reconstruction and estimation in the planted partition model[END_REF] that the Planted Partition possesses a detectability threshold above which unsupervised methods are unable to retrieve a meaningful clustering. Indeed, if the clusters sizes are denoted as S gt = S c gt = n, the mean degree of a node is given as C avg = C in + C out , where C out = (p out )(n) and C in = (p in )(n -1). It is then possible to recover a cluster that is positively correlated with the true partition, in an unsupervised manner, if (C in -C out ) 2 > 2(C in + C out ), and impossible otherwise. As for G-SSL, the work in [START_REF] Zhang | Phase transitions in semisupervised clustering of sparse networks[END_REF] showed that such threshold can be overcome when a fraction of labeled points is introduced to the task. Nonetheless, the performance of G-SSL drastically degrades when approaching the detectability transition.

The experimental setup is the following: for a given C out C in , a realization of the Planted Partition is drawn with n = 500 and C avg = 3. Then, 1% of labeled points are sampled at random and the L γ -PageRank method is applied for different values of µ lying on a discrete grid. The clusters are determined via a sweep-cut procedure, and the best performance is retained. The whole procedure is repeated for 10 different realizations of the labeled points. Finally, all the preceding steps are repeated for 100 graph realizations. Performance is assessed in terms of the Matthews Correlation Coefficient (MCC) [START_REF] Matthews | Comparison of the predicted and observed secondary structure of t4 phage lysozyme[END_REF], so that a value of 1 implies perfect agreement with the true partition and 0 a random decision. Results and discussion. Sgt , which, accordingly, enhances the clustering performance. Furthermore, the figure verifies that the smaller the value of h (γ) Sgt (right plot), the better the L γ -PageRank recovers the true partition (left plot). It is important to remark that, for this experiment, while γ = 2 shows good improvements, larger val- S , until it reaches a saturation plateau, designating a region of optimal γ values (γ ≥ 6).

Real world datasets

Experimental setup and goals. In our following experiment, we assesses the performance of L γ -PageRank and Algorithm 1 on real world datasets.

The experimental setup is as follows: graphs are build connecting the K-Nearest Neighbors (KNN) with distances computed via the Gaussian kernel, so that the weight between points x u and x v is given by

W uv = exp{-x u -x v 2 2 σ 2 }.
For each class, 2% of labeled points are randomly selected, L γ -PageRank is applied for a grid of µ values, partitions are retrieved via the sweep-cut, and the best performance, assessed in terms of MCC, is retained. Such procedure is repeated for 100 realization of labeled points, except for the MNIST on which 30 realizations only are employed. In all cases, classes are balanced in size and the graph construction parameters are selected to provide a good distribution of weights as follows: (a) MNIST [START_REF] Lecun | Gradient-based learning applied to document recognition[END_REF]: Images of handwritten digits (1 to 9). From the entire dataset, 200 images of each digit are selected and used to build the graph with KNN = 10 and σ = 10 4 ; (b) Gender Images [START_REF] Hond | Distinctive descriptions for face processing[END_REF]: Images of male and female subjects for gender recognition. From the entire dataset, 200 images of each gender are selected and used to build the graph with KNN = 60 and σ = 10 4 . The large value of KNN is to avoid disconnected components; (c) BBC articles [START_REF] Greene | Practical solutions to the problem of diagonal dominance in kernel document clustering[END_REF]: Word frequency attributes from news media articles. From the entire dataset, 200 business and 200 entertainment articles are used to build the graph with KNN = 5 and σ = 50; and (d) Phoneme [START_REF]The phoneme database[END_REF]: Five attributes to discern nasal sounds from oral sounds. From the entire dataset, 200 oral and 200 nasal sounds are used to build the graph with KNN = 10 and σ = 2. Results and discussion. Table 2 shows the performance of L γ -PageRank on the classification of these real world datasets. Clearly, the introduction of γ can significantly improve performance and, in general, the estimation γ performs close to the optimal value γ * . It can be seen that some datasets are more sensitive to γ than others. For instance, in the BBC articles we observe that a small change in γ, going from γ = 1 to γ * = 1.1, increases performance, and going further to γ = 1.3 and γ = 2 significantly worsens the classification. On the other hand, the MNIST dataset is less sensitive to γ, obtaining similar performances with larger variations in γ. It is important to stress that, thus far, we have assumed possession of the proper tuning of the diffusion rate (µ) that attains the best results. However, when working with real data, clusters may have intricate local structures, e.g. sub-clusters, that play an important role in the way information diffuses, and that can make more difficult the finding of the optimal diffusion rate µ. As a result, two clusters may have equal Cheeger ratios but one of them being harder to find if its local structure is complex. Digit 8 poses an example of this phenomenon, where the mean performance for γ is slightly better than that of γ * . This anomaly can be explained as an aftereffect of using a finite grid on µ: for some realization of labeled points, the best performance for γ * falls in a region not covered by the grid.

Sgt γ = 1 γ = 2 γ = γ γ = γ * Digit 1 0.

Unbalanced labeled data

Experimental setup and goals. In our last experiment, we show that L γ -PageRank, adapted to the multi-class setting described in Section 2.3, can improve the performance of G-SSL in the presence of unbalanced labeled data.

The experimental setup is as follows: graphs with two balanced classes (in size) are built using the datasets from the preceding experiments. The parameters of the graphs' construction follow the guidelines provided in Section 4.2. For the Planted Partition, the configuration is n = 200, C avg = 3, C out = 0.1. Then, unbalanced labeled points are drawn at random: 2% from one class and 6% from the other. Lastly, L γ -PageRank, in the multi-class setting, is applied for a grid of µ values and the best performance, assessed by MCC, is recorded. For the planted partition, the procedure is repeated over 15 realizations of the labeled points and for 100 graph realizations. For the other datasets, 100 realizations of labeled points are employed. Results and discussion. Table 3 displays the performance L γ -PageRank in the presence of unbalanced labeled data. It is important to stress that, in this framework, a unique value of γ * is used to retrieve all the clusters at the same time, precluding the notion of an optimal γ as defined in Section 3.3. However, one value of γ seems to perform better, we denote it as γ = Best. The results confirm that the introduction of γ helps to improve the classification in the presence of the unbalanced labeled data.

Conclusion

This work proposed L γ -PageRank, an extension of PageRank based on (non necessary integer) powers of the (combinatorial) Laplacian matrix. Our analysis shows that the added degree of freedom offers more versatility than standard PageRank, providing the potential to address some of the limitations of G-SSL. Precisely, we showed that when clusters are obtained via the sweep-cut procedure, L γ -PageRank can significantly outperform standard PageRank. Further, we showed that the multiclass approach also benefits from our proposition, as performance was enhanced in the presence of unbalanced labeled data. These improvements were possible due to the L γ (γ > 0) operator coding for graphs whose topology can reinforce the separability of clusters. The richness of such graphs comes from the sign of edges, allowing to code for similarities but also to emphasize dissemblance between individuals. Thus, while 2 nodes can only be disconnected on the initial graph, they can 'repulse' themselves in these topologies. Notably, we have shown that there is an optimal graph (related to an optimal γ) on which the classification will lead to a maximal performance. We proposed a simple yet efficient algorithm to estimate the optimal γ and hence determine the best topology for analyzing a given dataset. The procedures proposed in this work open the door for more in-depth study of the L γ -graphs and what determines their optimal topology. They also pave the way towards the extension of other standard clustering tools, such as Unsupervised Learning via Spectral Clustering, to exploit these richer topologies. = r (r + 1), which is monotonocally increasing with r. Thus, the task is the partition that minimizes r and consequently h (γ) S .

Appendix A: Proofs

A.2 Proof of Lemma 4

Proof It suffices to show the positive semi-definiteness of the functional and to apply the first order optimality condition. Let f = Q T D -1 γ f . Then, the left term satisfies

∑ j λ γ j f 2 j ≥ 0. It can be shown that [D γ ] uu = ∑ j Q 2 uj λ γ j ≥ 0 granting the right term satisfies ∑ u (f u -y u ) 2 [D γ ] uu ≥ 0. Now,
computing the derivative of the functional with respect to f and equaling to 0 leads to: L γ D -1 γ f + µ(fy) = 0. The lemma is proved after isolating f .

A.3 Proof of Lemma 5

Proof From the demonstration of Lemma (4) we have that

L γ D -1 γ f + µ(f -y) = 0. Then, 1 T L γ D -1 γ + µ1 T f = µ1 T y. Since 1 T L γ = 0 we have that 1 T f = 1 T y,
proving (i ). We prove property (iii ) using the same expression. We only develop the case µ → 0 since the case µ → ∞ follows the same steps: taking

lim µ→0 L γ D -1 γ f + µ(f -y) = 0 leads to L γ D -1 γ f = 0, whose solution is propor- tional to π γ = D γ 1 vol γ (G)
. Lastly, we prove (ii ) by noting that the operator

L γ D -1 γ has a positive real spectrum as it is similar to D -1 2 γ L γ D -1 2 γ
which is positive semi-definite. Thus, we can use the inverse Laplace transform of the resolvent

(L γ D -1 γ + µI) -1 = ∫
∞ 0 e -t e -tL γ D -1 γ µ dt, which, after using its Taylor expansion, allows to rewrite the PageRank solution as f = ∑ ∞ k=0

(-1) k µ k L γ D -1 γ k y. If y = π γ , the
previous equation is only non-zero for k = 0, proving (ii ).

A.4 Proof of Lemma 6

Proof Let y = D γ 1 S vol γ (S). Using (8) we can see that

1 T S c f = u∈S [D γ ] uu vol γ (S) 1 T S c µ L γ D -1 γ + µI -1 δ u , (13)
showing that 1 T S c f can be interpreted as E [f (S c )] when labels are selected with probability proportional to their generalized degree in S. Using the fact that

L γ D -1 γ + µI -1 L γ D -1 γ + µI = I, (14)
we express

f = I - 1 µ L γ D -1 γ + 1 µ L γ D -1 γ L γ D -1 γ + µI -1 L γ D -1 γ y. (15)
The upper bound is thus obtained by substituting y and summing over S.

1 T S f = 1 T S D γ 1 S vol γ (S) - 1 T S L γ 1 S µ vol γ (S) + 1 T S L γ (L γ + µD γ ) -1 L γ 1 S µ vol γ (S) , ≥ 1 T S D γ 1 S vol γ (S) - 1 T S L γ 1 S µ vol γ (S) , = 1 - h (γ) S µ . (16)
Employing property (i ) from Lemma 5 finishes the proof.

A.5 Proof of Lemma 7

Proof We only show the proof of the lower bound as the upper bound follows a similar derivation. We recast (4) as L γ D -1 γ f = µ (yf ). Thus, the set S j satisfies:

µ ((y(S j ) -f (S j )) = 1 T Sj L γ D -1 γ f = 1 T Sj L γ q = u∈Sj ,v∈S c j [W γ ] uv (q u -q v ) = u∈Sj ,v∈S c j W +
γ uv (q uq v ) -u∈Sj ,v∈S c j W - γ uv (q uq v ) + u∈Sj ,v∈S c j W + γ uv (q jq j+1 ) -u∈Sj ,v∈S c j W + γ uv (q jq j+1 ) + u∈Sj ,v∈S c j W - γ uv (q jq j+1 ) -u∈Sj ,v∈S c j W - γ uv (q jq j+1 ) ≥ (q jq j+1 ) (2A out (S j ) + D out (S j ))

-(q 1q N ) (2D out (S j ) + A out (S j ))

Re-ordering terms finishes the proof.

The case of E[h S . Thus p out (p in + p out ) ≥ 2(p out (p in + p out )) 2 , which can be further simplified to 1 ≥ 2p out (2p out + ). We observe that such expression holds for ≥ 0 and equality occurs when = 0.

A.8 Proof of Proposition 1

Proof We search a condition on S that permits W uw + max

∈S c v∈S W v , (23)
where we have used Lehmer's and Holder's inequalities and that 1

Figure 1

 1 Figure1Exemplification of the topology emerging from L 2 on a realization of the Planted Partition with 100 nodes and parameters p in = 0.5 and pout = 0.05. The positive edges coincide with the original structure but are reweighted. The negative ones appear between nodes that are initially at a 2-hop distance. It can be seen that a considerable amount of negative edges appear between clusters, bringing the potential to boost their detection.

Lemma 3

 3 Let S * = arg min S h (γ) S . Then, S * also maximizes D out (S * ) and A in (S * ).

Theorem 1

 1 Consider a Planted Partition model of parameters (p in , p out ) and cluster sizes S gt = S c gt = n. Then, as n → ∞ we have that E h

Figure 2 Algorithm 1

 21 Figure 2 Generalized Cheeger ratio of Sgt as a function of γ. For the plot, Sgt is a digit of the MNIST dataset.

Figure 3

 3 displays the performance of L γ -PageRank at recovering the Planted Partition as a function of the ratio C out C in . Standard PageRank (γ = 1) performs poorly as the configuration approaches the phase transition (referred by the vertical line) since h (1) S becomes large. Clearly, the introduction of γ allows to decrease h (γ)

Figure 3

 3 Figure 3 Improved detection of the Planted Partition.

A. 1

 1 Proof of Lemma 3Proof Let r = (A out (S) -D out (S)) (A in (S) -D in (S)). It is easy to show that h (γ) S

A. 6 (- 1 )(- 1 ) i E 1 TS=

 6111 Proof of Theorem 1Proof Let n = S . For u, v ∈ S and w ∈ S c the Planted Partition satisfies ∑ v W uv ∼ B(n -1, p in ) and ∑ w W uw ∼ B(n, p out ). The key step in the proof is to show that, in the limit n → ∞, E h (S)] , and the same for h(2) S . By application of the Chebyshev inequality we have thatP r (d u -E [d u ] ≥ E [d u ]) ≤ var(d u ) var(d u ) + E [d u ] 2 = O(n -1 ).(18)Thus, in the limit of n → ∞ we can establish the inequality d u < 2E [d u ] and further that vol(S) < 2E [vol(S)]. This latter allows to expressE h i E[1 T S L1 S ]⟪ i vol(S)⟫ + ⟪1 T S L1 S , i vol(S)⟫ E [vol(S)] L1 S (vol(S) -E[vol(S)]) i E[vol(S)] i+1 E [vol(S)] + ∞ i=1 (-1) i c i(19)where ⟪a,i b⟫ = E (a -E[a])(b -E[b]) i . The fact that vol(S) < 2E [vol(S)] and the monotonicity of the expected value imply that the sequence ∑ i c i decreases monotonically. Also, it can be shown that its dominant term: c 1 = O(n -2 ). Replacing the expectations and evaluating the limit leads to lim n→∞ p in + p out .

( 2 )Proof

 2 S ] follows a similar derivation. Since[D 2 ] uu = d 2 u + d u , the Jensen inequality implies that [D 2 ] uu < 2E [[D 2 ] uu ] and consequently that vol 2 (S) < 2E [vol 2 (S)]. Thus, we cast E h variable O u = ∑ w∈S c W uw . Then we have that 1 T S L 2 1 S = 2 ∑ u∈S (O u ) 2 . This fact, in addition to vol 2 (S) = ∑ u∈S d 2 u + d u , allow to show that the sequence ∑ i c (2) i is monotonically decreasing with c (2) 1 = O(n -1). Replacing the expectations and evaluating the limit leads to lim n→∞ Let p in = p out + and assume that h

Table 1

 1 Evaluation of Algorithm 1 on the MNIST Dataset. Mean values (95% confidence interval) are shown. The graph construction guidelines are provided in Section 4.2. For the experiment, 500 realizations of labeled points and a grid of γ ranging from 1 to 7 with a resolution of 0.2 were used.

	Digit	1	2	3	4	5	6	7	8	9
	γ *	7.0	3.0	7.0	3.2	3.2	7.0	7.0	3.2	4.2
	γ	5.45 (0.15)	3.10 (0.14)	6.41 (0.11)	4.92 (0.16)	3.20 (0.14)	6.04 (0.15)	4.98 (0.17)	4.40 (0.18)	5.08 (0.15)
	h (γ * ) S gt	0.065	0.166	0.035	0.141	0.131	0.011	0.052	0.116	0.135
	(γ) h S gt	0.073 (9e-4)	0.174 (8e-4)	0.041 (1e-3)	0.185 (4e-3)	0.148 (2e-3)	0.017 (1e-3)	0.074 (2e-3)	0.142 (2e-3)	0.149 (9e-4)
	h (1) S gt	0.175	0.248	0.216	0.258	0.233	0.107	0.203	0.215	0.285

γ = 1, respectively. The estimator finds values of γ whose Cheeger ratios are: (a) significantly smaller than those of γ = 1; (b) close to the optimal.

Table 2

 2 Performance on real world datasets: each cell reports MCC, 95% confidence interval (parenthesis) and the value of γ [squared brackets].

			67 (0.075)	0.78 (0.032)	0.78 (0.034) [5.4]	0.80 (0.027) [7.0]
		Digit 2	0.38 (0.042)	0.60 (0.064)	0.64 (0.059) [3.3]	0.64 (0.059) [3.0]
		Digit 3	0.47 (0.040)	0.61 (0.032)	0.61 (0.028) [6.0]	0.61 (0.028) [7.0]
		Digit 4	0.39 (0.022)	0.48 (0.036)	0.53 (0.044) [4.7]	0.53 (0.037) [3.2]
	MNIST	Digit 5	0.44 (0.036)	0.56 (0.046)	0.61 (0.036) [3.3]	0.64 (0.035) [3.2]
		Digit 6	0.90 (0.039)	0.94 (0.003)	0.94 (0.002) [6.0]	0.94 (0.002) [7.0]
		Digit 7	0.43 (0.027)	0.66 (0.043)	0.71 (0.042) [4.8]	0.75 (0.032) [7.0]
		Digit 8	0.47 (0.062)	0.65 (0.057)	0.74 (0.038) [4.8]	0.72 (0.050) [3.2]
		Digit 9	0.43 (0.020)	0.52 (0.026)	0.53 (0.023) [4.9]	0.56 (0.026) [4.2]
	Gender	Female	0.51 (0.039)	0.57 (0.028)	0.57 (0.020) [3.0]	0.57 (0.028) [2.0]
	images	Male	0.55 (0.028)	0.61 (0.021)	0.60 (0.022) [3.3]	0.61 (0.021) [2.4]
	BBC	Business	0.80 (0.020)	0.53 (0.038)	0.72 (0.040) [1.3]	0.81 (0.021) [1.1]
	articles	Entmt.	0.84 (0.027)	0.57 (0.040)	0.76 (0.047) [1.5]	0.86 (0.025) [1.3]
	Phoneme	Nasal	0.37 (0.030)	0.41 (0.028)	0.43 (0.025) [2.9]	0.43 (0.025) [3.0]
		Oral	0.41 (0.025)	0.44 (0.022)	0.46 (0.019) [2.8]	0.46 (0.019) [3.0]

Table 3

 3 Performance on unbalanced labaled data: each cell reports MCC, 95% confidence interval (parenthesis) and the value of γ [squared brackets].

		Planted Partition	MNIST 4vs9	MNIST 3vs8	BBC articles	Gender images	Phoneme
	γ = 1	0.81 (1.1e-2)	0.51 (1.5e-2)	0.70 (1.4e-2)	0.66 (1.8e-2)	0.63 (2.1e-2)	0.44 (2.3e-2)
	γ = 2	0.87 (8.7e-3)	0.56 (1.5e-2)	0.76 (1.2e-2)	0.92 (5.0e-3)	0.73 (1.6e-2)	0.48 (1.4e-2)
		0.90	0.57	0.78	0.93	0.75	0.48
	γ = Best	(7.0e-3) [6]	(1.5e-2) [3]	(1.2e-2) [4]	(1.5e-3) [3]	(1.7e-2) [3]	(1.4e-2) [1.9]

  T S L 2 1 S = ∑ u∈S (∑ w∈S c W uw ) 2 + ∑ ∈S c (∑ v∈S W v ) 2 .Thus, it is sufficient that S satisfies

	vol(S) S	-max u∈S w∈S c	W uw + max ∈S c	v∈S	W v ≥ 0	(24)

Acknowledgements

Not applicable

Funding

This work was supported by CONACyT and the Labex MILyon

Author's contributions EB, PA and PG participated equally in designing and developing the project, and in writing the paper.

Availability of data and material

All data generated or analysed during this study are included the following articles [START_REF] Lecun | Gradient-based learning applied to document recognition[END_REF][START_REF] Hond | Distinctive descriptions for face processing[END_REF][START_REF] Greene | Practical solutions to the problem of diagonal dominance in kernel document clustering[END_REF][START_REF]The phoneme database[END_REF]. The code to replicate the results is available in the GitHub repository, https://github.com/estbautista/Lgamma-PageRank Paper.

Competing interests

The authors declare that they have no competing interests.

Author details 1 Univ Lyon, Inria, CNRS, ENS de Lyon, UCB Lyon 1, LIP UMR 5668, F-69342 Lyon, France. 2 Univ Lyon, Ens de Lyon, Univ Claude Bernard, CNRS, Laboratoire de Physique, F-69342 Lyon, France.