Matthew Farrell

Generating author description...

All published works

Action	Title	Year	Authors
+	Capacity of Group-invariant Linear Readouts from Equivariant Representations: How Many Objects can be Linearly Classified Under All Possible Views?	2021	Matthew Farrell Blake Bordelon Shubhendu Trivedi Cengiz Pehlevan
+	Dimensionality compression and expansion in Deep Neural Networks	2019	Stefano Recanatesi Matthew Farrell Madhu Advani Timothy C. Moore Guillaume Lajoie Eric Shea‐Brown
+ PDF Chat	Hyperbolicity, degeneracy, and expansion of random intersection graphs	2017	Blair D. Sullivan Matthew Farrell Fernando Sánchez Villaamil Felix Reidl Nathan Lemons Timothy D. Goodrich
+ PDF Chat	Multi-Eulerian Tours of Directed Graphs	2016	Matthew Farrell Lionel Levine
+	CoEulerian graphs	2015	Matthew Farrell Lionel Levine
+	Multi-Eulerian tours of directed graphs	2015	Matthew Farrell Lionel Levine
+ PDF Chat	Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs	2015	Matthew Farrell Timothy D. Goodrich Nathan Lemons Felix Reidl Fernando Sánchez Villaamil Blair D. Sullivan
+	Hyperbolicity, degeneracy, and expansion of random intersection graphs	2014	Matthew Farrell Timothy D. Goodrich Nathan Lemons Felix Reidl Fernando Sánchez Villaamil Blair D. Sullivan

Common Coauthors

Coauthor	Papers Together
Felix Reidl	3
Blair D. Sullivan	3
Fernando Sánchez Villaamil	3
Timothy D. Goodrich	3
Lionel Levine	3
Nathan Lemons	2
Eric Shea‐Brown	1
Guillaume Lajoie	1
Stefano Recanatesi	1
Madhu Advani	1
Blake Bordelon	1
Cengiz Pehlevan	1
Timothy C. Moore	1
Shubhendu Trivedi	1
Nathan Lemons	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Structural Sparsity of Complex Networks: Bounded Expansion in Random Models and Real-World Graphs	2014	Erik D. Demaine Felix Reidl Peter Rossmanith Fernando Sánchez Villaamil Somnath Sikdar Blair D. Sullivan	3
+	Characterisations and examples of graph classes with bounded expansion	2011	Jaroslav Nešetřil Patrice Ossona de Mendez David R. Wood	3
+ PDF Chat	Degree and clustering coefficient in sparse random intersection graphs	2013	Mindaugas Bloznelis	3
+ PDF Chat	The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees	1990	David Aldous	3
+	Generating random spanning trees	1989	Arndt Bröder	3
+ PDF Chat	Assortativity and clustering of sparse random intersection graphs	2013	Mindaugas Bloznelis Jerzy Jaworski Valentas Kurauskas	3
+ PDF Chat	Large-scale curvature of networks	2011	Onuttom Narayan Iraj Saniee	3
+	Orbits of rotor-router operation and stationary distribution of random walks on directed graphs	2015	Trung Van Pham	3
+	The degree of a typical vertex in generalized random intersection graph models	2006	Jerzy Jaworski Michał Karoński Dudley Stark	3
+	Diameter, connectivity, and phase transition of the uniform random intersection graph	2011	Katarzyna Rybarczyk	3
+	On Random Intersection Graphs: The Subgraph Problem	1999	Michał Karoński Edward R. Scheinerman Karen B. Singer-Cohen	3
+ PDF Chat	Connectivity in secure wireless sensor networks under transmission constraints	2014	Jun Zhao Osman Yağan Virgil D. Gligor	2
+ PDF Chat	First order properties on nowhere dense structures	2010	Jaroslav Nešetřil Patrice Ossona de Mendez	2
+ PDF Chat	Chip-Firing and Rotor-Routing on Directed Graphs	2008	Alexander E. Holroyd Lionel Levine Karola Mészáros Yuyal Peres James Propp David B. Wilson	2
+ PDF Chat	Epidemics on random intersection graphs	2014	Frank Ball David Sirl Pieter Trapman	2
+ PDF Chat	Eulerian Walkers as a Model of Self-Organized Criticality	1996	V. B. Priezzhev Deepak Dhar Abhishek Dhar Supriya Krishnamurthy	2
+	The coupling method for inhomogeneous random intersection graphs	2013	Katarzyna Rybarczyk	2
+ PDF Chat	Component Evolution in Random Intersection Graphs	2007	Michael Behrisch	2
+	Scaled Gromov hyperbolic graphs	2007	Edmond Jonckheere P. Lohsoonthorn Francis Bonahon	2
+ PDF Chat	On the strengths of connectivity and robustness in general random intersection graphs	2014	Jun Zhao Osman Yağan Virgil D. Gligor	2
+ PDF Chat	RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING	2009	Maria Deijfen Willemien Kets	2
+ PDF Chat	A Note on the Component Structure in Random Intersection Graphs with Tunable Clustering	2008	Andreas Nordvall Lagerås Mathias Lindholm	2
+	Metric Spaces of Non-Positive Curvature	1999	Martin R. Bridson André Haefliger	2
+ PDF Chat	Testing first-order properties for subclasses of sparse graphs	2013	Zdeněk Dvořák Daniel Kráľ Robin Thomas	2
+	Rotor walks and Markov chains	2010	Alexander E. Holroyd James Propp	2
+	METRIC SPACES OF NON-POSITIVE CURVATURE (Grundlehren der Mathematischen Wissenschaften 319) <i>By</i> M<scp>ARTIN</scp> R. B<scp>RIDSON</scp> and A<scp>NDRÉ</scp> H<scp>AEFLIGER</scp>: 643 pp., £58.50, <scp>ISBN</scp> 3-540-64324-9 (Springer, Berlin, 1999).	2001	Graham A. Niblo	2
+ PDF Chat	Classification and Geometry of General Perceptual Manifolds	2018	SueYeon Chung Daniel D. Lee Haim Sompolinsky	2
+	None	2008	Edmond Jonckheere P. Lohsoonthorn Francis Bonahon	2
+	Large cliques in sparse random intersection graphs	2013	Mindaugas Bloznelis Valentas Kurauskas	2
+ PDF Chat	Random graphs with arbitrary degree distributions and their applications	2001	M. E. J. Newman Steven H. Strogatz Duncan J. Watts	2
+ PDF Chat	None	1992	Anders Björner László Lovász	2
+	On <i>k</i>-Connectivity and Minimum Vertex Degree in Random <i>s</i>-Intersection Graphs	2014	Jun Zhao Osman Yağan Virgil D. Gligor	2
+	Chip-Firing and Riemann-Roch Theory for Directed Graphs	2010	Arash Asadi Spencer Backman	2
+ PDF Chat	On the Hyperbolicity of Small-World and Treelike Random Graphs	2013	Wei Chen Wenjie Fang Guang‐Da Hu Michael W. Mahoney	2
+	Fast computation of empirically tight bounds for the diameter of massive graphs	2009	Clémence Magnien Matthieu Latapy Michel Habib	1
+	Measuring the strangeness of strange attractors	1983	Peter Grassberger Itamar Procaccia	1
+	Non-Hyperbolicity of Random Graphs with Given Expected Degrees	2013	Yilun Shang	1
+	Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms.	2014	Erik D. Demaine Felix Reidl Peter Rossmanith Fernando Sánchez Villaamil Somnath Sikdar Blair D. Sullivan	1
+	Polynomial time algorithms in the theory of linear diophantine equations	1977	M. A. Frumkin	1
+	Generating random spanning trees more quickly than the cover time	1996	David B. Wilson	1
+	On nowhere dense graphs	2011	Jaroslav Nešetřil Patrice Ossona de Mendez	1
+	An O(m) Algorithm for Cores Decomposition of Networks	2003	Vladimir Batagelj Matjaž Zaveršnik	1
+	Enumerative Combinatorics	1999	Richard P. Stanley Sergey Fomin	1
+	The role of dimensionality reduction in linear classification	2014	Weiran Wang Miguel Á. Carreira-Perpiñán	1
+	Asymptotically Fast Triangularization of Matrices over Rings	1991	James Lee Hafner Kevin S. McCurley	1
+ PDF Chat	No polynomial bound for the chip firing game on directed graphs	1991	Kimmo Eriksson	1
+	Riemann–Roch and Abel–Jacobi theory on a finite graph	2007	Matthew Baker Serguei Norine	1
+	Chip-firing Games on Graphs	1991	Anders Björner László Lovász Peter W. Shor	1
+	Grad and classes with bounded expansion II. Algorithmic aspects	2007	Jaroslav Nešetřil Patrice Ossona de Mendez	1
+ PDF Chat	Grad and classes with bounded expansion I. Decompositions	2007	Jaroslav Nešetřil Patrice Ossona de Mendez	1