Nicolas Fraiman

Orcid: 0000-0002-2604-0794

According to our database1, Nicolas Fraiman authored at least 18 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs.
SIAM J. Matrix Anal. Appl., March, 2024

2022
On the Power of Choice for Boolean Functions.
SIAM J. Discret. Math., September, 2022

Community modulated recursive trees and population dependent branching processes.
Random Struct. Algorithms, 2022

Escape times for subgraph detection and graph partitioning.
CoRR, 2022

Opinion dynamics on directed complex networks.
CoRR, 2022

Beam Search for Feature Selection.
CoRR, 2022

Algorithms for the ferromagnetic Potts model on expanders.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities.
SIAM J. Math. Data Sci., 2021

Classification with Nearest Disjoint Centroids.
CoRR, 2021

2020
Recursive functions on conditional Galton-Watson trees.
Random Struct. Algorithms, 2020

Biclustering with Alternating K-Means.
CoRR, 2020

2018
The diameter of inhomogeneous random graphs.
Random Struct. Algorithms, 2018

2015
A De Bruijn-Erdős Theorem for Chordal Graphs.
Electron. J. Comb., 2015

2014
Connectivity of inhomogeneous random graphs.
Random Struct. Algorithms, 2014

Connectivity threshold of Bluetooth graphs.
Random Struct. Algorithms, 2014

The Random Connection Model on the Torus.
Comb. Probab. Comput., 2014

2013
Lines in hypergraphs.
Comb., 2013

2012
Depth Properties of scaled attachment random recursive trees.
Random Struct. Algorithms, 2012


  Loading...