Refine my results

Relative second bounded cohomology of free groups

Pagliantini, Cristina ; Rolli, Pascal

In: Geometriae Dedicata, 2015, vol. 175, no. 1, p. 267-280

Heat kernels on regular graphs and generalized Ihara zeta function formulas

Chinta, G. ; Jorgenson, J. ; Karlsson, A.

In: Monatshefte für Mathematik, 2015, vol. 178, no. 2, p. 171-190

Transfer current and pattern fields in spanning trees

Kassel, Adrien ; Wu, Wei

In: Probability Theory and Related Fields, 2015, vol. 163, no. 1-2, p. 89-121

Invariants and separating morphisms for algebraic group actions

Dufresne, Emilie ; Kraft, Hanspeter

In: Mathematische Zeitschrift, 2015, vol. 280, no. 1-2, p. 231-255

Nonsmooth trust region algorithms for locally Lipschitz functions on Riemannian manifolds

Grohs, P. ; Hosseini, S.

In: Ima Journal of Numerical Analysis, 2016, vol. 36, no. 3, p. 1167-1192

Self-avoiding walk on $\mathbb{Z}^{2}$ with Yang–Baxter weights : Universality of critical fugacity and 2-point function

Glazman, Alexander ; Manolescu, Ioan

In: Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, 2020, vol. 56, no. 4, p. 2281–2300

We consider a self-avoiding walk model (SAW) on the faces of the square lattice Z2. This walk can traverse the same face twice, but crosses any edge at most once. The weight of a walk is a product of local weights: each square visited by the walk yields a weight that depends on the way the walk passes through it. The local weights are parametrised by angles θ∈[π3,2π3] and satisfy the...

Maximum eccentric connectivity index for graphs with given diameter

Hauweele, Pierre ; Hertz, Alain ; Mélot, Hadrien ; Ries, Bernard ; Devillez, Gauvain

In: Discrete Applied Mathematics, 2019, vol. 268, p. 102-111

The eccentricity of a vertex v in a graph G is the maximum distance between v and any other vertex of G. The diameter of a graph G is the maximum eccentricity of a vertex in G. The eccentric connectivity index of a connected graph is the sum over all vertices of the product between eccentricity and degree. Given two integers n and D with D ≤ n−1, we characterize those graphs which have...

On Sub-determinants and the Diameter of Polyhedra

Bonifas, Nicolas ; Di Summa, Marco ; Eisenbrand, Friedrich ; Hähnle, Nicolai ; Niemeier, Martin

In: Discrete & Computational Geometry, 2014, vol. 52, no. 1, p. 102-115

Diameter Graphs in $${\mathbb R}^4$$ R 4

Kupavskii, Andrey

In: Discrete & Computational Geometry, 2014, vol. 51, no. 4, p. 842-858

Graph-Theoretical Analysis of the Swiss Road and Railway Networks Over Time

Erath, Alexander ; Löchl, Michael ; Axhausen, Kay

In: Networks and Spatial Economics, 2009, vol. 9, no. 3, p. 379-400